Sample spaces uniform on neighborhoods
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Existence and construction of edge disjoint paths on expander graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Random Structures & Algorithms
Embedding metric spaces in their intrinsic dimension
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the forty-third annual ACM symposium on Theory of computing
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
| Hi-index | 0.00 |
The Lovasz local lemma (1975) is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results without supplying any efficient way of solving the corresponding algorithmic problems. J. Beck has recently found a method for converting some of these existence proofs into efficient algorithmic procedures, at the cost of losing a little in the estimates, but his method does not seem to be parallelizable. His technique is modified to achieve an algorithmic version that can be parallelized, thus providing deterministic NC/sup 1/ algorithms for various interesting algorithmic search problems.