Mario Szegedy
Mario Szegedy | |
|---|---|
 | |
| Born | October 23, 1960 (age 61) |
| Nationality | Hungarian-American |
| Alma mater | University of Chicago |
| Awards | Gödel Prize (2001, 2005) |
| Scientific career | |
| Fields | Computer Science |
| Institutions | Rutgers University |
| Doctoral advisor | László Babai, Janos Simon |
Mario Szegedy (born October 23, 1960) is a Hungarian-American computer scientist, professor of computer science at Rutgers University. He received his Ph.D. in computer science in 1989 from the University of Chicago.[1] He held a Lady Davis Postdoctoral Fellowship at the Hebrew University, Jerusalem (1989–90), a postdoc at the University of Chicago, 1991–92, and a postdoc at Bell Laboratories (1992).
Szegedy's research areas include computational complexity theory and quantum computing.
He was awarded the Gödel Prize twice, in 2001 and 2005, for his work on probabilistically checkable proofs and on the space complexity of approximating the frequency moments in streamed data.[2] His work on streaming was also recognized by the 2019 Paris Kanellakis Theory and Practice Award.[3]
He is married and has two daughters.
References[]
- ^ Mario Szegedy at the Mathematics Genealogy Project
- ^ Gödel Prize website with list of winners Archived October 7, 2016, at Archive-It
- ^ "ACM announces recipients of three prestigious technical awards for 2019".
External links[]
Authority control: Scientific databases  |
|---|
- 1960 births
- Living people
- Hungarian emigrants to the United States
- Hungarian computer scientists
- 20th-century Hungarian mathematicians
- 21st-century Hungarian mathematicians
- Gödel Prize laureates
- Rutgers University faculty
- University of Chicago alumni
- Theoretical computer scientists