Mario Szegedy

Mario Szegedy ( born October 23, 1960) is an American computer scientist.

Szegedy in 1989 at the University of Chicago with Laszlo Babai doctorate ( Algebraic Methods in Lower Bounds for Computational Models ). As a post-doc, he was at the Hebrew University in Jerusalem, at the University of Chicago and the Bell Laboratories ( 1992), in which he was afterwards to 1999. In 1999 he was at the Institute for Advanced Study. He is a professor of computer science at Rutgers University, where he has been since 2000.

Szegedy deals with complexity theory, combinatorics, combinatorial geometry and quantum computer science ( he founded QC team, a quantum computing laboratory at Rutgers University). He twice won the Gödel Prize in 2001 for his involvement in the proof of the PCP theorem and 2005 for the complexity analysis of data streams.