Juris Hartmanis: the beginnings of computational complexity

The author discusses the early period of Hartmanis' research. He examines the origins of the concepts presented in the early papers and the influence of and effects on other research. Some of the important results are considered.<<ETX>>

[1]  Richard M. Karp,et al.  Combinatorics, complexity, and randomness , 1986, CACM.

[2]  Juris Hartmanis.  Observations About the Development of Theoretical Computer Science , 1981 .

[3]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[4]  Richard Edwin Stearns,et al.  A Study of Feedback and Errors in Sequential Machines , 1963, IEEE Trans. Electron. Comput..

[5]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[6]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[7]  Richard Edwin Stearns,et al.  Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.

[8]  Stephen A. Cook,et al.  An overview of computational complexity , 1983, CACM.

[9]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[10]  Richard Edwin Stearns,et al.  Pair Algebra and Its Application to Automata Theory , 1964, Inf. Control..

[11]  Edward J. McCluskey,et al.  Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science , 1968, CACM.

[12]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[13]  M. Rabin.  Degree of difficulty of computing a function and a partial ordering of recursive sets , 1960 .

[14]  Robert W. Ritchie,et al.  CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS , 1963 .

[15]  Hisao Yamada,et al.  Real-Time Computation and Recursive Functions Not Real-Time Computable , 1962, IRE Trans. Electron. Comput..

[16]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[17]  J. Hartmanis,et al.  Algebraic Structure Theory Of Sequential Machines , 1966 .

[18]  Richard Edwin Stearns,et al.  Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[19]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[20]  Stephen Scheinberg,et al.  Note on the Boolean Properties of Context Free Languages , 1960, Inf. Control..

[21]  Richard Edwin Stearns,et al.  Computational complexity of recursive sequences , 1964, SWCT.

[22]  Richard Edwin Stearns,et al.  On the State Assignment Problem for Sequential Machines II , 1961, IRE Trans. Electron. Comput..

[23]  Juris Hartmanis,et al.  On the State Assignment Problem for Sequential Machines. I , 1961, IRE Trans. Electron. Comput..

[24]  Richard Edwin Stearns,et al.  Some Dangers in State Reduction of Sequential Machines , 1962, Inf. Control..

[25]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..