| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Juris Hartmanis |
Separation of complexity classes.  |
J. ACM  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
The Separation Problems and Descriptional Complexity. |
DCFS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis |
Computational Complexity and Mathematical Proofs. |
Informatics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Undecidability and Incompleteness Results in Automata Theory. |
A Half-Century of Automata Theory |
2000 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis |
Observations about the Nature and State of Computer Science (Keynote Address). |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | David D. Clark, Edward A. Feigenbaum, Donald P. Greenberg, Juris Hartmanis, Robert W. Lucky, Robert Metcalfe, Raj Reddy, Mary Shaw, William A. Wulf |
Innovation and Obstacles: The Future of Computing. |
IEEE Computer |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On the Weight of Computations. |
Bulletin of the EATCS |
1995 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis |
Turing Award Lecture: On Computational Complexity and the Nature of Computer Science. |
ACM Comput. Surv. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Response to the Essays "On Computational Complexity and the Nature of Computer Science". |
ACM Comput. Surv. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On the Computing Paradigm and Computational Complexity. |
MFCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Turing Award Lecture: On Computational Complexity and the Nature of Computer Science. |
Commun. ACM |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
About the Nature of the Computer Science. |
Bulletin of the EATCS |
1994 |
DBLP BibTeX RDF |
|
| 1 | Jin-yi Cai, Juris Hartmanis |
On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line. |
J. Comput. Syst. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi |
The Random Oracle Hypothesis Is False. |
J. Comput. Syst. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
The Structure of the Complexity of Computations: A Guided Tour Through Complexity Classes. |
IFIP Congress |
1994 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis, Suresh Chari |
On the Intellectual Terrain Around NP. |
CIAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
A Broader Research Agenda for Theory. |
Bulletin of the EATCS |
1993 |
DBLP BibTeX RDF |
|
| 1 | Herbert S. Lin, Juris Hartmanis, John R. Rice, Morton Lowengrub |
Computing the Future: Whither Computer Science and Engineering? |
ACM Conference on Computer Science |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Some Observations About the Nature of Computer Science. |
FSTTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Computing the Future - Comittee to Assess the Scope and Direction of Computer Science and Technology of the National Research Council. |
Commun. ACM |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Lane A. Hemachandra |
One-Way Functions and the Nonisomorphism of NP-Complete Sets. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Desh Ranjan, Richard Chang, Juris Hartmanis |
Space Bounded Computations: Review and New Separation Results. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Lane A. Hemachandra |
Robust Machines Accept Easy Sets. |
Theor. Comput. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
New Developments in Structural Complexity Theory. |
Theor. Comput. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi |
On Unique Staisfiability and Randomized Reductions. |
Bulletin of the EATCS |
1990 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi |
Structural Complexity Theory: recent Surprises. |
SWAT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ted Eisenberg, David Gries, Juris Hartmanis, Don Holcomb, M. Stuart Lynn, Thomas Santoro |
The Cornell Commission: On Morris and the Worm. |
Commun. ACM |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
The Structural Complexity Column. |
Bulletin of the EATCS |
1989 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis |
The Structural Complexity Column. |
Bulletin of the EATCS |
1989 |
DBLP BibTeX RDF |
|
| 1 | Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung |
The Boolean Hierarchy II: Applications. |
SIAM J. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Desh Ranjan |
Space Bounded Computations: Review And New Separation Results. |
MFCS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-yi Cai, Juris Hartmanis |
The Complexity Of The Real Line Is A Fractal. |
Structure in Complexity Theory Conference |
1989 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis, Lane A. Hemachandra |
On Sparse Oracles Separating Feasible Complexity Classes. |
Inf. Process. Lett. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Lane A. Hemachandra |
Complexity Classes without Machines: On Complete Languages for UP. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
The Structural Complexity Column. |
Bulletin of the EATCS |
1988 |
DBLP BibTeX RDF |
|
| 1 | Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung |
The Boolean Hierarchy I: Structural Properties. |
SIAM J. Comput. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
New Developments in Structural Complexity Theory. |
ICALP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
The Structural Complexity Column. |
Bulletin of the EATCS |
1987 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis |
Structural Complexity Columns in Sparse complete sets for NP and the optimal collpase of the polynomial hierarchy. |
Bulletin of the EATCS |
1987 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis |
Some Observations of NP Complete Sets. |
FCT |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Lane A. Hemachandra |
Complexity Classes Without Machines: On Complete Languages for UP. |
ICALP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Ming Li, Yaacov Yesha |
Containment, Separation, Complete Sets, and Immunity of Complexity Classes. |
ICALP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Lane A. Hemachandra |
On Sparse Oracles Separating Feasible Complexity Classes. |
STACS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Pragmatic Aspects of Complexity Theory (Panel). |
IFIP Congress |
1986 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis (eds.) |
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, May 28-30, 1986, Berkeley, California, USA |
STOC |
1986 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis |
Independence Results About Context-Free Languages and Lower Bounds. |
Inf. Process. Lett. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Neil Immerman, Vivian Sewelson |
Sparse Sets in NP-P: EXPTIME versus NEXPTIME |
Information and Control |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Solvable problems with conflicting relativizations. |
Bulletin of the EATCS |
1985 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis, Neil Immerman |
On Complete Problems for NP$\cap$CoNP. |
ICALP |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Yaacov Yesha |
Computation Times of NP Sets of Different Densities. |
Theor. Comput. Sci. |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On non-isomorphic NP complete sets. |
Bulletin of the EATCS |
1984 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis |
On Sparse Sets in NP - P. |
Inf. Process. Lett. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On Gödel Speed-Up and Succinctness of Language Representations. |
Theor. Comput. Sci. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Yaacov Yesha |
Computation Times of NP Sets of Different Densities. |
ICALP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Generalized Kolmogorov Complexity and the Structure of Feasible Computations (Preliminary Report) |
FOCS |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Vivian Sewelson, Neil Immerman |
Sparse Sets in NP-P: EXPTIME versus NEXPTIME |
STOC |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
A Note on Natural Complete Sets and Gödel Numberings. |
Theor. Comput. Sci. |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Stephen R. Mahaney |
Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata. |
SIAM J. Comput. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On the Succinctness of Different Representations of Languages. |
SIAM J. Comput. |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Stephen R. Mahaney |
An Eassay about Research on Sparse NP Complete Sets. |
MFCS |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Relations Between Diagonalization, Proof Systems, and Complexity Gaps. |
Theor. Comput. Sci. |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On the Succintness of Different Representations of Languages. |
ICALP |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Theodore P. Baker |
Relative Succinctness of Representations of Languages and Separation of Complexity Classes. |
MFCS |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Theodore P. Baker, Juris Hartmanis |
Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages |
FOCS |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Observations about the Development of Theoretical Computer Science |
FOCS |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On Log-Tape Isomorphisms of Complete Sets. |
Theor. Comput. Sci. |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Leonard Berman |
On Polynomial Time Isomorphisms of Some New Complete Sets. |
J. Comput. Syst. Sci. |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Neil Immerman, Stephen R. Mahaney |
One-Way Log-Tape Reductions |
FOCS |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonard Berman, Juris Hartmanis |
On Isomorphisms and Density of NP and Other Complete Sets. |
SIAM J. Comput. |
1977 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonard Berman, Juris Hartmanis |
On polynomial time isomorphisms of complete sets. |
Theoretical Computer Science |
1977 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version) |
STOC |
1977 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Leonard Berman |
On Tape Bounds for Single Letter Alphabet Language Processing. |
Theor. Comput. Sci. |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On Effective Speed-Up and Long Proofs of Trivial Theorems in Formal Theories. |
ITA |
1976 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis, Janos Simon |
On the Structure of Feasible Computations. |
Advances in Computers |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Leonard Berman |
On Isomorphisms and Density of NP and Other Complete Sets |
STOC |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Computational Complexity of Formal Translations. |
Mathematical Systems Theory |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Theodore P. Baker |
On Simple Gödel Numberings and Translations. |
SIAM J. Comput. |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Leonard Berman |
A Note on Tape Bounds for SLA Language Processing |
FOCS |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Theodore P. Baker |
On Simple Goedel Numberings and Translations. |
ICALP |
1974 |
DBLP DOI BibTeX RDF |
Goedel numberings, complexity of translations, optimal Goedel numberings, translations |
| 1 | Juris Hartmanis, Janos Simon |
On the Structure of Feasible Computation. |
GI Jahrestagung |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Janos Simon |
On the Power of Multiplication in Random Access Machines |
SWAT (FOCS) |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, H. Walter |
Group Theoretic Characterization of Linear Permutation Automata. |
J. Comput. Syst. Sci. |
1973 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On the Problem of Finding Natural Computational Complexity Measures. |
MFCS |
1973 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis |
On Non-Determinancy in Simple Computing Devices. |
Acta Inf. |
1972 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, John E. Hopcroft |
An Overview of the Theory of Computational Complexity. |
J. ACM |
1971 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Computational Complexity of Random Acess Stored Program Machines. |
Mathematical Systems Theory |
1971 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Forbes D. Lewis |
The use of Lists in the Study of Undecidable Problems in Automata Theory. |
J. Comput. Syst. Sci. |
1971 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert L. Constable, Juris Hartmanis |
Complexity of Formal Translations and Speed-Up Results |
STOC |
1971 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
A Note on One-Way and Two-Way Automata. |
Mathematical Systems Theory |
1970 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, John E. Hopcroft |
What makes Some Language Theory Problems Undecidable. |
J. Comput. Syst. Sci. |
1970 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On the Complexity of Undecidable Problems in Automata Theory. |
J. ACM |
1969 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, H. Shank |
Two Memory Bounds for the Recognition of Primes by Automata. |
Mathematical Systems Theory |
1969 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Computational Complexity of One-Tape Turing Machine Computations. |
J. ACM |
1968 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, H. Shank |
On the Recognition of Primes by Automata. |
J. ACM |
1968 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
Tape-Reversal Bounded Turing Machine Computations. |
J. Comput. Syst. Sci. |
1968 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick C. Fischer, Juris Hartmanis, Manuel Blum |
Tape Reversal Complexity Hierarchies |
SWAT (FOCS) |
1968 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, John E. Hopcroft |
Structure of Undecidable Problems in Automata Theory |
SWAT (FOCS) |
1968 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On Memory Requirements for Context-Free Language Recognition. |
J. ACM |
1967 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Wayne A. Davis |
Homomorphic Images of Linear Sequential Machines. |
J. Comput. Syst. Sci. |
1967 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis |
On the Complexity of Undecidable Problems in Automata Theory |
SWAT (FOCS) |
1967 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")