| advertise add site services publishers database health videos | ![]() | about toolbar stats live show health store more stuff JOIN/LOGIN |
Bela Ajtai, M.D., Ph.D dentinstitute.com |
Miklós Ajtai (born 2 July 1946, Budapest, Hungary) is a computer scientist at the IBM Almaden Research Center. 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.
[edit] Selected resultsOne 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. 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, M. M. Newborn and Szemerédi Ajtai proved that a planar graph with n vertices and m edges, where m > 4n has at least m3 / 100n2 crossings. [edit] BiodataAjtai received his Ph.D. in 1976 from Eötvös Loránd University.[1] Since 1995 he has been an external member of the Hungarian Academy of Sciences. [edit] Selected papers
[edit] See also[edit] References[edit] External links
| |||||||||||||
| ↑ top of page ↑ | about thumbshots |