A constant-time parallel algorithm for computing convex hulls (Q1162818): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting on a mesh-connected parallel computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Computations in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Parallel-Sorting Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bitonic Sort on a Mesh-Connected Parallel Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403756 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:24, 13 June 2024

scientific article
Language Label Description Also known as
English
A constant-time parallel algorithm for computing convex hulls
scientific article

    Statements

    A constant-time parallel algorithm for computing convex hulls (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    22, 130-134 (1982)
    0 references
    parallel algorithm
    0 references
    sequential algorithm
    0 references