Miklós Ajtai
From Wikipedia, the free encyclopedia
Miklós Ajtai (born July 2, 1946 in 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. Komlos and Endre Szemerédi), exponential lower bounds, superlinear time-space tradeoffs for branching programs, and other "unique and spectacular" results.
Ajtai received his Ph.D. in 1976 from Eötvös Loránd University.[1] He is an external member of the Hungarian Academy of Sciences.
[edit] References
[edit] External links
 |
This biographical article relating to a computer specialist is a stub. You can help Wikipedia by expanding it. |
| Persondata | |
|---|---|
| NAME | Ajtai, Miklós |
| ALTERNATIVE NAMES | |
| SHORT DESCRIPTION | Computer scientist |
| DATE OF BIRTH | |
| PLACE OF BIRTH | |
| DATE OF DEATH | |
| PLACE OF DEATH | |
