Mario Szegedy received his Ph.D. in computer science in 1989 from the University of Chicago. He worked in 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. He has joined Alibaba Quantum Laboratory in 2018, January.
Szegedy's research areas include computational complexity theory and quantum computing. In computational complexity he is known for characterizing in-approximability of combinatorial optimization problems with a group of researchers. Another major result of his was inventing data streaming algorithms for devices with limited storage. In quantum computing his research areas include quantum algorithms, quantum query complexity and quantum walks. There is a quantum walk operator named after him.
Szegedy was awarded the Gödel Prize twice, in 2001 and 2005, for his works on probabilistically checkable proofs and on the space complexity of approximating the frequency moments in streamed data.