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
Michael R. Garey 2
David S. Johnson canonical 1

How this entity was disambiguated

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
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
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 Michael R. Garey
linked to: David S. Johnson
David S. Johnson coAuthor Michael R. Garey
linked to: David S. Johnson