John E. Hopcroft
E568994
John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
All labels observed (2)
| Label | Occurrences |
|---|---|
| John E. Hopcroft canonical | 4 |
| John Hopcroft | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T6082261 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: John E. Hopcroft Context triple: [Jeffrey D. Ullman, coauthor, John E. Hopcroft]
-
A.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
-
B.
David S. Johnson
David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
-
C.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
D.
Alfred V. Aho
Alfred V. Aho is a Canadian computer scientist renowned for his foundational contributions to algorithms, programming languages, and compiler design, and as a co-creator of the AWK programming language.
-
E.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: John E. Hopcroft Target entity description: John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
-
A.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
-
B.
David S. Johnson
David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
-
C.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
D.
Alfred V. Aho
Alfred V. Aho is a Canadian computer scientist renowned for his foundational contributions to algorithms, programming languages, and compiler design, and as a co-creator of the AWK programming language.
-
E.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
American computer scientist
ⓘ
human ⓘ |
| academicDegree |
Bachelor of Science in electrical engineering
ⓘ
Master of Science in electrical engineering ⓘ PhD in electrical engineering ⓘ |
| awardReceived |
ACM Fellow
NERFINISHED
ⓘ
ACM Karl V. Karlstrom Outstanding Educator Award NERFINISHED ⓘ IEEE John von Neumann Medal NERFINISHED ⓘ Knuth Prize NERFINISHED ⓘ National Medal of Science ⓘ SIAM Fellow NERFINISHED ⓘ Shaw Prize in Mathematical Sciences NERFINISHED ⓘ Tsinghua University Honorary Professorship NERFINISHED ⓘ Turing Award ⓘ |
| birthName | John Edward Hopcroft NERFINISHED ⓘ |
| coauthorOf | Introduction to Automata Theory, Languages, and Computation NERFINISHED ⓘ |
| coauthorWith |
Jeffrey D. Ullman
NERFINISHED
ⓘ
Rajeev Motwani NERFINISHED ⓘ |
| countryOfCitizenship | United States of America ⓘ |
| dateOfBirth | 1939-10-07 ⓘ |
| doctoralAdvisor | George Forsythe NERFINISHED ⓘ |
| educatedAt |
Seattle University
NERFINISHED
ⓘ
Stanford University ⓘ |
| employer |
Cornell University
ⓘ
Princeton University ⓘ Yale University ⓘ |
| familyName | Hopcroft NERFINISHED ⓘ |
| fieldOfWork |
algorithms
ⓘ
automata theory ⓘ computer science ⓘ data structures ⓘ graph algorithms ⓘ theoretical computer science ⓘ |
| givenName | John NERFINISHED ⓘ |
| knownFor |
Hopcroft–Karp algorithm
NERFINISHED
ⓘ
Hopcroft–Tarjan planarity algorithm NERFINISHED ⓘ foundational work in algorithm design and analysis ⓘ foundational work in automata theory ⓘ |
| languageSpoken | English ⓘ |
| memberOf |
American Academy of Arts and Sciences
ⓘ
Association for Computing Machinery NERFINISHED ⓘ National Academy of Engineering ⓘ National Academy of Sciences ⓘ |
| notableStudent |
Richard Karp
NERFINISHED
ⓘ
Robert Tarjan NERFINISHED ⓘ |
| notableWork | Introduction to Automata Theory, Languages, and Computation NERFINISHED ⓘ |
| placeOfBirth | Seattle, Washington, United States NERFINISHED ⓘ |
| positionHeld |
Dean of the College of Engineering at Cornell University
ⓘ
IBM Professor of Engineering and Applied Mathematics at Cornell University ⓘ |
| workLocation | Ithaca, New York, United States NERFINISHED ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: John E. Hopcroft Description of subject: John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
Referenced by (6)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
John Hopcroft
subject surface form:
Introduction to Automata Theory, Languages, and Computation
subject surface form:
Introduction to Automata Theory, Languages, and Computation
this entity surface form:
John Hopcroft