SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS (Q4820152): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal bounds for decision problems on the CRCW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds on the Complexity of Parallel Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in Comparison Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting on PRAMs with reconfigurable buses / rank
 
Normal rank

Latest revision as of 14:30, 7 June 2024

scientific article; zbMATH DE number 2106737
Language Label Description Also known as
English
SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS
scientific article; zbMATH DE number 2106737

    Statements