Pages that link to "Item:Q799371"
From MaRDI portal
The following pages link to Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories (Q799371):
Displaying 28 items.
- Attacks on quantum key distribution protocols that employ non-ITS authentication (Q265393) (← links)
- Fast rehashing in PRAM emulations (Q672145) (← links)
- Practical constructive schemes for deterministic shared-memory access (Q675852) (← links)
- The complexity of deterministic PRAM simulation on distributed memory machines (Q679435) (← links)
- Towards a scalable and robust DHT (Q733718) (← links)
- Analysis of parallel uniform hashing (Q750157) (← links)
- Deterministic P-RAM simulation with constant redundancy (Q756419) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- How to emulate shared memory (Q808683) (← links)
- A new scheme for the deterministic simulation of PRAMs in VLSI (Q911777) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Optimal parallel randomized algorithms for sparse addition and identification (Q1103402) (← links)
- A probabilistic simulation of PRAMs on a bounded degree network (Q1113672) (← links)
- Permutations on the block PRAM (Q1209324) (← links)
- Locality-preserving hash functions for general purpose parallel computation (Q1333434) (← links)
- Algorithms for the parallel alternating direction access machine (Q1575740) (← links)
- Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs (Q1881272) (← links)
- Efficient PRAM simulation on a distributed memory machine (Q1923863) (← links)
- Quantum key distribution using universal hash functions over finite fields (Q2107057) (← links)
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security (Q2690521) (← links)
- Linear Hashing Is Awesome (Q4634035) (← links)
- Improved deterministic PRAM simulation on the mesh (Q4645193) (← links)
- Representing shared data on distributed-memory parallel computers (Q4866678) (← links)
- Polynomial hash functions are reliable (Q5204320) (← links)
- Trade-offs between communication throughput and parallel time (Q5906374) (← links)
- Universal Hashing via Integer Arithmetic Without Primes, Revisited (Q6163629) (← links)
- Linear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya bounds (Q6566468) (← links)
- Parallel machine models: how they are and where are they going (Q6573922) (← links)
