eCommons@Cornell >

Browsing by Author Hartmanis, Juris

Preview	Issue Date	Title	Author(s)
	Sep-1987	The Collapsing Hierarchies	Hartmanis, Juris
	Apr-1986	Complexity Classes Without Machines: On Complete Languages for UP	Hartmanis, Juris; Hemachandra, Lane A.
	Dec-1973	Computational Complexity of Formal Translations	Hartmanis, Juris
	Jan-1968	Computational Complexity of One-Tape Turing Machine Computations	Hartmanis, Juris
	Aug-1970	Computational Complexity of Random Access Stored Program Machines	Hartmanis, Juris
	Mar-1983	Computation Times of NP Sets of Different Densities	Hartmanis, Juris; Yesha, Yaacov
	31-Mar-2010	A Conversation with Juris Hartmanis	Hartmanis, Juris
	May-1980	An Essay About Research on Sparse NP Complete Sets	Hartmanis, Juris; Mahaney, Stephen R.
	Sep-1983	Generalized Kolmogorov Complexity and the Structure of Feasible Computations	Hartmanis, Juris
	Apr-1989	Godel, von Neumann and the P=?NP Problem	Hartmanis, Juris
	May-1984	Independence Results about Context-Free Languages and Lower Bounds	Hartmanis, Juris
	Dec-1976	Independence Results in Computer Science	Hartmanis, Juris; Hopcroft, John E.
	Feb-1980	Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata	Hartmanis, Juris; Mahaney, Stephen R.
	May-1973	The LBA Problem and its Importance in the Theory of Computing	Hartmanis, Juris; Hunt, Harry B., III
	Apr-1988	New Developments in Structural Complexity Theory	Hartmanis, Juris
	Jan-1980	A Note on Natural Creative Sets and Goedel Numberings	Hartmanis, Juris
	Sep-1969	A Note on One-way and Two-way Automata	Hartmanis, Juris
	May-1975	A Note on Tape Bounds for SLA Language Processing	Hartmanis, Juris; Berman, L.
	Jan-1980	Observations About the Development of Theoretical Computer Science	Hartmanis, Juris
	Apr-1980	On Census Complexity and Sparseness of NP Complete Sets	Hartmanis, Juris; Mahaney, Stephen R.