Mario Szegedy

From Wikipedia, the free encyclopedia

Mario Szegedy
BornOctober 23, 1960 (1960-10-23) (age 63)
Nationality (legal)Hungarian-American
Alma materUniversity of Chicago
AwardsGödel Prize (2001, 2005)
Scientific career
FieldsComputer science
InstitutionsRutgers University
ThesisAlgebraic Methods in Lower Bounds for Computational Models (1989)
Doctoral advisorLá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 after completing his dissertation titled Algebraic Methods in Lower Bounds for Computational Models.[1] He held a Lady Davis Postdoctoral Fellowship at the Hebrew University of 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, quantum computing, computational geometry, and computational theory.[2]

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.[3] His work on streaming algorithms and the resulting data analysis was also recognized by the 2019 Paris Kanellakis Theory and Practice Award.[4] With computer scientists Uriel Feige, Shafi Goldwasser, László Lovász, and Shmuel Safra, Szegedy won the Test of Time Award at the 2021 IEEE Foundations of Computer Science Conference for their work titled Approximating Clique is Almost NP-Complete.

He is married and has two daughters.


  1. ^ Mario Szegedy at the Mathematics Genealogy Project
  2. ^ Szegedy, Mario. "Szegedy, Mario". Retrieved December 12, 2023.
  3. ^ Gödel Prize website with list of winners Archived October 7, 2016, at Archive-It
  4. ^ "ACM announces recipients of three prestigious technical awards for 2019".

External links[edit]