Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
From MaRDI portal
Publication:799371
DOI10.1007/BF00264615zbMath0548.68044WikidataQ56028156 ScholiaQ56028156MaRDI QIDQ799371
Publication date: 1984
Published in: Acta Informatica (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (25)
Attacks on quantum key distribution protocols that employ non-ITS authentication ⋮ Locality-preserving hash functions for general purpose parallel computation ⋮ Optimal parallel randomized algorithms for sparse addition and identification ⋮ A probabilistic simulation of PRAMs on a bounded degree network ⋮ Efficient PRAM simulation on a distributed memory machine ⋮ Universal Hashing via Integer Arithmetic Without Primes, Revisited ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ Representing shared data on distributed-memory parallel computers ⋮ A new scheme for the deterministic simulation of PRAMs in VLSI ⋮ A complexity theory of efficient parallel algorithms ⋮ Linear Hashing Is Awesome ⋮ Fast rehashing in PRAM emulations ⋮ Practical constructive schemes for deterministic shared-memory access ⋮ Improved deterministic PRAM simulation on the mesh ⋮ The complexity of deterministic PRAM simulation on distributed memory machines ⋮ Permutations on the block PRAM ⋮ Trade-offs between communication throughput and parallel time ⋮ Polynomial hash functions are reliable ⋮ Towards a scalable and robust DHT ⋮ Analysis of parallel uniform hashing ⋮ Deterministic P-RAM simulation with constant redundancy ⋮ Algorithms for the parallel alternating direction access machine ⋮ A parallel-design distributed-implementation (PDDI) general-purpose computer ⋮ Quantum key distribution using universal hash functions over finite fields ⋮ How to emulate shared memory
This page was built for publication: Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories