Miklos Ajtai
E512974
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Miklos Ajtai canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5335949 — 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: Miklos Ajtai Context triple: [EATCS Award, notableRecipient, Miklos Ajtai]
-
A.
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.
-
B.
Alfréd Rényi
Alfréd Rényi was a Hungarian mathematician renowned for his influential work in probability theory, information theory, and number theory.
-
C.
Noga Alon
Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
-
D.
Johan Håstad
Johan Håstad is a Swedish theoretical computer scientist renowned for his groundbreaking work in computational complexity theory, particularly optimal inapproximability results and contributions to the PCP theorem.
-
E.
Pál Turán
Pál Turán was a Hungarian mathematician renowned for his influential work in number theory and combinatorics, including the development of Turán's theorem in extremal graph theory.
- 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: Miklos Ajtai Target entity description: Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
-
A.
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.
-
B.
Alfréd Rényi
Alfréd Rényi was a Hungarian mathematician renowned for his influential work in probability theory, information theory, and number theory.
-
C.
Noga Alon
Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
-
D.
Johan Håstad
Johan Håstad is a Swedish theoretical computer scientist renowned for his groundbreaking work in computational complexity theory, particularly optimal inapproximability results and contributions to the PCP theorem.
-
E.
Pál Turán
Pál Turán was a Hungarian mathematician renowned for his influential work in number theory and combinatorics, including the development of Turán's theorem in extremal graph theory.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
Hungarian-American
ⓘ
person ⓘ theoretical computer scientist ⓘ |
| awardReceived |
Fulkerson Prize
NERFINISHED
ⓘ
Gödel Prize NERFINISHED ⓘ Knuth Prize NERFINISHED ⓘ |
| coAuthor |
Avi Wigderson
NERFINISHED
ⓘ
Cynthia Dwork NERFINISHED ⓘ Endre Szemerédi NERFINISHED ⓘ Gábor Tardos NERFINISHED ⓘ Joel Spencer NERFINISHED ⓘ János Komlós NERFINISHED ⓘ Merrick Furst NERFINISHED ⓘ Michael Ben-Or NERFINISHED ⓘ Michael Saks NERFINISHED ⓘ Moti Yung NERFINISHED ⓘ Noga Alon NERFINISHED ⓘ Ravi Kumar NERFINISHED ⓘ |
| countryOfCitizenship |
Hungary
ⓘ
United States of America ⓘ |
| educatedAt | Eötvös Loránd University NERFINISHED ⓘ |
| employer | IBM Thomas J. Watson Research Center NERFINISHED ⓘ |
| fieldOfWork |
circuit complexity
ⓘ
combinatorics ⓘ computational complexity theory ⓘ computer science ⓘ lattice-based cryptography ⓘ parallel computation ⓘ proof complexity ⓘ theory of computation ⓘ |
| hasAcademicAdvisor | László Kalmár NERFINISHED ⓘ |
| hasResearchArea |
Boolean circuits
ⓘ
NP-completeness NERFINISHED ⓘ cryptographic hardness assumptions ⓘ probabilistic combinatorics ⓘ randomized algorithms ⓘ |
| knownFor |
contributions to parallel computation theory
ⓘ
foundational work in lattice-based cryptography ⓘ lower bounds in circuit complexity ⓘ worst-case hardness assumptions for cryptography ⓘ |
| memberOf | Association for Computing Machinery NERFINISHED ⓘ |
| notableStudent | Cynthia Dwork NERFINISHED ⓘ |
| notableWork |
Ajtai–Dwork cryptosystem
NERFINISHED
ⓘ
lower bounds for constant-depth circuits ⓘ results on the shortest vector problem in lattices ⓘ worst-case to average-case reductions for lattice problems ⓘ |
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: Miklos Ajtai Description of subject: Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.