April 20, 2022
By David LaRocca
Éva Tardos and David Shmoys won a 30-year Test of Time Award at the 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2021) for their paper, written with Serge Plotkin, "Fast Approximation Algorithms for Fractional Packing and Covering Problems" (1991).
Éva Tardos, the Jacob Gould Schurman Professor of Computer Science, has been elected to the American Philosophical Society, the oldest learned society in the United States.
Tardos, whose research focuses on algorithms and algorithmic game theory, is best-known for her work on network flow algorithms, approximation algorithms and quantifying the efficiency of selfish routing.