• Mario Szegedy

Mario Szegedy has won the "Test of Time" award for the annual IEEEFoundations of Computer Science (FOCS) conference, for his 1991 paper"Approximating Clique is Almost NP-Complete"