World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
47
Citations
14282
World Ranking
6328
National Ranking
4

Mathematics

D-Index
48
Citations
14473
World Ranking
1183
National Ranking
7

Research.com Recognitions

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

Overview

Miklós Ajtai is affiliated with the Hungarian Academy of Sciences in Hungary. Their research activity is primarily focused in the field of computer science, with specific contributions concentrated in artificial intelligence and computational theory and mathematics.

The scientist's work encompasses several main topics including machine learning and algorithms, complexity and algorithms in graphs, and cryptography and data security. These areas illustrate a broad engagement with both theoretical and applied aspects of computation.

Miklós Ajtai has authored research published in notable venues, including arXiv (Cornell University). A recent publication from 2022 is titled "The White-Box Adversarial Data Stream Model" and it contributes to the corpus of work available through arXiv.

  • Vladimir Braverman
  • T. S. Jayram
  • Sandeep Silwal
  • Alec Sun
  • David P. Woodruff

The frequent collaborators listed in their research include Vladimir Braverman, T. S. Jayram, Sandeep Silwal, Alec Sun, and David P. Woodruff, reflecting a network of partnerships in computational research.

Miklós Ajtai has been recognized by the scientific community through fellowship awards, notably being named a Fellow of the American Association for the Advancement of Science (AAAS) in 2012.

Best Publications

  • Generating hard instances of lattice problems (extended abstract)

    M. Ajtai

  • An 0(n log n) sorting network

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

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

    Miklós Ajtai;Cynthia Dwork

  • Generating Hard Instances of Lattice Problems

    Miklós Ajtai

  • ∑11-Formulae on finite structures

    Miklós Ajtai

  • A sieve algorithm for the shortest lattice vector problem

    Miklós Ajtai;Ravi Kumar;D. Sivakumar

  • Sorting in c log n parallel steps

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

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

    Miklós Ajtai

  • Generating Hard Instances of the Short Basis Problem

    Miklós Ajtai

  • Crossing-Free Subgraphs

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

  • A note on Ramsey numbers

    Miklós Ajtai;János Komlós;Endre Szemerédi

  • The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions.

    Miklós Ajtai

  • On optimal matchings

    Miklós Ajtai;János Komlós;Gábor E. Tusnády

  • The complexity of the Pigeonhole Principle

    Miklós Ajtai

  • Deterministic simulation in LOGSPACE

    M. Ajtai;J. Komlos;E. Szemeredi

  • System and method for differential compression of data from a plurality of binary sources

    Miklos Ajtai;Randal Chilton Burns;Ronald Fagin;Larry Joseph Stockmeyer

  • The longest path in a random graph

    Miklós Ajtai;János Komlós;Endre Szemerédi

  • Largest random component of a k -cube

    Miklós Ajtai;János Komlós;Endre Szemerédi

  • A Dense Infinite Sidon Sequence

    Miklós Ajtai;János Komlós;Endre Szemerédi

  • Reachability is Harder for Directed Than for Undirected Finite Graphs

    Miklos Ajtai;Ronald Fagin

  • O(n LOG n) SORTING NETWORK.

    M. Ajtai;Janos Komlos;E. Szemeredi

Frequent Co-Authors

Endre Szemerédi
Endre Szemerédi Alfréd Rényi Institute of Mathematics
Cynthia Dwork
Cynthia Dwork Harvard University
Ronald Fagin
Ronald Fagin IBM (United States)
Larry J. Stockmeyer
Larry J. Stockmeyer IBM (United States)
Nimrod Megiddo
Nimrod Megiddo IBM (United States)
Dandapani Sivakumar
Dandapani Sivakumar Google (United States)
Ravi Kumar
Ravi Kumar Google (United States)
Vitaly Feldman
Vitaly Feldman Apple (United States)
Avinatan Hassidim
Avinatan Hassidim Bar-Ilan University
Avi Wigderson
Avi Wigderson Institute for Advanced Study

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

Report an issue

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:

Related Online Degrees & Career Pathways

Studying mathematics in the USA opens doors to various interdisciplinary career opportunities. Many graduates leverage their analytical skills by pursuing specialized fields like data science. For those interested in further enhancing their expertise, a data analytics master's degree offers advanced training to handle complex data-driven challenges across industries.

Additionally, combining mathematical knowledge with business acumen is a popular pathway. Earning an MBA can help graduates take on leadership roles or entrepreneurial ventures. For students seeking flexible and accessible options, there are multiple easiest MBA programs to get into, providing a smoother admission process without compromising quality.

Many institutions now provide an easiest MBA online, allowing busy professionals to balance education with work commitments. Beyond MBAs, those aiming for executive-level expertise might consider pursuing a Doctor of Business Administration. Accessibility is key here, with some of the cheapest DBA online options offering quality education at an affordable cost.

Exploring these related online degrees can broaden career prospects and equip mathematics graduates with the skills needed to excel in today’s competitive job market.

Best Scientists Citing Miklós Ajtai

Trending Scientists