|
gptkbp:instanceOf
|
gptkb:person
|
|
gptkbp:awardReceived
|
gptkb:Guggenheim_Fellowship
Turing Award
|
|
gptkbp:birthDate
|
1928-07-05
|
|
gptkbp:birthPlace
|
gptkb:Riga,_Latvia
|
|
gptkbp:coauthor
|
gptkb:Richard_E._Stearns
|
|
gptkbp:deathDate
|
2022-07-29
|
|
gptkbp:doctoralAdvisor
|
gptkb:Robert_P._Dilworth
|
|
gptkbp:educatedAt
|
gptkb:California_Institute_of_Technology
gptkb:University_of_Kansas
|
|
gptkbp:field
|
theoretical computer science
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Jurisd Hartmanis
|
|
gptkbp:knownFor
|
gptkb:complexity_theory
gptkb:Hartmanis–Stearns_conjecture
|
|
gptkbp:memberOf
|
gptkb:American_Academy_of_Arts_and_Sciences
gptkb:National_Academy_of_Engineering
|
|
gptkbp:nationality
|
gptkb:American
gptkb:Latvian
|
|
gptkbp:notableStudent
|
gptkb:David_S._Johnson
gptkb:Dexter_Kozen
|
|
gptkbp:notableWork
|
On the computational complexity of algorithms
|
|
gptkbp:occupation
|
gptkb:computer_scientist
|
|
gptkbp:TuringAwardYear
|
1993
founding work in computational complexity theory
|
|
gptkbp:workInstitution
|
gptkb:Cornell_University
|
|
gptkbp:bfsParent
|
gptkb:Complexity_theory
|
|
gptkbp:bfsLayer
|
6
|