Mario Szegedy is a Hungarian-born computer scientist, professor of computer science at Rutgers University. He received his Ph.D. in computer science from the University of Chicago.

Szegedy's research areas include complexity theory, combinatorics 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.