2012 - Fellow of the American Association for the Advancement of Science (AAAS)
In the subject of Geometry, Miklós Ajtai integrates adjacent scientific disciplines such as Reduction (mathematics) and Basis (linear algebra). Many of his studies on Reduction (mathematics) involve topics that are commonly interrelated, such as Geometry. In the field of Artificial intelligence he connects related research areas like Enhanced Data Rates for GSM Evolution and Class (philosophy). His research on Class (philosophy) often connects related areas such as Artificial intelligence. In most of his Combinatorics studies, his work intersects topics such as Disjoint sets. His research links Discrete mathematics with Disjoint sets. As part of his studies on Discrete mathematics, he often connects relevant subjects like Random graph. His work on Graph is being expanded to include thematically relevant topics such as Random graph. Miklós Ajtai carries out multidisciplinary research, doing studies in Algorithm and Randomized algorithm.
His Programming language research is linked to Constant (computer programming) and Set (abstract data type), among other subjects. His Set (abstract data type) study frequently links to other fields, such as Programming language. His work on Graph expands to the thematically related Combinatorics. His research combines Discrete mathematics and Graph. His study deals with a combination of Discrete mathematics and Combinatorics. As part of his studies on Mathematical analysis, Miklós Ajtai often connects relevant areas like Upper and lower bounds. His Upper and lower bounds study frequently links to adjacent areas such as Mathematical analysis. Miklós Ajtai brings together Algorithm and Artificial intelligence to produce work in his papers. He integrates Artificial intelligence and Algorithm in his studies.
His Artificial intelligence study frequently intersects with other fields, such as Selection (genetic algorithm) and Ranking (information retrieval). He regularly links together related areas like Artificial intelligence in his Selection (genetic algorithm) studies. Miklós Ajtai merges many fields, such as Algorithm and Upper and lower bounds, in his writings. Miklós Ajtai integrates Upper and lower bounds and Algorithm in his studies. He undertakes multidisciplinary studies into Cryptography and Lattice problem in his work. His research on Mathematical analysis frequently links to adjacent areas such as Bounded function. Bounded function is often connected to Mathematical analysis in his work. His research on Discrete mathematics frequently links to adjacent areas such as Equivalence (formal languages). His Equivalence (formal languages) study frequently involves adjacent topics like Discrete mathematics.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Generating hard instances of lattice problems (extended abstract)
symposium on the theory of computing (1996)
An 0(n log n) sorting network
M. Ajtai;J. Komlós;E. Szemerédi.
symposium on the theory of computing (1983)
A public-key cryptosystem with worst-case/average-case equivalence
Miklós Ajtai;Cynthia Dwork.
symposium on the theory of computing (1997)
Generating Hard Instances of Lattice Problems
Electronic Colloquium on Computational Complexity (1996)
∑11-Formulae on finite structures
Annals of Pure and Applied Logic (1983)
Sorting in c log n parallel steps
M. Ajtai;J. Komlós;E. Szemerédi.
A sieve algorithm for the shortest lattice vector problem
Miklós Ajtai;Ravi Kumar;D. Sivakumar.
symposium on the theory of computing (2001)
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
symposium on the theory of computing (1998)
M. Ajtai;V. Chvátal;M.M. Newborn;E. Szemerédi.
North-holland Mathematics Studies (1982)
Generating Hard Instances of the Short Basis Problem
international colloquium on automata languages and programming (1999)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: