Journal of the ACM Bibliography
John Hopcroft, Wolfgang Paul, and Leslie Valiant. On time versus
space. Journal of the ACM, 24(2):332-337, April 1977.
[BibTeX entry]
Selected papers that cite this one
- Hans L. Bodlaender. A partial
k-arboretum of graphs with bounded treewidth.
Theoretical Computer Science, 209(1-2):1-45, 6 December
1998. Tutorial.
- Etienne Grandjean. Linear time
algorithms and NP-complete problems. SIAM Journal on
Computing, 23(3):573-597, June 1994.
- S. Gupta. Alternating time versus
deterministic time: A separation. Mathematical Systems
Theory, 29(6):661-672, November/December 1996.
- Thomas Lengauer and Robert E. Tarjan. Asymptotically tight bounds on
time-space trade-offs in a pebble game. Journal of the
ACM, 29(4):1087-1130, October 1982.
- Louis Mak. Parallelism always
helps. SIAM Journal on Computing, 26(1):153-172,
January 1997.
- Ian Parberry. A guide for
new referees in theoretical computer science. Information and
Computation, 112(1):96-116, July 1994.
Shortcuts: