A fast parallel algorithm for the maximal independent set problem
Journal of the ACM (JACM)
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
Efficient parallel algorithms for edge coloring problems
Journal of Algorithms
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Finding euler circuits in logarithmic parallel time
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
On the parallel complexity of computing a maximal independent set in a hypergraph
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast randomized algorithms for distributed edge coloring
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
More deterministic simulation in logspace
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
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved algorithms via approximations of probability distributions (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An extension of the Lovász local lemma, and its applications to integer programming
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Information and Computation
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Scheduling Unrelated Parallel Machines in Parallel
Computational Optimization and Applications
Fast parallel edge colouring of graphs
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |