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 Automaton (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
Pavel Pevzner has been named the 2018 ACM Paris Kanellakis Theory and Practice Award recipient for pioneering contributions to the theory, design and implementation of algorithms for string reconstruction and to their applications in the assembly of genomes. He made fundamental contributions to the theoretical study of string algorithms and to their application to scalable reconstruction of genomes and other biological sequences such as antibodies and antibiotics.