- Mario Szegedy
-
Mario Szegedy 
Residence 
U.S.Fields Computer Science Institutions Rutgers University Alma mater University of Chicago Doctoral advisor László Babai, Janos Simon Mario Szegedy (born October 23, 1960) is a Hungarian 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 Fellowship (Postdoctoral) 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]
References
External links
Gödel Prize laureates Babai / Goldwasser / Micali / Moran / Rackoff (1993) · Håstad (1994) · Immerman / Szelepcsényi (1995) · Jerrum / Sinclair (1996) · Halpern / Moses (1997) · Toda (1998) · Shor (1999) · Vardi / Wolper (2000) · Arora / Feige / Goldwasser / Lund / Lovász / Motwani / Safra / Sudan / Szegedy (2001) · Sénizergues (2002) · Freund / Schapire (2003) · Herlihy / Saks / Shavit / Zaharoglou (2004) · Alon / Matias / Szegedy (2005) · Agrawal / Kayal / Saxena (2006) · Razborov / Rudich (2007) · Teng / Spielman (2008) · Reingold / Vadhan / Wigderson (2009) · Arora / Mitchell (2010) · Håstad (2011)
Categories:- American academics
- 1960 births
- Living people
- Hungarian emigrants to the United States
- Hungarian computer scientists
- Hungarian mathematicians
- Gödel Prize laureates
- Rutgers University faculty
- University of Chicago alumni
- Theoretical computer scientists
Wikimedia Foundation. 2010.
