Processor-time tradeoffs in PRAM simulations (Q1185246): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Theorems for Systems of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between Concurrent-Write Models of Parallel Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulations among concurrent-write PRAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal interconnection pattern for parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large parallel machines can be extremely slow for small problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation and conflicts in memory access / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the maximum, merging, and sorting in a parallel computation model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank

Latest revision as of 17:20, 15 May 2024

scientific article
Language Label Description Also known as
English
Processor-time tradeoffs in PRAM simulations
scientific article

    Statements

    Identifiers