Abstract
In January, 1988, Alan Selman called and asked me to talk at the 3rd Annual Structures Conference about “Juris Hartmanis: The Middle Years”. Somehow I forgot that a talk in June implies a written paper in March—hence the very preliminary nature of that paper. It is almost two years later and I feel that I am still working on a preliminary version. I also forgot just how much my views about research and about computer science as a discipline were directly inherited from my supervisor. I interpreted the “middle years” to be the years from 1965 (when Juris came to Cornell as Chairman of a newly formed Computer Science Department) until 1978 (when the SIAM monograph [JHa78] appears). Given Juris’ energy and enthusiasm for research, I fully expect that in another twenty years we will be doing this again, by which time the “middle years” will have become part of the “early years”. So I chose a title which I think better suggests the profound impact Juris Hartmanis has had on our discipline. Beyond his seminal and ongoing contributions to the field of complexity, Hartmanis was able to use his research reputation not only to develop a department but, moreover, to strongly influence the direction of computer science as a distinct discipline.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Borodin. On relating time and space to size and depth. SIAM J. COMPUT., 6 (4): 733–744, December 1977.
A. Bertoni, G. Mauri, and N. Sabadini. A characterization of the class of functions computable in polynomial time on random access machines. In Proc. 13th Annual ACM Symposium on Theory of computing, pages 168–176, May 1981.
A. Meyer and M. Fischer. Economy of description by automata, grammars and formal systems. In Conference Record, IEEE 12th Annual Symposium on Switching and Automata Theory, pages 188–190, 1971.
E. Schmidt and T. Szymanski. Succinctness of descriptions of unambiguous context-free languages. SIAM J. Comput., 6: 547–553, 1977.
J. Hartmanis and H. Shank. On the recognition of primes by automata. JACM, 15 (3): 382–389, July 1968.
J. Hartmanis and H. Shank. Two memory bounds for the recognition of primes by automata. Mathematical Systems Theory, 3 (2): 125–129, 1969.
J. Hartmanis. Tape reversal bounded turing machine computations. JCSS, 2 (2): 117–135, August 1968.
J. Hartmanis. Feasible computations and provable complexity properties. 1978. CBMS—NSF Regional Conf. Series in Applied Mathematics 30, SIAM Monograph, 62 pages.
J. Hartmanis. On the succinctness of different representations of languages. SIAM. J. Comput., 9 (1): 114–120, February 1980.
J. Hartmanis. Observations about the development of theoretical computer science. Annals of the History of Computing, 3 (1): 42–51, 1981.
J. Hartmanis and J. Hopcroft. What makes some language theory problems undecidable. JCSS, 4 (4): 368–376, August 1970.
J. Hartmanis and J. Hopcroft. An overview of the theory of computational complexity. J. Assoc. Comput. Mach., 18: 444–475, 1971.
J. Hartmanis and J. Simon. On the power of multiplication on random access machines. In Proc. IEEE 15th Symp. on Switch-ing and Automata Theory, pages 13–23, October 1974.
J. Simon. Division is good. In 20th Annual Symposium on Foundations of Computer Science, pages 411–420, October 1979.
K. Godel. Uber die lange von beweisen. Ergebnisse eines mathematischen Kolloquiuns, 7: 23–24, 1936.
L. Goldschlager. Synchronous parallel computation. Assoc. Comput. Mach., 29 (4): 1073–1086, 1982.
L. Adleman and K. Kompella. Using smoothness to achieve parallelism (abstract). In Proc. 20th Annual ACM Symposium on Theory of Computing, pages 528–538, May 1988.
M. Blum. A machine-independent theory of the complexity of recursive functions. J. Assoc. Comput. Mach., 14: 322–336, 1967.
M. Blum. On the size of machines. Information and Control, 11: 257–265, 1967.
N. Pippenger. On simultaneous resource bounds (preliminary version). In Proc. 20th IEEE Found, of Comput. Sci., pages 307–311, 1979.
P. Fischer. Theory of provable recursive functions. Trans. Amer. Math. Soc., 117: 494–520, 1965.
P. Fischer, J. Hartmanis, and M. Blum. Tape reversal complexity hierarchies. In IEEE Conference Record of the 1968 Ninth Annual Symposium on Switching and Automata Theory, pages 373–382, October 1968.
P. Young. Juris Hartmanis: fundamental contributions to isomorphism problems. In A. Selman, editor Complexity Theory Retrospective, pages 28–58, Springer-Verlag, 1990.
P. Young. Optimization among provably equivalent programs. J. Assoc. Comput. Math., 24: 693–700, 1977.
R. Stearns. Juris Hartmanis: the beginnings of computational complexity. In A. Selman, editor Complexity Theory Retrospective, pages 5–18, Springer-Verlag, 1990.
S. Cook. The complexity of theorem proving procedures. In Proc. 3rd Annual ACM Symposium on Theory of Computing, pages 151–158, May 1971.
T. Baker and J. Hartmanis. Succinctness, verifiability and determinism in representations of polynomial-time languages. In Proc. 20th IEEE Found, of Comput. Sci., pages 392–396, 1979.
T. Baker, J. Gill, and R. Solovay. Relativizations on the P =?NP question. SIAM J. Comput., 431–442, 1975.
V. Pratt and L. Stockmeyer. A characterization of the power of vector machines. J. Comput. System Sci., 12: 198–221, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Borodin, A. (1990). Juris Hartmanis: Building a Department—Building a Discipline. In: Selman, A.L. (eds) Complexity Theory Retrospective. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4478-3_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4478-3_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8793-3
Online ISBN: 978-1-4612-4478-3
eBook Packages: Springer Book Archive