Optimal parallel selection in sorted matrices (Q671400): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q126590514, #quickstatements; #temporary_batch_1719410179150
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Optimal parallel algorithms for computing convex hulls and for sorting / rank
 
Normal rank
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: Generalized Selection and Ranking: Sorted Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Selection / 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: A lower bound for sorting networks based on the shuffle permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Simplicity of Compaction and Chaining / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parallel selection and searching in partial orders: Sorted matrices / 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 / Wikidata QID
 
Property / Wikidata QID: Q126590514 / rank
 
Normal rank

Latest revision as of 15:57, 26 June 2024

scientific article
Language Label Description Also known as
English
Optimal parallel selection in sorted matrices
scientific article

    Statements

    Optimal parallel selection in sorted matrices (English)
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    EREW PRAM
    0 references
    Parallel algorithms
    0 references
    Selection
    0 references
    Sorted matrix
    0 references
    Time complexity
    0 references
    0 references
    0 references