Journal of the ACM Bibliography
Richard M. Karp and Avi Wigderson. A fast parallel
algorithm for the maximal independent set problem. Journal of the
ACM, 32(4):762-773, October 1985.
[BibTeX entry]
Selected papers that cite this one
- N. Alon and M. Naor. Derandomization,
witnesses for Boolean matrix multiplication and construction of perfect
hash functions. Algorithmica, 16(4/5):434-449,
October/November 1996.
- Baruch Awerbuch, Lenore Cowen, and Mark Smith. Efficient asynchronous
distributed symmetry breaking. In Proceedings of the
Twenty-Sixth Annual ACM Symposium on the Theory of Computing,
pages 214-223, Montréal, Québec, Canada, 23-25 May 1994.
- Bonnie Berger. The fourth moment
method. SIAM Journal on Computing, 26(4):1188-1207,
August 1997.
- Suresh Chari, Pankaj Rohatgi, and Aravind Srinivasan. Improved algorithms via
approximations of probability distributions (extended abstract). In
Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory
of Computing, pages 584-592, Montréal, Québec,
Canada, 23-25 May 1994.
- Lin Chen. Optimal circular arc
representations: Properties, recognition, and construction.
Journal of Computer and System Sciences, 56(3):320-331,
April 1998.
- Zhi-Zhong Chen. A
fast and efficient NC algorithm for maximal matching.
Information Processing Letters, 55(6):303-307, 29 September
1995.
- Z.-Z. Chen and X. He. Parallel
algorithms for maximal acyclic sets. Algorithmica,
19(3):354-368, November 1997.
- Thomas Eiter and Georg Gottlob. Identifying the
minimal transversals of a hypergraph and related problems.
SIAM Journal on Computing, 24(6):1278-1304, December 1995.
- David A. Grable. Nearly-perfect hypergraph
packing is in NC. Information Processing Letters,
60(6):295-299, 23 December 1996.
- Yijie Han. A
fast derandomization scheme and its applications. SIAM Journal
on Computing, 25(1):52-82, February 1996.
- M. V. Marathe, H. B. Hunt III, and S. S. Ravi. The
complexity of approximation PSPACE-complete problems for hierarchical
specifications. Nordic Journal of Computing, 1(3):275-316,
Fall 1994.
- Ji\v{r}í Matou\v{s}ek. Derandomization in
computational geometry. Journal of Algorithms,
20(3):545-580, May 1996.
- Alessandro Panconesi and Aravind Srinivasan. On the complexity
of distributed network decomposition. Journal of
Algorithms, 20(2):356-374, March 1996.
- Avi Wigderson. The amazing power of
pairwise independence. In Proceedings of the Twenty-Sixth
Annual ACM Symposium on the Theory of Computing, pages 645-647,
Montréal, Québec, Canada, 23-25 May 1994.
Shortcuts: