Uriel Feige
E836654
Uriel Feige is an Israeli computer scientist known for his influential work in computational complexity theory, approximation algorithms, and probabilistically checkable proofs.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Uriel Feige canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9958223 — 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: Uriel Feige Context triple: [Amos Fiat, coAuthor, Uriel Feige]
-
A.
Avi Kivity
Avi Kivity is an Israeli software engineer best known as the original creator of the KVM virtualization infrastructure for the Linux kernel.
-
B.
Oren Aviv
Oren Aviv is an American film executive and producer known for his work on major Hollywood projects, including contributing to the story for the action-adventure film "National Treasure."
-
C.
Doron Peled
Doron Peled is a computer scientist known for his contributions to formal methods and model checking, particularly in collaboration with Edmund M. Clarke.
-
D.
Tom Erez
Tom Erez is a researcher in machine learning and control, known for his work on deep reinforcement learning algorithms such as Deep Deterministic Policy Gradient (DDPG).
-
E.
Yoav Nir
Yoav Nir is a computer scientist and cryptography expert known for his work on internet security standards, including co-authoring RFC 7539 on the ChaCha20 and Poly1305 encryption algorithms.
- 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: Uriel Feige Target entity description: Uriel Feige is an Israeli computer scientist known for his influential work in computational complexity theory, approximation algorithms, and probabilistically checkable proofs.
-
A.
Avi Kivity
Avi Kivity is an Israeli software engineer best known as the original creator of the KVM virtualization infrastructure for the Linux kernel.
-
B.
Oren Aviv
Oren Aviv is an American film executive and producer known for his work on major Hollywood projects, including contributing to the story for the action-adventure film "National Treasure."
-
C.
Doron Peled
Doron Peled is a computer scientist known for his contributions to formal methods and model checking, particularly in collaboration with Edmund M. Clarke.
-
D.
Tom Erez
Tom Erez is a researcher in machine learning and control, known for his work on deep reinforcement learning algorithms such as Deep Deterministic Policy Gradient (DDPG).
-
E.
Yoav Nir
Yoav Nir is a computer scientist and cryptography expert known for his work on internet security standards, including co-authoring RFC 7539 on the ChaCha20 and Poly1305 encryption algorithms.
- F. None of above. chosen
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
person
ⓘ
theoretical computer scientist ⓘ |
| academicDiscipline | theoretical computer science ⓘ |
| affiliation | Weizmann Institute of Science NERFINISHED ⓘ |
| awardReceived |
Gödel Prize
NERFINISHED
ⓘ
Knuth Prize NERFINISHED ⓘ |
| citizenship | Israel ⓘ |
| countryOfCitizenship | Israel ⓘ |
| doctoralAdvisor | Noga Alon NERFINISHED ⓘ |
| doctoralStudent |
Irit Dinur
NERFINISHED
ⓘ
Oded Regev NERFINISHED ⓘ |
| educatedAt |
Hebrew University of Jerusalem
NERFINISHED
ⓘ
Weizmann Institute of Science NERFINISHED ⓘ |
| employer | Weizmann Institute of Science NERFINISHED ⓘ |
| fieldOfWork |
approximation algorithms
ⓘ
computational complexity theory ⓘ computer science ⓘ probabilistically checkable proofs ⓘ |
| gender | male ⓘ |
| hasAcademicAdvisor | Noga Alon NERFINISHED ⓘ |
| hasContribution |
Feige’s conjecture relating random 3-SAT to worst-case complexity
NERFINISHED
ⓘ
approximation algorithms for combinatorial optimization problems ⓘ development of PCP-based hardness of approximation ⓘ |
| hasResearchInterest |
graph algorithms
ⓘ
inapproximability results ⓘ probabilistic proof systems ⓘ randomized algorithms ⓘ |
| knownFor |
Feige’s conjecture on random 3-SAT
NERFINISHED
ⓘ
hardness of approximation results ⓘ work on approximation algorithms ⓘ work on computational complexity theory ⓘ work on probabilistically checkable proofs ⓘ |
| languageOfWorkOrName |
English
ⓘ
Hebrew ⓘ |
| memberOf | Department of Computer Science and Applied Mathematics at Weizmann Institute of Science NERFINISHED ⓘ |
| notableStudent |
Irit Dinur
NERFINISHED
ⓘ
Oded Regev NERFINISHED ⓘ |
| notableWork |
Feige’s threshold conjecture for random 3-SAT
NERFINISHED
ⓘ
results on hardness of approximation ⓘ results on probabilistically checkable proofs ⓘ |
| occupation |
researcher
ⓘ
university teacher ⓘ |
| positionHeld | professor at Weizmann Institute of Science ⓘ |
| workplace | Weizmann Institute of Science NERFINISHED ⓘ |
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: Uriel Feige Description of subject: Uriel Feige is an Israeli computer scientist known for his influential work in computational complexity theory, approximation algorithms, and probabilistically checkable proofs.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.