Miklós Ajtai Explained

Miklos Ajtai
Birth Date:2 July 1946
Birth Place:Budapest, Second Republic of Hungary
Nationality:Hungarian-American
Fields:Computational complexity theory
Workplaces:IBM Almaden Research Center
Alma Mater:Hungarian Academy of Sciences
Awards:Knuth Prize (2003)[1]

Miklós Ajtai (born 2 July 1946) is a computer scientist at the IBM Almaden Research Center, United States. In 2003, he received the Knuth Prize for his numerous contributions to the field, including a classic sorting network algorithm (developed jointly with J. Komlós and Endre Szemerédi), exponential lower bounds, superlinear time-space tradeoffs for branching programs, and other "unique and spectacular" results. He is a member of the U.S. National Academy of Sciences.[2]

Selected results

One of Ajtai's results states that the length of proofs in propositional logic of the pigeonhole principle for n items grows faster than any polynomial in n. He also proved that the statement "any two countable structures that are second-order equivalent are also isomorphic" is both consistent with and independent of ZFC. Ajtai and Szemerédi proved the corners theorem, an important step toward higher-dimensional generalizations of the Szemerédi theorem. With Komlós and Szemerédi, he proved the ct2/log t upper bound for the Ramsey number R(3,t). The corresponding lower bound was proved by Kim only in 1995, a result that earned him a Fulkerson Prize. With Chvátal, Newborn, and Szemerédi, Ajtai proved the crossing number inequality, that any drawing of a graph with n vertices and m edges, where, has at least crossings. Ajtai and Dwork devised in 1997 a lattice-based public-key cryptosystem; Ajtai has done extensive work on lattice problems. For his numerous contributions in Theoretical Computer Science, he received the Knuth Prize.

Biography

Ajtai received his Candidate of Sciences degree in 1976 from the Hungarian Academy of Sciences.[3] Since 1995, he has been an external member of the Hungarian Academy of Sciences.

In 1998, he was an Invited Speaker of the International Congress of Mathematicians in Berlin.[4] In 2012, he was elected as a Fellow of the American Association for the Advancement of Science.[5] In 2021, he was elected a member of the National Academy of Sciences.[6]

Bibliography

Selected papers

  1. Ajtai . M. . Isomorphism and higher order equivalence . Annals of Mathematical Logic . September 1979 . 16 . 3 . 181–203 . 10.1016/0003-4843(79)90001-9 .
  2. Ajtai . M. . Komlós . J. . Szemerédi . E. . Largest random component of a k-cube . Combinatorica . March 1982 . 2 . 1 . 1–7 . 10.1007/BF02579276 . 7903662 .

External links

Notes and References

  1. Web site: Archived copy . 2015-02-10 . 2021-05-14 . https://web.archive.org/web/20210514184749/http://www.sigact.org/prizes/knuth/2003.html . dead .
  2. Web site: News from the National Academy of Sciences. 26 April 2021. 1 July 2021. Newly elected members and their affiliations at the time of election are: ... Ajtai, Miklós; IBM Emeritus Researcher, IBM Almaden Research Center, Los Gatos, Calif..
  3. Magyar Tudományos Akadémia, Almanach, 1986, Budapest.
  4. Ajtai . Miklós . Worst-case complexity, average-case complexity and lattice problems. . Documenta Mathematica . 1998 . 421–428 .
  5. https://www.aaas.org/news/aaas-members-elected-fellows-1 AAAS Members Elected as Fellows
  6. Web site: National Academy of Sciences Elects New Members — Including a Record Number of Women — and International Members . . 26 April 2021 . nasonline.org . 28 April 2021 .