ACM Paris Kanellakis Theory and Practice Award
How to Nominate
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.
January 15, 2021 - End of Day, Anywhere on Earth (AoE), UTC -12
Nominations will be reviewed on the basis of the candidate’s publication of novel and solid theoretical work, how that work has translated into applications, and the impact of the theory and applications.
Nominations for the Paris Kanellakis Theory and Practice Award should be submitted using the online nomination form. Submitted materials should explain the contribution in terms understandable to a non-specialist. Each nomination involves several components:
- Name, address, phone number, and email address of nominator (person making the nomination). The most appropriate person to submit a nomination would be a recognized member of the community who is not from the same organization as the candidate and who can address the candidate’s impact on the broader community.
- Name, address, and email address of the candidate (person being nominated). It is ACM’s policy not to tell candidates who has nominated or endorsed them.
- Suggested citation if the candidate is selected. This should be a concise statement (maximum of 25 words) describing the key technical or professional accomplishment for which the candidate merits this award. Note that the final wording for awardees will be at the discretion of the Award Committee.
- Nomination statement (200-750 words in length) addressing why the candidate should receive this award. This may describe the candidate’s work in general, but should draw particular attention to the contributions that merit the award.
- Copy of the candidate’s CV, listing publications, patents, honors, service contributions, etc.
- Supporting letters from at least 3, and not more than 7, endorsers. Endorsers should be chosen to represent a range of perspectives and institutions and provide additional insights or evidence of the candidate’s impact. Each letter must include the name, address, and telephone number of the endorser, and should focus on the accomplishments which that endorser can attest to and place in context. The nominator should collect the letters and bundle them for submission.
ACM Queue’s “Research for Practice” serves up expert-curated guides to the best of computing research, and relates these breakthroughs to the challenges that software engineers face every day. This installment, “The DevOps Phenomenon” by Anna Wiedemann, Nicole Forsgren, Manuel Wiesche, Heiko Gewald and Helmut Krcmar, gives an overview of stories from across the industry about software organizations overcoming early hurdles of adopting DevOps practices, and coming out on the other side with tighter integration between software and operations teams, faster delivery times for new software features, and achieving higher levels of stability.
Why I Belong to ACM
Hear from Bryan Cantrill, vice president of engineering at Joyent, Ben Fried chief information officer at Google, and Theo Schlossnagle, OmniTI founder on why they are members of ACM.
Written by leading domain experts for software engineers, ACM Case Studies provide an in-depth look at how software teams overcome specific challenges by implementing new technologies, adopting new practices, or a combination of both. Often through first-hand accounts, these pieces explore what the challenges were, the tools and techniques that were used to combat them, and the solution that was achieved.