Mario Szegedy

From Wikipedia, the free encyclopedia

Please help improve this article or section by expanding it. Further information might be found on the talk page or at requests for expansion. (January 2007)

Mario Szegedy (b. 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]

Szegedy's research areas include 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.

[edit] References

1. ^ Mario Szegedy at the Mathematics Genealogy Project

[edit] External links

• Home page

v • d • e 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 / Shapire (2003) · Herlihy / Saks / Shavit / Zaharoglou (2004) · Alon / Matias / Szegedy (2005) · Agrawal / Kayal / Saxena (2006) · Razborov / Rudich (2007)