Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Miklos Ajtai

Theory of Computation

Miklos Ajtai (born July 2, 1946) is a Hungarian-American computer scientist working at IBM's Almaden Research Center, specializing in computational complexity theory. With Janos Komlos and Endre Szemeredi he co-developed a well known sorting network algorithm, and his research also established exponential lower bounds and time-space tradeoffs for branching programs and founded lattice-based cryptography. He received the Knuth Prize in 2003, was elected to the United States National Academy of Sciences in 2021, and received the IEEE John von Neumann Medal in 2025 for contributions to establishing lower bounds in computational complexity and founding lattice-based cryptography.

Facts
Birth Year
1946 1
Connections

In Field

Source Miklós Ajtai (Wikipedia)
In the Other Atlases
Sources
1. Wikidata: Miklos Ajtai
  • Wikidata Q92843, class allow-list match (w-wdresolver-0926)
  • Wikidata Q92843 P569 (date of birth)
View the Source
Miklós Ajtai (Wikipedia)
In Field: Theory of Computation, Infobox field and known_for, lead paragraphView the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.