| 2012 | CiE | Turing Machine-Inspired Computer Science Results. | Juris Hartmanis |
| 1999 | ICALP | Observations about the Nature and State of Computer Science (Keynote Address). | Juris Hartmanis |
| 1995 | MFCS | On the Computing Paradigm and Computational Complexity. | Juris Hartmanis |
| 1994 | CIAC | On the Intellectual Terrain Around NP. | Juris Hartmanis, Suresh Chari |
| 1989 | MFCS | Space Bounded Computations: Review And New Separation Results. | Juris Hartmanis, Desh Ranjan |
| 1988 | ICALP | New Developments in Structural Complexity Theory. | Juris Hartmanis |
| 1987 | FCT | Some Observations of NP Complete Sets. | Juris Hartmanis |
| 1986 | ICALP | Complexity Classes Without Machines: On Complete Languages for UP. | Juris Hartmanis, Lane A. Hemachandra |
| 1986 | ICALP | Containment, Separation, Complete Sets, and Immunity of Complexity Classes. | Juris Hartmanis, Ming Li, Yaacov Yesha |
| 1986 | STACS | On Sparse Oracles Separating Feasible Complexity Classes. | Juris Hartmanis, Lane A. Hemachandra |
| 1985 | ICALP | On Complete Problems for NP$\cap$CoNP. | Juris Hartmanis, Neil Immerman |
| 1983 | FOCS | Generalized Kolmogorov Complexity and the Structure of Feasible Computations (Preliminary Report) | Juris Hartmanis |
| 1983 | ICALP | Computation Times of NP Sets of Different Densities. | Juris Hartmanis, Yaacov Yesha |
| 1983 | STOC | Sparse Sets in NP-P: EXPTIME versus NEXPTIME | Juris Hartmanis, Vivian Sewelson, Neil Immerman |
| 1980 | MFCS | An Eassay about Research on Sparse NP Complete Sets. | Juris Hartmanis, Stephen R. Mahaney |
| 1979 | FOCS | Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages | Theodore P. Baker, Juris Hartmanis |
| 1979 | FOCS | Observations about the Development of Theoretical Computer Science | Juris Hartmanis |
| 1979 | ICALP | On the Succintness of Different Representations of Languages. | Juris Hartmanis |
| 1979 | MFCS | Relative Succinctness of Representations of Languages and Separation of Complexity Classes. | Juris Hartmanis, Theodore P. Baker |
| 1978 | FOCS | One-Way Log-Tape Reductions | Juris Hartmanis, Neil Immerman, Stephen R. Mahaney |
| 1977 | STOC | Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version) | Juris Hartmanis |
| 1976 | STOC | On Isomorphisms and Density of NP and Other Complete Sets | Juris Hartmanis, Leonard Berman |
| 1975 | FOCS | A Note on Tape Bounds for SLA Language Processing | Juris Hartmanis, Leonard Berman |
| 1974 | FOCS | On the Power of Multiplication in Random Access Machines | Juris Hartmanis, Janos Simon |
| 1974 | GI | On the Structure of Feasible Computation. | Juris Hartmanis, Janos Simon |
| 1974 | ICALP | On Simple Goedel Numberings and Translations. | Juris Hartmanis, Theodore P. Baker |
| 1973 | MFCS | On the Problem of Finding Natural Computational Complexity Measures. | Juris Hartmanis |
| 1971 | STOC | Complexity of Formal Translations and Speed-Up Results | Robert L. Constable, Juris Hartmanis |
| 1968 | FOCS | Tape Reversal Complexity Hierarchies | Patrick C. Fischer, Juris Hartmanis, Manuel Blum |
| 1968 | FOCS | Structure of Undecidable Problems in Automata Theory | Juris Hartmanis, John E. Hopcroft |
| 1967 | FOCS | On the Complexity of Undecidable Problems in Automata Theory | Juris Hartmanis |
| 1965 | FOCS | Memory bounds for recognition of context-free and context-sensitive languages | Philip M. Lewis II, Richard Edwin Stearns, Juris Hartmanis |
| 1965 | FOCS | Hierarchies of memory limited computations | Richard Edwin Stearns, Juris Hartmanis, Philip M. Lewis II |
| 1964 | FOCS | Computational complexity of recursive sequences | Juris Hartmanis, Richard Edwin Stearns |
| 1964 | FOCS | On the application of pair algebra to automata theory | Richard Edwin Stearns, Juris Hartmanis |