David S. Johnson

E321047

American book computer scientist person

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.

Try in SPARQL Jump to: Surface forms Disambiguation Statements Elicitation Referenced by

All labels observed (2)

Label	Occurrences
Michael R. Garey	2
David S. Johnson canonical	1

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	Garey and Johnson: Computers and Intractability ⓘ surface form: Computers and Intractability: A Guide to the Theory of NP-Completeness
awardReceived	Fellow of the Association for Computing Machinery ⓘ surface form: ACM Fellow INFORMS Optimization Society Khachiyan Prize ⓘ Donald E. Knuth Prize ⓘ surface form: Knuth Prize
coAuthor	David S. Johnson self-linksurface differs ⓘ surface form: Michael R. Garey
countryOfWork	United States of America ⓘ
educatedAt	Massachusetts Institute of Technology ⓘ Yale University ⓘ
employer	Bell Telephone Laboratories ⓘ surface form: AT&T Bell 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

Referenced by (3)

Full triples — surface form annotated when it differs from this entity's canonical label.

Robert Tarjan → doctoralStudent → David S. Johnson ⓘ

ACM SIGACT Distinguished Service Prize → notableRecipient → David S. Johnson ⓘ

this entity surface form: Michael R. Garey

David S. Johnson → coAuthor → David S. Johnson self-linksurface differs ⓘ