A taxonomy of problems with fast parallel algorithms
Information and Control
An improved parallel algorithm for maximal matching
Information Processing Letters
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Graphs & digraphs (2nd ed.)
A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Constructing a perfect matching is in random NC
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A random NC algorithm for depth first search
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Data Structures and Algorithms
Data Structures and Algorithms
Optimal parallel algorithms for string matching
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A fast parallel algorithm for the maximal independent set problem
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On simultaneous resource bounds
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Parallel tree contraction and its application
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Improved processor bounds for algebraic and combinatorial problems in RNC
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
A new parallel algorithm for the maximal independent set problem (MIS) is constructed. It runs in O(log4 n) time when implemented on a linear number of EREW-processors. This is the first deterministic algorithm for MIS whose running time is polylogarithmic and whose processor-time product is optimal up to a polylogarithmic factor.