Hartmanis, Juris; Hemachandra, Lane A. One-way functions and the nonisomorphism of NP-complete sets. (English) Zbl 0718.03031 Theor. Comput. Sci. 81, No. 1, 155-163 (1991). MSC: 03D20 03D15 68Q15 PDFBibTeX XMLCite \textit{J. Hartmanis} and \textit{L. A. Hemachandra}, Theor. Comput. Sci. 81, No. 1, 155--163 (1991; Zbl 0718.03031) Full Text: DOI
Ranjan, Desh; Chang, Richard; Hartmanis, Juris Space bounded computations: Review and new separation results. (English) Zbl 0745.68051 Theor. Comput. Sci. 80, No. 2, 289-302 (1991). MSC: 68Q15 PDFBibTeX XMLCite \textit{D. Ranjan} et al., Theor. Comput. Sci. 80, No. 2, 289--302 (1991; Zbl 0745.68051) Full Text: DOI
Hartmanis, Juris; Hemachandra, Lane A. Robust machines accept easy sets. (English) Zbl 0701.68028 Theor. Comput. Sci. 74, No. 2, 217-225 (1990). MSC: 68Q15 68Q05 PDFBibTeX XMLCite \textit{J. Hartmanis} and \textit{L. A. Hemachandra}, Theor. Comput. Sci. 74, No. 2, 217--225 (1990; Zbl 0701.68028) Full Text: DOI
Hartmanis, J. New developments in structural complexity theory. (English) Zbl 0699.68065 Theor. Comput. Sci. 71, No. 1, 79-93 (1990). MSC: 68Q25 03D15 PDFBibTeX XMLCite \textit{J. Hartmanis}, Theor. Comput. Sci. 71, No. 1, 79--93 (1990; Zbl 0699.68065) Full Text: DOI
Hartmanis, Juris; Hemachandra, Lane A. Complexity classes without machines: on complete languages for UP. (English) Zbl 0655.68044 Theor. Comput. Sci. 58, No. 1-3, 129-142 (1988). Reviewer: D.Mundici MSC: 68Q25 03D15 03D05 68Q05 PDFBibTeX XMLCite \textit{J. Hartmanis} and \textit{L. A. Hemachandra}, Theor. Comput. Sci. 58, No. 1--3, 129--142 (1988; Zbl 0655.68044) Full Text: DOI Link
Hartmanis, J.; Yesha, Y. Computation times of NP sets of different densities. (English) Zbl 0985.68515 Theor. Comput. Sci. 34, No. 1-2, 17-32 (1984). MSC: 68Q15 03D15 PDFBibTeX XMLCite \textit{J. Hartmanis} and \textit{Y. Yesha}, Theor. Comput. Sci. 34, 17--32 (1984; Zbl 0985.68515) Full Text: DOI Link
Hartmanis, J. On Goedel speed-up and succinctness of language representations. (English) Zbl 0526.68034 Theor. Comput. Sci. 26, 335-342 (1983). MSC: 68Q65 68Q45 03F99 PDFBibTeX XMLCite \textit{J. Hartmanis}, Theor. Comput. Sci. 26, 335--342 (1983; Zbl 0526.68034) Full Text: DOI
Hartmanis, J. A note on natural complete sets and Goedel numberings. (English) Zbl 0483.03026 Theor. Comput. Sci. 17, 75-89 (1982). MSC: 03D25 PDFBibTeX XMLCite \textit{J. Hartmanis}, Theor. Comput. Sci. 17, 75--89 (1982; Zbl 0483.03026) Full Text: DOI
Hartmanis, Juris Relations between diagonalization, proof systems, and complexity gaps. (English) Zbl 0398.68013 Theor. Comput. Sci. 8, 239-253 (1979). MSC: 68Q25 03D60 68Q65 03D15 03D20 PDFBibTeX XMLCite \textit{J. Hartmanis}, Theor. Comput. Sci. 8, 239--253 (1979; Zbl 0398.68013) Full Text: DOI Link
Hartmanis, J. On log-tape isomorphisms of complete sets. (English) Zbl 0387.68035 Theor. Comput. Sci. 7, 273-286 (1978). MSC: 68Q25 PDFBibTeX XMLCite \textit{J. Hartmanis}, Theor. Comput. Sci. 7, 273--286 (1978; Zbl 0387.68035) Full Text: DOI
Hartmanis, J.; Berman, L. On tape bounds for single letter alphabet language processing. (English) Zbl 0351.68014 Theor. Comput. Sci. 3, 213-224 (1977). MSC: 68Q25 68Q45 PDFBibTeX XMLCite \textit{J. Hartmanis} and \textit{L. Berman}, Theor. Comput. Sci. 3, 213--224 (1977; Zbl 0351.68014) Full Text: DOI