A taxonomy of problems with fast parallel algorithms
Information and Control
N-processors graphs distributively achieve perfect matchings in O(log2N) beats
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
The following three problems concerning random graphs can be solved in (log n)O(1) expected time using linearly many processors: (1) finding the lexicographically first maximal independent set, (2) coloring the vertices using a number of colors that is almost surely within twice the chromatic number, and (3) finding a Hamiltonian circuit.