|
35
|
An Optical Simulation of Shared Memory
– Leslie Ann Goldberg, Coventry Cv Al England, Yossi Matias, Satish Rao
- 1994
|
|
35
|
auf der Heide. Simple, efficient shared memory simulations
– M Dietzfelbinger, F Meyer
|
|
81
|
auf der Heide. Efficient PRAM simulation on a distributed memory machine
– R M Karp, M Luby, F Meyer
- 1992
|
|
38
|
Doubly Logarithmic Communication Algorithms for Optical Communication Parallel Computers
– Leslie Ann Goldberg, Mark Jerrum, Tom Leighton, Satish Rao, Tom Leighton Mit
- 1994
|
|
32
|
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations
– Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann
- 1996
|
|
70
|
Expected length of the longest probe sequence in hash code searching
– G H Gonnet
- 1981
|
|
51
|
Parallel Randomized Load Balancing
– Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Rasmussen
- 1995
|
|
1206
|
Introduction to Parallel Algorithms and Architectures: Arrays
– F T Leighton
- 1992
|
|
210
|
Balanced Allocations
– Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
- 1994
|
|
43
|
T.: Efficient optical communication in parallel computers
– M Gerèb-Graus, Tsantilas
- 1992
|
|
319
|
On the method of bounded differences
– C McDiarmid
- 1989
|
|
159
|
The Power of Two Choices in Randomized Load Balancing
– Michael David Mitzenmacher
- 1996
|
|
8
|
Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration
– A. Czumaj, F. Meyer auf der Heide, F. Meyer, V. Stemann
|
|
190
|
How to emulate shared memory
– A RANADE
- 1985
|
|
67
|
Analysis of Backoff Protocols for Multiple Access Channels
– J Hastad, T Leighton, B Rogoff
- 1996
|
|
337
|
D.R.: Ethernet: distributed packet switching for local computer networks
– R M Metcalfe, Boggs
- 1976
|
|
1567
|
Randomized Algorithms
– R Motwani, P Raghavan
- 1995
|
|
1478
|
The probabilistic method
– Joel Spencer
- 1992
|
|
590
|
Universal classes of hash functions
– J L Carter, M N Wegman
- 1979
|
