Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers (Q4805931): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel median algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimally efficient selection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined complexity analysis for heap operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Lower Bound for Selection and Set Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved universal \(k\)-selection in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Processing with the Perfect Shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds for selection / rank
 
Normal rank

Latest revision as of 16:11, 5 June 2024

scientific article; zbMATH DE number 1907983
Language Label Description Also known as
English
Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers
scientific article; zbMATH DE number 1907983

    Statements

    Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 May 2003
    0 references
    0 references
    multiselection
    0 references
    mesh-connected computers
    0 references
    0 references