Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
How to share memory in a distributed system
Journal of the ACM (JACM)
Parallel hashing—an efficient implementation of shared memory
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
A bridging model for parallel computation
Communications of the ACM
A guided tour of Chernoff bounds
Information Processing Letters
A new universal class of hash functions and dynamic hashing in real time
Proceedings of the seventeenth international colloquium on Automata, languages and programming
How to distribute a dictionary in a complete network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Converting high probability into nearly-constant time—with applications to parallel hashing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Fast and reliable parallel hashing
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient optical communication in parallel computers
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines
Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use
Parallel algorithms column 1: models of computation
ACM SIGACT News
An Ω(√ log log n) lower bound for routing in optical networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Constructive deterministic PRAM simulation on a mesh-connected computer
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
An optical simulation of shared memory
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
On contention resolution protocols and associated probabilistic phenomena
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On contention resolution protocols and associated probabilistic phenomena
Journal of the ACM (JACM)
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Contention resolution with constant expected delay
Journal of the ACM (JACM)
Work-optimal simulation of PRAM models on meshes
Nordic Journal of Computing
Simplified Witness Tree Arguments
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
How asymmetry helps load balancing
Journal of the ACM (JACM)
Gossiping and broadcasting versus computing functions in networks
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Efficient hashing with lookups in two memory accesses
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Load balancing and orientability thresholds for random hypergraphs
Proceedings of the forty-second ACM symposium on Theory of computing
Thinning protocols for routing h-relations over shared media
Journal of Parallel and Distributed Computing
Stabilizing consensus with the power of two choices
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Asynchronous parallel reliefboard computation for scene object approximation
EG PGV'10 Proceedings of the 10th Eurographics conference on Parallel Graphics and Visualization
Hi-index | 0.00 |