Journal of the ACM Bibliography
S.
Even and R. E.
Tarjan. A combinatorial problem which is complete in polynomial
space. Journal of the ACM, 23(4):710-719, October 1976.
[BibTeX entry]
Selected papers that cite this one
- Anne Condon, Joan Feinberg, Carsten Lund, and Peter Shor. Random debaters
and the hardness of approximating stochastic functions. SIAM
Journal on Computing, 26(2):369-400, April 1997.
- Daphne Koller, Nimrod Megiddo, and Bernhard von Stengel. Fast algorithms for
finding randomized strategies in game trees. In Proceedings of
the Twenty-Sixth Annual ACM Symposium on the Theory of Computing,
pages 750-759, Montréal, Québec, Canada, 23-25 May 1994.
- Toshimi Minoura. Deadlock avoidance revisited.
Journal of the ACM, 29(4):1023-1048, October 1982.
- Akio Yanbe and Kouichi Sakurai. A short certificate of the
number of universal optimal strategies for stopping simple stochastic
games. Information Processing Letters, 57(1):17-24, 15
January 1996.
Shortcuts: