Mario Szegedy received his PhD in computer science in 1989 from the University of Chicago. He worked at Bell Laboratories from 1991 to 1999, and after spending a year in the Princeton Institute for Advanced Studies, he became a professor of computer science at Rutgers University in 2000. Currently, he is at Aliyun Quantum Computing Research Lab. 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.