Mario Szegedy

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Mario Szegedy
Mario Szegedy at Rutgers 2008.jpg
Born October 23, 1960
Residence U.S.
Nationality Hungarian-American
Fields Computer Science
Institutions Rutgers University
Alma mater University of Chicago
Doctoral advisor László Babai, Janos Simon
Notable awards Gödel Prize (2001, 2005)

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, 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 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]

References[edit]

  1. ^ Mario Szegedy at the Mathematics Genealogy Project
  2. ^ Gödel Prize website with list of winners

External links[edit]