Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:person
|
| gptkbp:almaMater |
gptkb:Princeton_University
|
| gptkbp:awardReceived |
gptkb:Knuth_Prize
National Academy of Sciences membership Turing Award |
| gptkbp:birthDate |
1936-07-05
|
| gptkbp:birthPlace |
gptkb:Paterson,_New_Jersey,_United_States
|
| gptkbp:coauthor |
gptkb:Jurisd_Hartmanis
|
| gptkbp:doctoralAdvisor |
gptkb:Harold_W._Kuhn
|
| gptkbp:employer |
gptkb:University_at_Albany,_SUNY
|
| gptkbp:fieldOfWork |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Richard E. Stearns
|
| gptkbp:knownFor |
gptkb:complexity_theory
automata theory |
| gptkbp:nationality |
gptkb:American
|
| gptkbp:notableWork |
On the Computational Complexity of Algorithms
|
| gptkbp:occupation |
gptkb:computer_scientist
|
| gptkbp:bfsParent |
gptkb:Juris_Hartmanis
gptkb:Generalized_Rush_Hour |
| gptkbp:bfsLayer |
6
|