A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Sample spaces uniform on neighborhoods
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Constructing small sample spaces satisfying given constraints
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Randomness in private computations
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Amortizing randomness in private multiparty computations
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved Deterministic Parallel Padded Sorting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Sparse Parity-Check Matrices over ${GF(q)}$
Combinatorics, Probability and Computing
Fast range-summable random variables for efficient aggregate estimation
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Sparse parity-check matrices over finite fields
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Testing non-uniform k-wise independent distributions over product spaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
| Hi-index | 0.00 |