Mario Szegedy

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.[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).

Mario Szegedy
BornOctober 23, 1960 (1960-10-23) (age 62)
NationalityHungarian-American
Alma materUniversity of Chicago
AwardsGödel Prize (2001, 2005)
Scientific career
FieldsComputer Science
InstitutionsRutgers University
Doctoral advisorLászló Babai, Janos Simon

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] His work on streaming was also recognized by the 2019 Paris Kanellakis Theory and Practice Award.[3]

He is married and has two daughters.

References
  1. Mario Szegedy at the Mathematics Genealogy Project
  2. Gödel Prize website with list of winners Archived October 7, 2016, at Archive-It
  3. "ACM announces recipients of three prestigious technical awards for 2019".
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.