Omer Reingold
E127857
Omer Reingold is a prominent theoretical computer scientist known for his influential work in computational complexity and cryptography, including a landmark log-space algorithm for undirected graph connectivity.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Omer Reingold canonical | 5 |
How this entity was disambiguated
This entity first appeared as the object of triple T1013303 — 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: Omer Reingold Context triple: [Oded Goldreich, notableStudent, Omer Reingold]
-
A.
Boaz Barak
Boaz Barak is a prominent theoretical computer scientist known for his influential work in cryptography and computational complexity theory.
-
B.
Iftach Haitner
Iftach Haitner is an Israeli computer scientist and cryptographer known for his contributions to the foundations of cryptography and computational complexity.
-
C.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to cryptography and computational complexity theory.
-
D.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
E.
Mihir Bellare
Mihir Bellare is a prominent computer scientist and cryptographer known for his foundational work in modern cryptographic theory and practice.
- 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: Omer Reingold Target entity description: Omer Reingold is a prominent theoretical computer scientist known for his influential work in computational complexity and cryptography, including a landmark log-space algorithm for undirected graph connectivity.
-
A.
Boaz Barak
Boaz Barak is a prominent theoretical computer scientist known for his influential work in cryptography and computational complexity theory.
-
B.
Iftach Haitner
Iftach Haitner is an Israeli computer scientist and cryptographer known for his contributions to the foundations of cryptography and computational complexity.
-
C.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to cryptography and computational complexity theory.
-
D.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
E.
Mihir Bellare
Mihir Bellare is a prominent computer scientist and cryptographer known for his foundational work in modern cryptographic theory and practice.
- F. None of above. chosen
Statements (32)
| Predicate | Object |
|---|---|
| instanceOf |
person
ⓘ
theoretical computer scientist ⓘ |
| almaMater | Weizmann Institute of Science ⓘ |
| awardReceived |
Grace Murray Hopper Award
ⓘ
Gödel Prize ⓘ |
| citizenship | Israel ⓘ |
| degree | PhD in computer science ⓘ |
| doctoralAdvisor | Avi Wigderson ⓘ |
| employer |
AT&T Labs – Research
ⓘ
linked to:
Bell Telephone Laboratories
Samsung Research America ⓘ Stanford University ⓘ Weizmann Institute of Science ⓘ |
| field |
computational complexity theory
ⓘ
cryptography ⓘ theoretical computer science ⓘ |
| influencedBy | Avi Wigderson ⓘ |
| knownFor |
log-space algorithm for undirected graph connectivity
ⓘ
work in computational complexity ⓘ work in cryptography ⓘ |
| memberOf |
Association for Computing Machinery
ⓘ
IEEE Computer Society ⓘ |
| nationality | Israeli ⓘ |
| notableResult | proved that undirected s-t connectivity is in L ⓘ |
| notableWork | Undirected connectivity in log-space ⓘ |
| positionHeld |
director of the Theory Group at Samsung Research America
ⓘ
faculty member at Weizmann Institute of Science ⓘ professor of computer science at Stanford University ⓘ |
| researchArea |
derandomization
ⓘ
expander graphs ⓘ foundations of cryptography ⓘ pseudorandomness ⓘ space-bounded computation ⓘ |
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: Omer Reingold Description of subject: Omer Reingold is a prominent theoretical computer scientist known for his influential work in computational complexity and cryptography, including a landmark log-space algorithm for undirected graph connectivity.
Referenced by (5)
Full triples — surface form annotated when it differs from this entity's canonical label.