Richard Lipton
E141639
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Richard Lipton canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1134450 — 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.
Target entity: Richard Lipton Context triple: [Avi Wigderson, doctoralAdvisor, Richard Lipton]
-
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.
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.
-
C.
W. Craig Jelinek
W. Craig Jelinek is an American business executive best known for serving as the CEO of Costco Wholesale Corporation.
-
D.
David M. Brown
David M. Brown was a U.S. Navy captain and NASA astronaut who served as a mission specialist on the ill-fated Space Shuttle Columbia STS-107 mission.
-
E.
J Strother Moore
J Strother Moore is an American computer scientist best known for his pioneering work in automated theorem proving and formal methods, including co-developing the Boyer–Moore theorem prover and the ACL2 system.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Richard Lipton Target entity description: 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.
-
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.
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.
-
C.
W. Craig Jelinek
W. Craig Jelinek is an American business executive best known for serving as the CEO of Costco Wholesale Corporation.
-
D.
David M. Brown
David M. Brown was a U.S. Navy captain and NASA astronaut who served as a mission specialist on the ill-fated Space Shuttle Columbia STS-107 mission.
-
E.
J Strother Moore
J Strother Moore is an American computer scientist best known for his pioneering work in automated theorem proving and formal methods, including co-developing the Boyer–Moore theorem prover and the ACL2 system.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
American
ⓘ
computer scientist ⓘ cryptographer ⓘ person ⓘ theoretical computer scientist ⓘ |
| almaMater |
CMU
ⓘ
surface form:
Carnegie Mellon University
|
| awardReceived |
Guggenheim Fellowship
ⓘ
Donald E. Knuth Prize ⓘ
surface form:
Knuth Prize
|
| blogLanguage | English ⓘ |
| citizenship |
United States of America
ⓘ
surface form:
United States
|
| coAuthor |
Avi Wigderson
ⓘ
Jeffrey D. Ullman ⓘ
surface form:
Jeffrey Ullman
Kenneth Regan ⓘ Lance Fortnow ⓘ Robert Tarjan ⓘ |
| doctoralAdvisor | Manuel Blum ⓘ |
| educatedIn | computer science ⓘ |
| employer |
Georgia Institute of Technology
ⓘ
Princeton University ⓘ University of California, Berkeley ⓘ Yale University ⓘ |
| field |
algorithm design
ⓘ
computational complexity theory ⓘ computer science ⓘ cryptography ⓘ theoretical computer science ⓘ |
| hasAcademicAdvisor | Manuel Blum ⓘ |
| hasBlog |
blog "Gödel’s Lost Letter and P=NP"
ⓘ
surface form:
Gödel’s Lost Letter and P=NP
|
| hasResearchArea |
distributed computing
ⓘ
graph algorithms ⓘ probabilistic algorithms ⓘ security and privacy ⓘ |
| honorificTitle |
Fellow of the Association for Computing Machinery
ⓘ
surface form:
ACM Fellow
IEEE Fellow ⓘ |
| knownFor |
Lipton–Tarjan separator theorem
ⓘ
blog "Gödel’s Lost Letter and P=NP" ⓘ contributions to algorithm design ⓘ contributions to complexity theory ⓘ research on cryptographic protocols ⓘ research on interactive proofs ⓘ research on program checking ⓘ work in cryptography ⓘ work in theoretical computer science ⓘ |
| memberOf |
Association for Computing Machinery
ⓘ
Institute of Electrical and Electronics Engineers ⓘ
surface form:
IEEE
|
| nationality |
United States of America
ⓘ
surface form:
United States
|
| notableStudent |
Kenneth Regan
ⓘ
Lance Fortnow ⓘ |
| positionHeld |
Frederick G. Storey Chair in Computing at Georgia Tech
ⓘ
professor of computer science ⓘ |
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.
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.
Subject: Richard Lipton Description of subject: 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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.