Noam Nisan
E523342
Noam Nisan is an Israeli computer scientist known for his influential work in computational complexity, algorithmic game theory, and communication complexity, and for co-authoring foundational textbooks in these areas.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Noam Nisan canonical | 3 |
How this entity was disambiguated
This entity first appeared as the object of triple T5335955 — 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: Noam Nisan Context triple: [EATCS Award, notableRecipient, Noam Nisan]
-
A.
Michael Rabin
Michael Rabin is an Israeli computer scientist and Turing Award laureate renowned for his foundational contributions to automata theory, cryptography, and randomized algorithms.
-
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.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
D.
Juris Hartmanis
Juris Hartmanis was a pioneering computer scientist best known for co-founding the field of computational complexity theory and sharing the 1993 Turing Award for his fundamental contributions.
-
E.
Moshe Y. Vardi
Moshe Y. Vardi is a prominent computer scientist known for his influential work in logic in computer science, database theory, and automated verification.
- 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: Noam Nisan Target entity description: Noam Nisan is an Israeli computer scientist known for his influential work in computational complexity, algorithmic game theory, and communication complexity, and for co-authoring foundational textbooks in these areas.
-
A.
Michael Rabin
Michael Rabin is an Israeli computer scientist and Turing Award laureate renowned for his foundational contributions to automata theory, cryptography, and randomized algorithms.
-
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.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
D.
Juris Hartmanis
Juris Hartmanis was a pioneering computer scientist best known for co-founding the field of computational complexity theory and sharing the 1993 Turing Award for his fundamental contributions.
-
E.
Moshe Y. Vardi
Moshe Y. Vardi is a prominent computer scientist known for his influential work in logic in computer science, database theory, and automated verification.
- F. None of above. chosen
Statements (30)
| Predicate | Object |
|---|---|
| instanceOf |
person
ⓘ
theoretical computer scientist ⓘ |
| awardReceived |
Gödel Prize
NERFINISHED
ⓘ
Knuth Prize NERFINISHED ⓘ |
| coAuthorOf |
Algorithmic Game Theory
NERFINISHED
ⓘ
Communication Complexity NERFINISHED ⓘ The Computational Complexity of Boolean Functions NERFINISHED ⓘ |
| countryOfCitizenship | Israel ⓘ |
| educatedAt | Hebrew University of Jerusalem NERFINISHED ⓘ |
| employer | Hebrew University of Jerusalem NERFINISHED ⓘ |
| fieldOfWork |
algorithmic game theory
ⓘ
communication complexity ⓘ computational complexity theory ⓘ computer science ⓘ theory of computation ⓘ |
| hasAcademicAdvisor | Avi Wigderson NERFINISHED ⓘ |
| knownFor |
foundational textbooks in theoretical computer science
ⓘ
work in algorithmic game theory ⓘ work in communication complexity ⓘ work in computational complexity theory ⓘ |
| language |
English
ⓘ
Hebrew ⓘ |
| memberOf | School of Computer Science and Engineering at the Hebrew University of Jerusalem NERFINISHED ⓘ |
| notableStudent | Tim Roughgarden NERFINISHED ⓘ |
| occupation |
professor
ⓘ
researcher ⓘ |
| researchArea |
circuit complexity
ⓘ
derandomization ⓘ mechanism design ⓘ randomness in 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: Noam Nisan Description of subject: Noam Nisan is an Israeli computer scientist known for his influential work in computational complexity, algorithmic game theory, and communication complexity, and for co-authoring foundational textbooks in these areas.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.