Остановите войну!
for scientists:
default search action
Juris Hartmanis
- > Home > Persons > Juris Hartmanis
Publications
- 2012
- [c46]Juris Hartmanis, Stephen Cook, William Kahan, Richard Edwin Stearns, Andrew C. Yao:
The Turing Computational Model. ACM-TURING 2012: 8:1 - 1998
- [j76]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. Computer 31: 29-38 (1998) - 1994
- [j70]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. 49(1): 24-39 (1994) - [j69]Jin-yi Cai, Juris Hartmanis:
On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line. J. Comput. Syst. Sci. 49(3): 605-619 (1994) - [c40]Juris Hartmanis, Suresh Chari:
On the Intellectual Terrain Around NP. CIAC 1994: 1-11 - 1993
- [p5]Juris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell:
Some Observations about Relativization of Space Bounded Computations. Current Trends in Theoretical Computer Science 1993: 423-434 - [p2]Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi:
On IP = PSPACE and Theorems with Narrow Proofs. Current Trends in Theoretical Computer Science 1993: 484-493 - [p1]Juris Hartmanis, Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi:
Relativization: a Revisionistic Retrospective. Current Trends in Theoretical Computer Science 1993: 537-548 - 1991
- [j66]Desh Ranjan, Richard Chang, Juris Hartmanis:
Space Bounded Computations: Review and New Separation Results. Theor. Comput. Sci. 80(2): 289-302 (1991) - [j65]Juris Hartmanis, Lane A. Hemachandra:
One-Way Functions and the Nonisomorphism of NP-Complete Sets. Theor. Comput. Sci. 81(1): 155-163 (1991) - 1990
- [j64]Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi:
On Unique Staisfiability and Randomized Reductions. Bull. EATCS 41: 166-174 (1990) - [j62]Juris Hartmanis, Lane A. Hemachandra:
Robust Machines Accept Easy Sets. Theor. Comput. Sci. 74(2): 217-225 (1990) - [c36]Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi:
Structural Complexity Theory: recent Surprises. SWAT 1990: 1-12 - 1989
- [j58]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. 18(1): 95-111 (1989) - [c35]Jin-yi Cai, Juris Hartmanis:
The Complexity Of The Real Line Is A Fractal. SCT 1989: 138-146 - [c34]Juris Hartmanis, Desh Ranjan:
Space Bounded Computations: Review And New Separation Results. MFCS 1989: 49-66 - 1988
- [j56]Juris Hartmanis, Lane A. Hemachandra:
On Sparse Oracles Separating Feasible Complexity Classes. Inf. Process. Lett. 28(6): 291-295 (1988) - [j55]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. 17(6): 1232-1252 (1988) - [j54]Juris Hartmanis, Lane A. Hemachandra:
Complexity Classes without Machines: On Complete Languages for UP. Theor. Comput. Sci. 58: 129-142 (1988) - 1987
- [c32]Juris Hartmanis, Lane A. Hemachandra:
One-way functions, robustness, and the non-isomorphism of NP-complete sets. SCT 1987: 160-174 - 1986
- [c30]Juris Hartmanis, Lane A. Hemachandra:
Complexity Classes Without Machines: On Complete Languages for UP. ICALP 1986: 123-135 - [c29]Juris Hartmanis, Ming Li, Yaacov Yesha:
Containment, Separation, Complete Sets, and Immunity of Complexity Classes. ICALP 1986: 136-145 - [c27]Juris Hartmanis, Lane A. Hemachandra:
On Sparse Oracles Separating Feasible Complexity Classes. STACS 1986: 321-333 - 1985
- [j50]Juris Hartmanis, Neil Immerman, Vivian Sewelson:
Sparse Sets in NP-P: EXPTIME versus NEXPTIME. Inf. Control. 65(2/3): 158-181 (1985) - [c26]Juris Hartmanis, Neil Immerman:
On Complete Problems for NP$\cap$CoNP. ICALP 1985: 250-259 - 1984
- [j47]Juris Hartmanis, Yaacov Yesha:
Computation Times of NP Sets of Different Densities. Theor. Comput. Sci. 34: 17-32 (1984) - 1983
- [c24]Juris Hartmanis, Yaacov Yesha:
Computation Times of NP Sets of Different Densities. ICALP 1983: 319-330 - [c23]Juris Hartmanis, Vivian Sewelson, Neil Immerman:
Sparse Sets in NP-P: EXPTIME versus NEXPTIME. STOC 1983: 382-391 - 1981
- [j42]Juris Hartmanis, Stephen R. Mahaney:
Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata. SIAM J. Comput. 10(2): 383-390 (1981) - 1980
- [c22]Juris Hartmanis, Stephen R. Mahaney:
An Eassay about Research on Sparse NP Complete Sets. MFCS 1980: 40-57 - 1978
- [c17]Juris Hartmanis, Neil Immerman, Stephen R. Mahaney:
One-Way Log-Tape Reductions. FOCS 1978: 65-72 - 1976
- [j36]Juris Hartmanis, Janos Simon:
On the Structure of Feasible Computations. Adv. Comput. 14: 1-43 (1976) - 1974
- [c12]Juris Hartmanis, Janos Simon:
On the Power of Multiplication in Random Access Machines. SWAT 1974: 13-23 - [c11]Juris Hartmanis, Janos Simon:
On the Structure of Feasible Computation. GI Jahrestagung 1974: 3-51 - 1970
- [j23]George E. Forsythe, Bernard A. Galler, Juris Hartmanis, Alan J. Perlis, Joseph F. Traub:
Computer science and mathematics. ACM SIGCSE Bull. 2(4): 19-29 (1970) - 1969
- [j21]Juris Hartmanis, Richard Edwin Stearns:
Automata-based computational complexity. Inf. Sci. 1(2): 173-184 (1969) - 1968
- [c6]Patrick C. Fischer, Juris Hartmanis, Manuel Blum:
Tape Reversal Complexity Hierarchies. SWAT 1968: 373-382 - 1965
- [c4]Richard Edwin Stearns, Juris Hartmanis, Philip M. Lewis II:
Hierarchies of memory limited computations. SWCT 1965: 179-190 - [c3]Philip M. Lewis II, Richard Edwin Stearns, Juris Hartmanis:
Memory bounds for recognition of context-free and context-sensitive languages. SWCT 1965: 191-202 - 1964
- [j11]Juris Hartmanis, Richard Edwin Stearns:
Pair Algebra and Its Application to Automata Theory. Inf. Control. 7(4): 485-507 (1964) - [c2]Juris Hartmanis, Richard Edwin Stearns:
Computational complexity of recursive sequences. SWCT 1964: 82-90 - [c1]Richard Edwin Stearns, Juris Hartmanis:
On the application of pair algebra to automata theory. SWCT 1964: 192-196 - 1963
- [j10]Richard Edwin Stearns, Juris Hartmanis:
Regularity Preserving Modifications of Regular Expressions. Inf. Control. 6(1): 55-69 (1963) - [j8]Juris Hartmanis, Richard Edwin Stearns:
A Study of Feedback and Errors in Sequential Machines. IEEE Trans. Electron. Comput. 12(3): 223-232 (1963) - 1962
- [j6]Juris Hartmanis, Richard Edwin Stearns:
Some Dangers in State Reduction of Sequential Machines. Inf. Control. 5(3): 252-260 (1962) - 1961
- [j3]Richard Edwin Stearns, Juris Hartmanis:
On the State Assignment Problem for Sequential Machines II. IRE Trans. Electron. Comput. 10(4): 593-603 (1961)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint