Exploiting storage redundancy to speed up randomized shared memory simulations

Randomized protocols for low-congestion circuit routing in multistage interconnection networks

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Fast concurrent access to parallel disks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms

Almost random graphs with simple hash functions

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

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

Balanced allocation on graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation

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

Tight bounds for parallel randomized load balancing: extended abstract

Proceedings of the forty-third annual ACM symposium on Theory of computing