About ACM Paris Kanellakis Theory and Practice Award
The Paris Kanellakis Theory and Practice Award honors specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing. ThIs award is accompanied by a prize of $10,000 and is endowed by contributions from the Kanellakis family, with additional financial support provided by ACM's Special Interest Groups on Algorithms and Computational Theory (SIGACT), Design Automation (SIGDA), Management of Data (SIGMOD), and Programming Languages (SIGPLAN), the ACM SIG Projects Fund, and individual contributions.
Recent Paris Kanellakis Theory and Practice Award News
Yossi Azar, Andrei Broder, Anna Karlin, Michael Mitzenmacher, and Eli Upfal have been named 2020 ACM Paris Kanellakis Theory and Practice Award recipients for the discovery and analysis of balanced allocations, known as the power of two choices, and their extensive applications to practice. The Balanced Allocations paper and the follow-up work on the power of two choices are elegant theoretical results, and their content will continue to have a demonstrable effect on the practice of computing.