Noga Alon
E157415
Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Noga Alon canonical | 24 |
How this entity was disambiguated
This entity first appeared as the object of triple T1383073 — 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: Noga Alon Context triple: [Emmy Noether Lecture, hasNotableLecturer, Noga Alon]
-
A.
Ehud Kalai
Ehud Kalai is an Israeli-American game theorist and economist known for his influential contributions to bargaining theory, game theory, and economic theory.
-
B.
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.
-
C.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
D.
Avi Wigderson
Avi Wigderson is a prominent Israeli-American computer scientist renowned for his foundational contributions to computational complexity theory and for receiving the Turing Award.
-
E.
Omer Reingold
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.
- 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: Noga Alon Target entity description: Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
-
A.
Ehud Kalai
Ehud Kalai is an Israeli-American game theorist and economist known for his influential contributions to bargaining theory, game theory, and economic theory.
-
B.
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.
-
C.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
D.
Avi Wigderson
Avi Wigderson is a prominent Israeli-American computer scientist renowned for his foundational contributions to computational complexity theory and for receiving the Turing Award.
-
E.
Omer Reingold
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.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
Israeli mathematician
ⓘ
human ⓘ mathematician ⓘ |
| awardReceived |
Dannie Heineman Prize for Mathematical Physics
ⓘ
EMET Prize ⓘ Erdős Prize ⓘ Gödel Prize ⓘ Israel Prize in mathematics and computer science ⓘ Rothschild Prize ⓘ |
| countryOfCitizenship | Israel ⓘ |
| doctoralAdvisor | Michael Rabin ⓘ |
| educatedAt | Tel Aviv University ⓘ |
| employer |
Institute for Advanced Study
ⓘ
Princeton University ⓘ Tel Aviv University ⓘ |
| familyName | Alon ⓘ |
| fieldOfWork |
additive combinatorics
ⓘ
algorithmic graph theory ⓘ combinatorial number theory ⓘ combinatorics ⓘ discrete mathematics ⓘ extremal combinatorics ⓘ graph theory ⓘ mathematics ⓘ probabilistic method ⓘ spectral graph theory ⓘ theoretical computer science ⓘ theoretical computer science complexity ⓘ theory of expander graphs ⓘ |
| givenName | Noga ⓘ |
| hasWritten |
many research papers in combinatorics and graph theory
ⓘ
textbooks on combinatorics and theoretical computer science ⓘ |
| influenced |
graph theory
ⓘ
modern combinatorics ⓘ theoretical computer science ⓘ |
| memberOf |
Academia Europaea
ⓘ
American Academy of Arts and Sciences ⓘ Israel Academy of Sciences and Humanities ⓘ |
| name | Noga Alon ⓘ |
| notableStudent | numerous researchers in combinatorics and theoretical computer science ⓘ |
| notableWork |
Alon–Boppana bound
ⓘ
Alon–Tarsi conjecture ⓘ Combinatorial Nullstellensatz ⓘ work on additive number theory ⓘ work on expander graphs ⓘ work on graph coloring ⓘ work on probabilistic method in combinatorics ⓘ work on property testing ⓘ work on streaming algorithms in graph theory ⓘ |
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: Noga Alon Description of subject: Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
Referenced by (24)
Full triples — surface form annotated when it differs from this entity's canonical label.