- Home
- Best Scientists - Mathematics
- Miklós Ajtai

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
40
Citations
12,639
84
World Ranking
1338
National Ranking
8

Computer Science
D-index
40
Citations
12,623
83
World Ranking
5629
National Ranking
6

2012 - Fellow of the American Association for the Advancement of Science (AAAS)

- Algorithm
- Time complexity
- Combinatorics

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.

- ∑11-Formulae on finite structures (526 citations)
- Sorting inc logn parallel steps (481 citations)
- A note on Ramsey numbers (344 citations)

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.

- Combinatorics (61.22%)
- Discrete mathematics (53.06%)
- Programming language (32.65%)

- Algorithm (66.67%)
- Cryptography (50.00%)
- Mathematical analysis (50.00%)

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.

- Sorting and Selection with Imprecise Comparisons (33 citations)
- Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures (31 citations)
- Sorting and Selection with Imprecise Comparisons (17 citations)

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)

M. Ajtai.

symposium on the theory of computing **(1996)**

1245 Citations

An 0(n log n) sorting network

M. Ajtai;J. Komlós;E. Szemerédi.

symposium on the theory of computing **(1983)**

1118 Citations

A public-key cryptosystem with worst-case/average-case equivalence

Miklós Ajtai;Cynthia Dwork.

symposium on the theory of computing **(1997)**

876 Citations

Generating Hard Instances of Lattice Problems

Miklós Ajtai.

Electronic Colloquium on Computational Complexity **(1996)**

813 Citations

∑11-Formulae on finite structures

Miklós Ajtai.

Annals of Pure and Applied Logic **(1983)**

689 Citations

Sorting in c log n parallel steps

M. Ajtai;J. Komlós;E. Szemerédi.

Combinatorica **(1983)**

671 Citations

A sieve algorithm for the shortest lattice vector problem

Miklós Ajtai;Ravi Kumar;D. Sivakumar.

symposium on the theory of computing **(2001)**

613 Citations

The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)

Miklós Ajtai.

symposium on the theory of computing **(1998)**

500 Citations

Crossing-Free Subgraphs

M. Ajtai;V. Chvátal;M.M. Newborn;E. Szemerédi.

North-holland Mathematics Studies **(1982)**

459 Citations

Generating Hard Instances of the Short Basis Problem

Miklós Ajtai.

international colloquium on automata languages and programming **(1999)**

458 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

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:

Alfréd Rényi Institute of Mathematics

IBM (United States)

Harvard University

IBM (United States)

IBM (United States)

Google (United States)

Google (United States)

Yale University

Apple (United States)

Institute for Advanced Study

French Institute for Research in Computer Science and Automation - INRIA

Publications: 37

University of Freiburg

Peking University

University of Manchester

University of Santiago de Compostela

Kyoto University

Lanzhou Jiaotong University

University of Bristol

University of Stirling

University of Rouen

University of Valencia

North Dakota State University

Ottawa Hospital

Boston University

Lund University

Something went wrong. Please try again later.