Juris Hartmanis
Affiliations: | Cornell University, Ithaca, NY, United States |
Google:
"Juris Hartmanis"Parents
Sign in to add mentor| Robert P. Dilworth | grad student | 1955 | Caltech (MathTree) | |
| (Some Embedding Theorems for Lattices) | ||||
Children
Sign in to add trainee| Dexter Kozen | grad student | (MathTree) | |
| Allan B. Borodin | grad student | 1969 | Cornell |
| Clement L. McGowan III | grad student | 1971 | Cornell |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Hartmanis J. (2001) Computational Complexity and Mathematical Proofs Lecture Notes in Computer Science. 251-256 |
| Hartmanis J. (1995) Response to the essay “On computational complexity and the nature of computer science” Acm Computing Surveys. 27: 59-61 |
| Hartmanis J. (1995) On computational complexity and the nature of computer science Acm Computing Surveys. 27: 7-16 |
| Hartmanis J. (1994) Turing Award lecture on computational complexity and the nature of computer science Communications of the Acm. 37: 37-43 |
| Chang R, Chor B, Goldreich O, et al. (1994) The random oracle hypothesis is false Journal of Computer and System Sciences. 49: 24-39 |
| Hartmanis J, Hemachandra LA. (1991) One-way functions and the nonisomorphism of NP-complete sets Theoretical Computer Science. 81: 155-163 |
| Hartmanis J, Hemachandra LA. (1990) Robust machines accept easy sets Theoretical Computer Science. 74: 217-225 |
| Cai J, Gundermann T, Hartmanis J, et al. (1988) The Boolean hierarchy I: structural properties Siam Journal On Computing. 17: 1232-1252 |
| Hartmanis J, Hemachandra LA. (1988) Complexity classes without machines: on complete languages for UP Theoretical Computer Science. 58: 129-142 |
| Hartmanis J, Hemachandra L. (1988) On sparse oracles separating feasible complexity classes Information Processing Letters. 28: 291-295 |