Explicit expanders and the Ramanujan conjectures
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Sorting and selecting in rounds
SIAM Journal on Computing
Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Finding an approximate maximum
SIAM Journal on Computing
Introduction to algorithms
Compared to what?: an introduction to the analysis of algorithms
Compared to what?: an introduction to the analysis of algorithms
Optimal randomized algorithms for local sorting and set-maxima
SIAM Journal on Computing
Random Cayley graphs and expanders
Random Structures & Algorithms
Matching nuts and bolts in O(n log n) time
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Selection with monotone comparison costs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Using expander graphs to find vertex connectivity
Journal of the ACM (JACM)
Sorting and selection with random costs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Hi-index | 0.00 |