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.
This article has been tagged since January 2007.

This article or section does not adequately cite its references or sources.
Please help improve this article by adding citations to reliable sources. (help, get involved!)
Any unsourced material that has been or is likely to be challenged may be removed at any time.
This article has been tagged since 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 from the University of Chicago.

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.