David S. Johnson
E321047
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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| David S. Johnson canonical | 2 |
| Michael R. Garey | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T3043272 — 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: David S. Johnson Context triple: [Robert Tarjan, doctoralStudent, David S. Johnson]
-
A.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
B.
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.
-
C.
Jeffrey D. Ullman
Jeffrey D. Ullman is a prominent American computer scientist known for his foundational contributions to database theory, algorithms, and formal languages, and for coauthoring several classic textbooks in computer science.
-
D.
Richard Lipton
Richard Lipton is an American computer scientist known for his influential work in theoretical computer science and cryptography, including contributions to complexity theory and algorithm design.
-
E.
Robert Tarjan
Robert Tarjan is an American computer scientist renowned for his pioneering work in algorithms and data structures, including the development of efficient graph algorithms and the union–find data structure.
- 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: David S. Johnson Target entity description: 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.
-
A.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
B.
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.
-
C.
Jeffrey D. Ullman
Jeffrey D. Ullman is a prominent American computer scientist known for his foundational contributions to database theory, algorithms, and formal languages, and for coauthoring several classic textbooks in computer science.
-
D.
Richard Lipton
Richard Lipton is an American computer scientist known for his influential work in theoretical computer science and cryptography, including contributions to complexity theory and algorithm design.
-
E.
Robert Tarjan
Robert Tarjan is an American computer scientist renowned for his pioneering work in algorithms and data structures, including the development of efficient graph algorithms and the union–find data structure.
- F. None of above. chosen
Statements (33)
| Predicate | Object |
|---|---|
| instanceOf |
American
ⓘ
book ⓘ computer scientist ⓘ person ⓘ |
| authorOf | Computers and Intractability: A Guide to the Theory of NP-Completeness ⓘ |
| awardReceived |
ACM Fellow
ⓘ
INFORMS Optimization Society Khachiyan Prize ⓘ Knuth Prize ⓘ
linked to:
Donald E. Knuth Prize
|
| coAuthor |
Michael R. Garey
ⓘ
linked to:
David S. Johnson
|
| countryOfWork | United States of America ⓘ |
| educatedAt |
Massachusetts Institute of Technology
ⓘ
Yale University ⓘ |
| employer |
AT&T Bell Laboratories
ⓘ
linked to:
Bell Telephone Laboratories
AT&T Labs – Research ⓘ Columbia University ⓘ |
| fieldOfWork |
NP-completeness
ⓘ
algorithms ⓘ approximation algorithms ⓘ computational complexity theory ⓘ computer science ⓘ |
| gender | male ⓘ |
| knownFor |
research in algorithms
ⓘ
work on NP-completeness ⓘ work on approximation algorithms ⓘ |
| language | English ⓘ |
| memberOf | Association for Computing Machinery ⓘ |
| nationality | United States of America ⓘ |
| notableWork |
classification of NP-complete problems
ⓘ
contributions to approximation algorithms for combinatorial optimization ⓘ |
| positionHeld | head of Algorithms and Optimization Department at AT&T Labs – Research ⓘ |
| researchArea |
combinatorial optimization
ⓘ
graph algorithms ⓘ scheduling theory ⓘ |
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: David S. Johnson Description of subject: 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.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: David S. Johnson
linked to: David S. Johnson
Computers and Intractability: A Guide to the Theory of NP-Completeness
→
author
→
David S. Johnson
ⓘ
subject linked to:
Garey and Johnson: Computers and Intractability