John E. Hopcroft
- J. E. Hopcroft and J. D. Ullman. Decidable and undecidable
questions about automata. Journal of the ACM,
15(2):317-324, April 1968.
References
and Citations.
- John E. Hopcroft and Jeffrey D. Ullman. Relations between time and tape
complexities. Journal of the ACM, 15(3):414-427, July
1968.
References
and Citations.
- J. E. Hopcroft and J. D. Ullman. Some results on tape-bounded
Turing machines. Journal of the ACM, 16(1):168-177,
January 1969.
References,
Citations,
etc.
- Seymour Ginsburg and John Hopcroft. Two-way balloon automata and
AFL. Journal of the ACM, 17(1):3-13, January 1970.
References,
etc.
- J. Hartmanis and J. E. Hopcroft. An overview of the theory of
computational complexity. Journal of the ACM,
18(3):444-475, July 1971.
References,
Citations,
etc.
- John Hopcroft and Robert Tarjan. Efficient planarity testing.
Journal of the ACM, 21(4):549-568, October 1974.
References,
Citations,
etc.
- John Hopcroft, Wolfgang Paul, and Leslie Valiant. On time versus space.
Journal of the ACM, 24(2):332-337, April 1977.
Citations.
Shortcuts: