The complexity of deterministic PRAM simulation on distributed memory machines (Q679435): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sorting Algorithms for Parallel Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing shared data on distributed-memory parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel hashing / 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: A new scheme for the deterministic simulation of PRAMs in VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Token Distribution Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share memory in a distributed system / rank
 
Normal rank

Revision as of 12:16, 27 May 2024

scientific article
Language Label Description Also known as
English
The complexity of deterministic PRAM simulation on distributed memory machines
scientific article

    Statements