Christos H. Papadimitriou
E377214
Christos H. Papadimitriou is a prominent computer scientist renowned for his foundational contributions to computational complexity theory, algorithms, and game theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Christos H. Papadimitriou canonical | 3 |
How this entity was disambiguated
This entity first appeared as the object of triple T3665772 — 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: Christos H. Papadimitriou Context triple: [ACM SIGMETRICS Achievement Award, notableRecipient, Christos H. Papadimitriou]
-
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.
Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
-
C.
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.
-
D.
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.
-
E.
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.
- 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: Christos H. Papadimitriou Target entity description: Christos H. Papadimitriou is a prominent computer scientist renowned for his foundational contributions to computational complexity theory, algorithms, and game theory.
-
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.
Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
-
C.
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.
-
D.
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.
-
E.
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.
- F. None of above. chosen
Statements (66)
| Predicate | Object |
|---|---|
| instanceOf |
academic
ⓘ
author ⓘ computer scientist ⓘ theoretical computer scientist ⓘ |
| awardReceived |
ACM SIGACT Distinguished Service Prize
ⓘ
EATCS Award ⓘ Gödel Prize ⓘ IEEE John von Neumann Medal ⓘ Donald E. Knuth Prize ⓘ
surface form:
Knuth Prize
|
| citizenship |
Greece
ⓘ
United States of America ⓘ |
| coAuthor |
Christos Faloutsos
ⓘ
Elias Koutsoupias ⓘ Kenneth Steiglitz ⓘ Mihalis Yannakakis ⓘ Sanjeev Arora ⓘ Sanjoy Dasgupta ⓘ Umesh Vazirani ⓘ |
| degree |
Diploma in Electrical and Mechanical Engineering
ⓘ
PhD in Electrical Engineering and Computer Science ⓘ |
| doctoralAdvisor |
John E. Hopcroft
ⓘ
surface form:
John Hopcroft
|
| educatedAt |
National Technical University of Athens
ⓘ
Princeton University ⓘ |
| field |
algorithms
ⓘ
bioinformatics ⓘ combinatorics ⓘ computational complexity theory ⓘ computer science ⓘ database theory ⓘ game theory ⓘ optimization ⓘ |
| hasAcademicPosition |
Columbia University
ⓘ
Harvard University ⓘ Massachusetts Institute of Technology ⓘ Stanford University ⓘ University of California, Berkeley ⓘ University of California, San Diego ⓘ |
| influenced |
field of algorithmic game theory
ⓘ
research on approximation and hardness of approximation ⓘ research on complexity of equilibria ⓘ research on database concurrency control ⓘ |
| knownFor |
Papadimitriou–Yannakakis theorem
ⓘ
complexity of Nash equilibrium ⓘ complexity of equilibria ⓘ complexity of local search (PLS) ⓘ complexity of probabilistic verification (IP, PCP) ⓘ computational complexity theory ⓘ contributions to combinatorial optimization ⓘ contributions to computational biology ⓘ contributions to database theory ⓘ contributions to online algorithms ⓘ work on NP-completeness ⓘ work on algorithmic game theory ⓘ work on approximation algorithms ⓘ |
| memberOf |
Academy of Athens
ⓘ
American Academy of Arts and Sciences ⓘ National Academy of Engineering ⓘ National Academy of Sciences ⓘ
surface form:
National Academy of Sciences of the United States of America
|
| notableWork |
Algorithms (with Sanjoy Dasgupta and Umesh Vazirani)
ⓘ
Combinatorial Optimization: Algorithms and Complexity ⓘ Papadimitriou: Computational Complexity ⓘ
surface form:
Computational Complexity (textbook)
Elements of the Theory of Computation ⓘ The Theory of Database Concurrency Control ⓘ Turing (novel) ⓘ |
| positionHeld |
C. Lester Hogan Professor of Electrical Engineering and Computer Science at UC Berkeley
ⓘ
Professor of Computer Science at Columbia University ⓘ |
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: Christos H. Papadimitriou Description of subject: Christos H. Papadimitriou is a prominent computer scientist renowned for his foundational contributions to computational complexity theory, algorithms, and game theory.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.