Travelled to:1 × Austria
1 × Czech Republic
1 × Finland
1 × France
1 × Greece
1 × Spain
4 × USA
Collaborated with:∅ Y.Yesha N.Immerman L.A.Hemachandra L.Berman T.P.Baker R.L.Constable M.Li V.Sewelson
Talks about:complex (5) complet (4) set (4) translat (2) languag (2) densiti (2) differ (2) comput (2) class (2) up (2)
Person: Juris Hartmanis
DBLP: Hartmanis:Juris
Facilitated 1 volumes:
EdContributed to:
19991988198619851983198319791977197619741971Wrote 12 papers:
- ICALP-1999-Hartmanis
- Observations about the Nature and State of Computer Science (JH), p. 105.
- ICALP-1988-Hartmanis #complexity
- New Developments in Structural Complexity Theory (JH), pp. 271–286.
- ICALP-1986-HartmanisH #complexity
- Complexity Classes Without Machines: On Complete Languages for UP (JH, LAH), pp. 123–135.
- ICALP-1986-HartmanisLY #complexity #set
- Containment, Separation, Complete Sets, and Immunity of Complexity Classes (JH, ML, YY), pp. 136–145.
- ICALP-1985-HartmanisI #on the #problem
- On Complete Problems for NP∩CoNP (JH, NI), pp. 250–259.
- ICALP-1983-HartmanisHY #set
- Computation Times of NP Sets of Different Densities (JH, YY), pp. 319–330.
- STOC-1983-HartmanisSI #set
- Sparse Sets in NP-P: EXPTIME versus NEXPTIME (JH, VS, NI), pp. 382–391.
- ICALP-1979-Hartmanis #on the
- On the Succintness of Different Representations of Languages (JH), pp. 282–288.
- STOC-1977-Hartmanis #complexity #proving
- Relations Between Diagonalization, Proof Systems, and Complexity Gaps (JH), pp. 223–227.
- STOC-1976-HartmanisB #morphism #on the #set
- On Isomorphisms and Density of NP and Other Complete Sets (JH, LB), pp. 30–40.
- ICALP-1974-HartmanisB #on the
- On Simple Goedel Numberings and Translations (JH, TPB), pp. 301–316.
- STOC-1971-ConstableH #complexity
- Complexity of Formal Translations and Speed-Up Results (RLC, JH), pp. 244–250.