The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
A fast localized algorithm for scheduling sensors
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Parallel approximation algorithms for facility-location problems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Hi-index | 0.00 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...