The Paris Kanellakis Theory and Practice Award honors specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing. The award is presented each June at the ACM Awards Banquet and is accompanied by a prize of $10,000 plus travel expenses to the banquet.  Financial support for the award is through an endowment provided by the Kanellakis family, with additional contributions from ACM's Special Interest Groups on Algorithms and Computational Theory (SIGACT), Design Automation (SIGDA), Management of Data (SIGMOD), and Programming Languages (SIGPLAN), as well as the ACM SIG Projects Fund and individual contributions.

Deadline: Dec. 15, 2023