A fast parallel algorithm for the maximal independent set problem
Journal of the ACM (JACM)
Computational geometry: an introduction
Computational geometry: an introduction
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
Balancing vectors in the max norm
Combinatorica
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
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
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
Approximations of general independent distributions
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A parallel approximation algorithm for positive linear programming
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Chernoff-Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximation alogorithms for the maximum acyclic subgraph problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Approximating hyper-rectangles: learning and pseudo-random sets
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |