ACM Paris Kanellakis Theory and Practice Award

<!DOCTYPE html> <html lang="en" class=" no-js"> <head>  <script data-cookieconsent="ignore"> window.dataLayer = window.dataLayer || []; function gtag(){ dataLayer.push(arguments); } gtag("consent", "default", { ad_storage: "denied", analytics_storage: "denied", functionality_storage: "denied", personalization_storage: "denied", security_storage: "granted", wait_for_update: 500 }); gtag("set", "ads_data_redaction", true); gtag("set", "url_passthrough", false); </script>   <script data-cookieconsent="ignore"> (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-5BVDRXH'); </script>   <script id="Cookiebot" src="https://consent.cookiebot.com/uc.js" data-cbid="9bb7fc8b-05a2-4292-85e6-45213b19c5ff" data-blockingmode="auto" type="text/javascript" ></script>  <meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> <meta charset="utf-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge"> <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1, user-scalable=no"/> <link rel="stylesheet" href="/css/acm.css?antiCache=1741611205408" type="text/css"/> <link rel="stylesheet" href="/css/print.css?antiCache=1741611205408" type="text/css" media="print"/> <script type="text/javascript" src="/js/classList.js"></script> <script type="text/javascript" src="/js/webfontloader.js"></script> <script type="text/javascript" src="/js/analytics.js?="></script> <script data-cookieconsent="ignore" type="text/javascript" src="/js/modernizr.js"></script> <link rel="shortcut icon" href="/catalog/favicon.ico?v=10"> <meta class="foundation-data-attribute-namespace"> <meta class="foundation-mq-xxlarge"> <meta class="foundation-mq-xlarge-only"> <meta class="foundation-mq-xlarge"> <meta class="foundation-mq-large-only"> <meta class="foundation-mq-large"> <meta class="foundation-mq-medium-only"> <meta class="foundation-mq-medium"> <meta class="foundation-mq-small-only"> <meta class="foundation-mq-small"> <meta class="foundation-mq-topbar"> <title>ACM Paris Kanellakis Theory and Practice Award</title> <meta property="og:title" content="Contributors to Algorithm Engineering Receive Kanellakis Award"/> <meta name="description" content="Information about ACM Paris Kanellakis Theory and Practice Award"/> <meta property="og:description" content="Guy E. Blelloch, Carnegie Mellon University; Laxman Dhulipala, University of Maryland; and Julian Shun, Massachusetts Institute of Technology, receive the ACM Paris Kanellakis Theory and Practice Award for contributions to algorithm engineering, including the Ligra, GBBS, and Aspen frameworks which revolutionized large-scale graph processing on shared-memory machines."/> <meta property="og:type" content="website"/> <meta property="og:image" content="https://awards.acm.org/binaries/content/gallery/acm/ctas/awards/kanellakis-2023.jpg"/> <meta name="twitter:card" content="summary_large_image"/> <meta name="twitter:site" content="@theofficialacm"/> <meta name="twitter:title" content="Contributors to Algorithm Engineering Receive Kanellakis Award"/> <meta name="twitter:description" content="For contributions to algorithm engineering, including the Ligra, GBBS, and Aspen frameworks"/> <meta name="twitter:image" content="https://awards.acm.org/binaries/content/gallery/acm/ctas/awards/kanellakis-2023.jpg"/> <meta property="og:url" content="https://awards.acm.org/xpages/kanellakis/index"/>  <script async src="https://www.googletagmanager.com/gtag/js?id=AW-968097012"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'AW-968097012'); </script>  <script async src="https://www.googletagmanager.com/gtag/js?id=AW-968097012"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('set', 'linker', { 'domains': ['acm.org/','cvent.com/'], 'accept_incoming': true }); gtag('js', new Date()); gtag('config', 'AW-968097012'); </script><script>(function(w,d,t,r,u){var f,n,i;w[u]=w[u]||[],f=function(){var o={ti:"97170212", enableAutoSpaTracking: true};o.q=w[u],w[u]=new UET(o),w[u].push("pageLoad")},n=d.createElement(t),n.src=r,n.async=1,n.onload=n.onreadystatechange=function(){var s=this.readyState;s&&s!=="loaded"&&s!=="complete"||(f(),n.onload=n.onreadystatechange=null)},i=d.getElementsByTagName(t)[0],i.parentNode.insertBefore(n,i)})(window,document,"script","//bat.bing.com/bat.js","uetq");</script></head> <body>  <noscript><iframe data-cookieblock-src="https://www.googletagmanager.com/ns.html?id=GTM-5BVDRXH" data-cookieconsent="marketing" height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript>  <div id="header" class="row"> <nav class="top-bar eyebrow show-for-medium-up" data-topbar data-options="is_hover: false"> <section class="top-bar-section"> <div id="skiptocontent"><a href="#SkipTarget">skip to main content</a></div> <ul class="right"> <li><a href="https://www.acm.org" title="ACM Home">ACM Home</a></li> <li><a href="http://amturing.acm.org" title="ACM A.M. Turing Award">ACM A.M. Turing Award</a></li> <li><a href="http://www.acm.org/turing-award-50" title="Turing 50">Turing 50</a></li> <li><a href="http://dl.acm.org" title="Digital Library">Digital Library</a></li> <li><a href="http://cacm.acm.org" title="CACM">CACM</a></li> <li><a href="http://queue.acm.org" title="Queue">Queue</a></li> <li><a href="http://technews.acm.org" title="TechNews">TechNews</a></li> </ul> </section> </nav> <div class="clearfix utilities-area"> <div class="logo-section"> <div class="navbar-header show-for-large-up"> <a class="navbar-brand" href="https://www.acm.org"> <img alt="ACM Logo" class="img-responsive" title="Home" src="/binaries/content/gallery/global/top-menu/acm_logo_tablet.svg"> </a> </div> <div class="navbar-header hide-for-large-up"> <a href=""> <img alt="ACM Logo" class="img-responsive hide-for-large-up" title="Home" src="/binaries/content/gallery/global/top-menu/acm_logo_mobile.svg"> </a> </div> </div> <div id="acm-description" class="column large-5 show-for-large-up"> <div> ACM recognizes excellence </div> </div> <div id="ctas-and-search" class="column large-5 medium-6 no-pad-left ctas-and-search"> <ul class="block-grid right"> <li><a href="/">Home</a></li> <li><a href="/award-recipients">Award Recipients</a></li> <li><a href="/contact-us">Contact Us</a></li> <li class="hide-for-small"> <form class="acm-search-form" id="form_1"> <label for="input_1"> <span class="visually-hidden">Search Input</span> </label> <input type="text" name="q" id="input_1" class="acm-searchbox-input st-default-search-input"/> <label for="search-site_1" class="toggle"> <span class="visually-hidden">Search Submit</span> <i class="fa fa-search left"></i> <input type="button" class="acm-searchbox-submit left" value="Search" name="search-site_1" id="search-site_1" /> </label> </form> </li> </ul> </div> </div> <script type="text/javascript"> (function(w,d,t,u,n,s,e){w['SwiftypeObject']=n;w[n]=w[n]||function(){ (w[n].q=w[n].q||[]).push(arguments);};s=d.createElement(t); e=d.getElementsByTagName(t)[0];s.async=1;s.src=u;e.parentNode.insertBefore(s,e); })(window,document,'script','//s.swiftypecdn.com/install/v2/st.js','_st'); _st('install','RXEmTxVGH--uT5UYK-Dy','2.0.0'); </script> <nav class="top-bar main-nav" data-topbar data-options="is_hover: false"> <ul class="title-area"> <li class="toggle-topbar menu-icon"><a href="#"><span></span> </a></li> </ul> <section id="mobile-nav-topbar" class="top-bar-section"> <div class="mobile-links"> <div class="btn-group"> <a class="btn btn-primary" role="button" href="/">Home</a> <a class="btn btn-primary" role="button" href="/award-recipients">Award Recipients</a> <a class="btn btn-primary" role="button" href="/contact-us">Contact Us</a> </div> <div class="mobile-search"> <form class="acm-search-form" id="mobile_form_1"> <i class="fa fa-search left"></i> <label class="" for="search_mobile_1">Search</label> <input type="text" id="search_mobile_1" class="acm-searchbox-input st-default-search-input" name="q"/> </form> </div> </div> <ul> <li class="has-dropdown not-click"><a href="#">ACM Awards</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/" class="first">Awards Home</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/about/turing-laureates-spotlight" title="Spotlight on Turing Laureates" >Spotlight on Turing Laureates</a></li> <li><a href="/turing" title="ACM A.M. Turing Award" >ACM A.M. Turing Award</a></li> <li><a href="/acm-prize" title="ACM Prize in Computing" >ACM Prize in Computing</a></li> <li><a href="/thacker" title="ACM Charles P. "Chuck" Thacker Breakthrough in Computing Award" >ACM Charles P. "Chuck" Thacker Breakthrough in Computing Award</a></li> <li><a href="/allen" title="ACM Frances E. Allen Award" >ACM Frances E. Allen Award</a></li> <li><a href="/barroso" title="ACM Luiz André Barroso Award" >ACM Luiz André Barroso Award</a></li> <li><a href="/distinguished-service" title="ACM Distinguished Service Award" >ACM Distinguished Service Award</a></li> <li><a href="/doctoral-dissertation" title="ACM Doctoral Dissertation Award" >ACM Doctoral Dissertation Award</a></li> <li><a href="/eckert-mauchly" title="ACM-IEEE CS Eckert-Mauchly Award" >ACM-IEEE CS Eckert-Mauchly Award</a></li> <li><a href="/hopper" title="ACM Grace Murray Hopper Award" >ACM Grace Murray Hopper Award</a></li> <li><a href="/bell" title="ACM Gordon Bell Prize" >ACM Gordon Bell Prize</a></li> <li><a href="/bell-climate" title="ACM Gordon Bell Prize for Climate Modelling" >ACM Gordon Bell Prize for Climate Modelling</a></li> <li><a href="international-science-and-engineering-fair" title="International Science and Engineering Fair" >International Science and Engineering Fair</a></li> <li><a href="/kanellakis" title="ACM Paris Kanellakis Theory and Practice Award" >ACM Paris Kanellakis Theory and Practice Award</a></li> <li><a href="/karlstrom" title="ACM Karl V. Karlstrom Outstanding Educator Award" >ACM Karl V. Karlstrom Outstanding Educator Award</a></li> <li><a href="/kennedy" title="ACM-IEEE CS Ken Kennedy Award" >ACM-IEEE CS Ken Kennedy Award</a></li> <li><a href="/lawler" title="ACM Eugene L. Lawler Award" >ACM Eugene L. Lawler Award</a></li> <li><a href="/hpc-fellows" title="ACM-IEEE CS George Michael Memorial HPC Fellowships" >ACM-IEEE CS George Michael Memorial HPC Fellowships</a></li> <li><a href="/newell" title="ACM AAAI Allen Newell Award" >ACM AAAI Allen Newell Award</a></li> <li><a href="/outstanding-contribution" title="Outstanding Contribution to ACM Award" >Outstanding Contribution to ACM Award</a></li> <li><a href="/policy" title="ACM Policy Award" >ACM Policy Award</a></li> <li><a href="/president" title="ACM Presidential Award" >ACM Presidential Award</a></li> <li><a href="/computational-science" title="SIAM/ACM Prize in Computational Science and Engineering" >SIAM/ACM Prize in Computational Science and Engineering</a></li> <li><a href="/software-system" title="ACM Software System Award" >ACM Software System Award</a></li> <li><a href="/athena" title="ACM Athena Lecturer Award" >ACM Athena Lecturer Award</a></li> <li><a href="/cutler-bell" title="ACM/CSTA Cutler-Bell Prize for High School Computing" >ACM/CSTA Cutler-Bell Prize for High School Computing</a></li> <li><a href="/sponsors" title="Sponsors of ACM Awards" >Sponsors of ACM Awards</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">About ACM Awards</p> <h2 id="h-GivingCreditwhereCreditIsDue" style="color: rgb(51, 51, 51); text-align: left;">Giving Credit where Credit Is Due</h2> <div class="clearfix" style="color: rgb(51, 51, 51); line-height: 20.8px; text-align: left;"> <p>ACM recognizes excellence through its eminent awards for technical and professional achievements and contributions in computer science and information technology. It also names as Fellows and Distinguished Members those members who, in addition to professional accomplishments, have made significant contributions to ACM's mission. ACM awards recognize achievements by young computing professionals, educators, theoretical computer scientists, software systems innovators, and pioneers who have made humanitarian and cross-discipline contributions.</p> </div></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://awards.acm.org/about/2024-turing' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/turing-2024-barto-sutton.jpg" alt="2024 ACM A.M. Turing Award recipients Andrew G. Barto and Richard S. Sutton"></a><div class="cta-text"> <a href='https://awards.acm.org/about/2024-turing' target='_blank'>Andrew Barto and Richard Sutton Receive 2024 ACM A.M. Turing Award</a></div> </div> <div class="infonav__ctaList-cta"> <a href='https://awards.acm.org/about/2024-acm-prize' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/people/torsten-hoefler-acm-prize.jpg" alt="2024 ACM Prize recipient Torsten Hoefler"></a><div class="cta-text"> <a href='https://awards.acm.org/about/2024-acm-prize' target='_blank'>Torsten Hoefler Receives 2024 ACM Prize in Computing</a></div> </div> <div class="infonav__ctaList-cta"> <a href='https://awards.acm.org/about/2024-barroso' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/people/rachid-guerraoui.jpg" alt="2023 ACM Fran Allen Award Recipient Margaret Martonosi"></a><div class="cta-text"> <a href='https://awards.acm.org/about/2024-barroso' target='_blank'>Rachid Guerraoui Receives 2024 ACM Barroso Award</a></div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Advanced Member Grades</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/advanced-member-grades" class="first">Advanced Grades of Membership</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/fellows" title="ACM Fellows" >ACM Fellows</a></li> <li><a href="/distinguished-members" title="ACM Distinguished Members" >ACM Distinguished Members</a></li> <li><a href="/senior-members" title="ACM Senior Members" >ACM Senior Members</a></li> <li><a href="/fellows/faq" title="ACM Fellows FAQ" >ACM Fellows FAQ</a></li> <li><a href="/distinguished-members/faq" title="ACM Distinguished Members FAQ" >ACM Distinguished Members FAQ</a></li> <li><a href="/senior-members/faq" title="ACM Senior Members FAQ" >ACM Senior Members FAQ</a></li> <li><a href="/fellows/committee" title="ACM Fellows Committee" >ACM Fellows Committee</a></li> <li><a href="/distinguished-members/committee" title="ACM Distinguished Member Committee" >ACM Distinguished Member Committee</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">ACM Advanced Grades of Membership</p> <p>The ACM <span style="color: rgb(51, 51, 51); line-height: 20.8px; text-align: left;">Advanced Grades of Membership program </span>recognizes the achievements of ACM members through all stages of their career.</p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://www.acm.org/media-center/2024/january/fellows-2023' ><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-fellows-member-badge.jpg" alt="acm-fellows-member-badge.jpg"></a><div class="cta-text"> <a href='https://www.acm.org/media-center/2024/january/fellows-2023' >ACM Names 2023 Fellows</a></div> </div> <div class="infonav__ctaList-cta"> <a href='https://www.acm.org/articles/bulletins/2024/january/distinguished-2023' ><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-distinguished-member-badge.jpg" alt="acm-distinguished-member-badge.jpg"></a><div class="cta-text"> <a href='https://www.acm.org/articles/bulletins/2024/january/distinguished-2023' >ACM Names 2023 Distinguished Members</a></div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">SIG Awards</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/sig-awards" class="first">About SIG Awards</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/sig-awards/sigaccess" title="SIGACCESS" >SIGACCESS</a></li> <li><a href="/sig-awards/sigact" title="SIGACT" >SIGACT</a></li> <li><a href="/sig-awards/sigada" title="SIGAda" >SIGAda</a></li> <li><a href="/sig-awards/sigai" title="SIGAI" >SIGAI</a></li> <li><a href="/sig-awards/sigapp" title="SIGAPP" >SIGAPP</a></li> <li><a href="/sig-awards/sigarch" title="SIGARCH" >SIGARCH</a></li> <li><a href="/sig-awards/sigbed" title="SIGBED" >SIGBED</a></li> <li><a href="/sig-awards/sigbio" title="SIGBio" >SIGBio</a></li> <li><a href="/sig-awards/sigcas" title="SIGCAS" >SIGCAS</a></li> <li><a href="/sig-awards/sigchi" title="SIGCHI" >SIGCHI</a></li> <li><a href="/sig-awards/sigcomm" title="SIGCOMM" >SIGCOMM</a></li> <li><a href="/sig-awards/sigcse" title="SIGCSE" >SIGCSE</a></li> <li><a href="/sig-awards/sigda" title="SIGDA" >SIGDA</a></li> <li><a href="/sig-awards/sigdoc" title="SIGDOC" >SIGDOC</a></li> <li><a href="/sig-awards/sigecom" title="SIGEcom" >SIGEcom</a></li> <li><a href="/sig-awards/sigevo" title="SIGEVO" >SIGEVO</a></li> <li><a href="/sig-awards/sigir" title="SIGIR" >SIGIR</a></li> <li><a href="/sig-awards/siggraph" title="SIGGRAPH" >SIGGRAPH</a></li> <li><a href="/sig-awards/sighpc" title="SIGHPC" >SIGHPC</a></li> <li><a href="/sig-awards/sigkdd" title="SIGKDD" >SIGKDD</a></li> <li><a href="/sig-awards/siglog" title="SIGLOG" >SIGLOG</a></li> <li><a href="/sig-awards/sigmetrics" title="SIGMETRICS" >SIGMETRICS</a></li> <li><a href="/sig-awards/sigmicro" title="SIGMICRO" >SIGMICRO</a></li> <li><a href="/sig-awards/sigmis" title="SIGMIS" >SIGMIS</a></li> <li><a href="/sig-awards/sigmm" title="SIGMM" >SIGMM</a></li> <li><a href="/sig-awards/sigmobile" title="SIGMOBILE" >SIGMOBILE</a></li> <li><a href="/sig-awards/sigmod" title="SIGMOD" >SIGMOD</a></li> <li><a href="/sig-awards/sigops" title="SIGOPS" >SIGOPS</a></li> <li><a href="/sig-awards/sigplan" title="SIGPLAN" >SIGPLAN</a></li> <li><a href="/sig-awards/sigsac" title="SIGSAC" >SIGSAC</a></li> <li><a href="/sig-awards/sigsam" title="SIGSAM" >SIGSAM</a></li> <li><a href="/sig-awards/sigsim" title="SIGSIM" >SIGSIM</a></li> <li><a href="/sig-awards/sigsoft" title="SIGSOFT" >SIGSOFT</a></li> <li><a href="/sig-awards/siguccs" title="SIGUCCS" >SIGUCCS</a></li> <li><a href="/sig-awards/sigweb" title="SIGWEB" >SIGWEB</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">About SIG Awards</p> <p><span style="color: rgb(34, 34, 34); font-family: Verdana; font-size: 14px; line-height: 16.8px; text-align: start;">ACM's Special Interest Groups (SIGs) regularly cite outstanding individuals for their contributions in more than 30 distinct technological fields.</span></p></div> </li> <li class="infonav__ctaList"> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Regional Awards</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/regional-awards" class="first">About Regional Awards</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/india-doctoral-dissertation" title="ACM India Doctoral Dissertation" >ACM India Doctoral Dissertation</a></li> <li><a href="/acm-india-ecr" title="ACM India Early Career Researcher" >ACM India Early Career Researcher</a></li> <li><a href="/acm-india-occw" title="ACM India Outstanding Contributions in Computing by a Woman" >ACM India Outstanding Contributions in Computing by a Woman</a></li> <li><a href="/acm-india-occe" title="ACM India Outstanding Contribution to Computing Education" >ACM India Outstanding Contribution to Computing Education</a></li> <li><a href="/ipsj-acm-global" title="IPSJ/ACM Award for Early Career Contributions to Global Research" >IPSJ/ACM Award for Early Career Contributions to Global Research</a></li> <li><a href="/ccf-acm-ai" title="CCF-ACM Award for Artificial Intelligence" >CCF-ACM Award for Artificial Intelligence</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">About ACM Regional Awards</p> <p>ACM recognizes the contributions of individuals working primarily within specific regions of the world through awards given by its regional councils, and through partnerships with international societies.</p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://www.acm.org/articles/acm-india-bulletins/2025/ecr-award-2024' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/india-ecr-2024.jpg" alt="Dr. Arkaprava Basu and Dr. Sayan Ranu"></a><div class="cta-text"> <a href='https://www.acm.org/articles/acm-india-bulletins/2025/ecr-award-2024' target='_blank'>ACM India ECR 2024 Award</a></div> </div> <div class="infonav__ctaList-cta"> <a href='https://www.acm.org/articles/acm-india-bulletins/2025/kapoor-occw-2024' ><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/people/hemangee-kapoor-occw.jpg" alt="Prof. Hemangee Kapoor"></a><div class="cta-text"> <a href='https://www.acm.org/articles/acm-india-bulletins/2025/kapoor-occw-2024' >ACM India OCCW 2024 Award</a></div> </div> <div class="infonav__ctaList-cta"> <a href='https://www.acm.org/articles/acm-india-bulletins/2024/occe-award-2024' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/people/meenakshi-dsouza-poa.jpg" alt="OCCE 2024 award recipient Meenakshi D'Souza"></a><div class="cta-text"> <a href='https://www.acm.org/articles/acm-india-bulletins/2024/occe-award-2024' target='_blank'>ACM India OCCE 2024 Award</a></div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Nominations</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/award-nominations" class="first">Award Nominations</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/turing/nominations" title="ACM A.M. Turing Award" >ACM A.M. Turing Award</a></li> <li><a href="/acm-prize/nominations" title="ACM Prize in Computing" >ACM Prize in Computing</a></li> <li><a href="/thacker/nominations" title="ACM Charles P. "Chuck" Thacker Breakthrough in Computing Award" >ACM Charles P. "Chuck" Thacker Breakthrough in Computing Award</a></li> <li><a href="/fran-allen-nominations" title="ACM Frances E. Allen Award" >ACM Frances E. Allen Award</a></li> <li><a href="/barroso/nominations" title="ACM Luiz André Barroso Award" >ACM Luiz André Barroso Award</a></li> <li><a href="/distinguished-service/nominations" title="ACM Distinguished Service Award" >ACM Distinguished Service Award</a></li> <li><a href="/doctoral-dissertation/nominations" title="ACM Doctoral Dissertation Award" >ACM Doctoral Dissertation Award</a></li> <li><a href="/eckert-mauchly/nominations" title="ACM-IEEE CS Eckert-Mauchly Award" >ACM-IEEE CS Eckert-Mauchly Award</a></li> <li><a href="/bell/nominations" title="ACM Gordon Bell Prize" >ACM Gordon Bell Prize</a></li> <li><a href="/hopper/nominations" title="ACM Grace Murray Hopper Award" >ACM Grace Murray Hopper Award</a></li> <li><a href="/kanellakis/nominations" title="ACM Paris Kanellakis Theory and Practice Award" >ACM Paris Kanellakis Theory and Practice Award</a></li> <li><a href="/karlstrom/nominations" title="ACM Karl V. Karlstrom Outstanding Educator Award" >ACM Karl V. Karlstrom Outstanding Educator Award</a></li> <li><a href="/kennedy/nominations" title="ACM-IEEE CS Ken Kennedy Award" >ACM-IEEE CS Ken Kennedy Award</a></li> <li><a href="/lawler/nominations" title="ACM Eugene L. Lawler Award" >ACM Eugene L. Lawler Award</a></li> <li><a href="/hpc-fellows/nominations" title="ACM-IEEE CS George Michael Memorial HPC Fellowships" >ACM-IEEE CS George Michael Memorial HPC Fellowships</a></li> <li><a href="/outstanding-contribution/nominations" title="Outstanding Contribution to ACM Award" >Outstanding Contribution to ACM Award</a></li> <li><a href="/newell/nominations" title="ACM AAAI Allen Newell Award" >ACM AAAI Allen Newell Award</a></li> <li><a href="/policy/nominations" title="ACM Policy Award" >ACM Policy Award</a></li> <li><a href="/computational-science/nominations" title="SIAM/ACM Prize in Computational Science and Engineering" >SIAM/ACM Prize in Computational Science and Engineering</a></li> <li><a href="/software-system/nominations" title="ACM Software System Award" >ACM Software System Award</a></li> <li><a href="/athena/nominations" title="ACM Athena Lecturer Award" >ACM Athena Lecturer Award</a></li> <li><a href="/cutler-bell/nominations" title="ACM/CSTA Cutler-Bell Prize in High School Computing" >ACM/CSTA Cutler-Bell Prize in High School Computing</a></li> <li><a href="/fellows/nominations" title="ACM Fellows" >ACM Fellows</a></li> <li><a href="/distinguished-members/nominations" title="ACM Distinguished Members" >ACM Distinguished Members</a></li> <li><a href="/senior-members/nominations" title="ACM Senior Members" >ACM Senior Members</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">Awards Nominating Process</p> <h2 id="h-GivingCreditwhereCreditIsDue">How to Nominate</h2> <p>Award nominations deadlines occur throughout the year, with a heavy concentration in January. Please refer to the Nomination Process page for each award, which includes not only information about the deadline but also guidance for preparing each type of nomination.  ACM's <a href="/conflict-of-interest">conflict-of-interest guidelines</a> apply to all award nominations.</p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-w-rising-star-award.jpg" alt="acm-w-rising-star-award.jpg"></a><div class="cta-text"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'>Call for ACM-W Rising Star Award Nominations</a></div> </div> <div class="infonav__ctaList-cta"> <a href='/policy-for-honors' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/og-awards.jpg" alt="og-awards.jpg"></a><div class="cta-text"> <a href='/policy-for-honors' target='_blank'>ACM Honors & Ethics</a></div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Honors and Ethics</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/policy-for-honors" class="first">Policy for Honors Conferred by ACM</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/policies-and-procedures" title="Policies and Procedures for Honors Conferred by ACM" >Policies and Procedures for Honors Conferred by ACM</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">ACM Honors and Ethics</p> <p> ACM formally recognizes individuals for significant contributions to the field, ACM, or its interests. ACM expects individuals it honors to abide by the ACM Code of Ethics and Professional Conduct. Learn about ACM's policies and procedures for integrating expectations of ethical behaviour and ACM Awards. </p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-w-rising-star-award.jpg" alt="acm-w-rising-star-award.jpg"></a><div class="cta-text"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'>Call for ACM-W Rising Star Award Nominations</a></div> </div> <div class="infonav__ctaList-cta"> <a href='/policy-for-honors' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/og-awards.jpg" alt="og-awards.jpg"></a><div class="cta-text"> <a href='/policy-for-honors' target='_blank'>ACM Honors & Ethics</a></div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Awards Committees</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/committees" class="first">ACM Awards Committee</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/turing/committee" title="ACM A.M. Turing Award Committee" >ACM A.M. Turing Award Committee</a></li> <li><a href="/acm-prize/committee" title="ACM Prize in Computing Committee" >ACM Prize in Computing Committee</a></li> <li><a href="/thacker/committee" title="ACM Charles P. "Chuck" Thacker Breakthrough in Computing Committee" >ACM Charles P. "Chuck" Thacker Breakthrough in Computing Committee</a></li> <li><a href="/allen/committee" title="ACM Frances E. Allen Award" >ACM Frances E. Allen Award</a></li> <li><a href="/distinguished-service/committee" title="ACM Distinguished Service Award Committee" >ACM Distinguished Service Award Committee</a></li> <li><a href="/doctoral-dissertation/committee" title="ACM Doctoral Dissertation Award Committee" >ACM Doctoral Dissertation Award Committee</a></li> <li><a href="/eckert-mauchly/committee" title="ACM-IEEE CS Eckert Mauchley Award Committee" >ACM-IEEE CS Eckert Mauchley Award Committee</a></li> <li><a href="/bell/committee" title="ACM Gordon Bell Prize Committee" >ACM Gordon Bell Prize Committee</a></li> <li><a href="/hopper/committee" title="ACM Grace Murray Hopper Award Committee" >ACM Grace Murray Hopper Award Committee</a></li> <li><a href="/kanellakis/committee" title="ACM Paris Kanellakis Theory and Practice Award Committee" >ACM Paris Kanellakis Theory and Practice Award Committee</a></li> <li><a href="/karlstrom/committee" title="ACM Karl V. Karlstrom Outstanding Educator Award Committee" >ACM Karl V. Karlstrom Outstanding Educator Award Committee</a></li> <li><a href="/kennedy/committee" title="ACM-IEEE CS Ken Kennedy Award Committee" >ACM-IEEE CS Ken Kennedy Award Committee</a></li> <li><a href="/lawler/committee" title="ACM Eugene L. Lawler Award Committee" >ACM Eugene L. Lawler Award Committee</a></li> <li><a href="/hpc-fellows/committee" title="ACM-IEEE CS George Michael Memorial HPC Fellowships Committee" >ACM-IEEE CS George Michael Memorial HPC Fellowships Committee</a></li> <li><a href="/newell/committee" title="ACM AAAI Allen Newell Award Committee" >ACM AAAI Allen Newell Award Committee</a></li> <li><a href="/outstanding-contribution/committee" title="Outstanding Contribution to ACM Award Committee" >Outstanding Contribution to ACM Award Committee</a></li> <li><a href="/policy/committee" title="ACM Policy Award Committee" >ACM Policy Award Committee</a></li> <li><a href="/computational-science/committee" title="SIAM/ACM Prize in Computational Science and Engineering Committee" >SIAM/ACM Prize in Computational Science and Engineering Committee</a></li> <li><a href="/software-system/committee" title="ACM Software System Award Committee" >ACM Software System Award Committee</a></li> <li><a href="/athena/committee" title="ACM Athena Lecturer Award Committee" >ACM Athena Lecturer Award Committee</a></li> <li><a href="/india-doctoral-dissertation/committee" title="ACM India Doctoral Dissertation Award Committee" >ACM India Doctoral Dissertation Award Committee</a></li> <li><a href="/fellows/committee" title="ACM Fellows Committee" >ACM Fellows Committee</a></li> <li><a href="/distinguished-members/committee" title="ACM Distinguished Member Committee" >ACM Distinguished Member Committee</a></li> <li><a href="/senior-members/committee" title="ACM Senior Member Committee" >ACM Senior Member Committee</a></li> <li><a href="/awards-committees/conflict-of-interest" title="Conflict of Interest Guidelines" >Conflict of Interest Guidelines</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">About ACM Awards Committees</p> <p>At the core of the ACM Awards program is a dedicated group of volunteers who serve on the committees of the ACM Awards to recognize individuals for their excellence in the computing fields</p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/awards-ctte-co-chairs.jpg" alt="awards-ctte-co-chairs.jpg"><div class="cta-text"> </div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Establishing an Award</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/guides" class="first">Policies and Guide for Establishing an ACM Award</a> <ul class="infonav__linkList-list clearfix"> <li><a href="http://www.acm.org/publications/policies/guidelines-best-paper-award" title="ACM Publications Board Guidelines for Establishing a Best Paper Award for ACM Periodicals" >ACM Publications Board Guidelines for Establishing a Best Paper Award for ACM Periodicals</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">Policies and Guide</p> <p>ACM welcomes proposals for the establishment of new awards, to recognize contributions based on merit, service, or for an outstanding paper.</p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-w-rising-star-award.jpg" alt="acm-w-rising-star-award.jpg"></a><div class="cta-text"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'>Call for ACM-W Rising Star Award Nominations</a></div> </div> <div class="infonav__ctaList-cta"> <a href='/policy-for-honors' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/og-awards.jpg" alt="og-awards.jpg"></a><div class="cta-text"> <a href='/policy-for-honors' target='_blank'>ACM Honors & Ethics</a></div> </div> </li> </ul> </div> </li> </ul> </section> </nav> </div> <div id="main" > <div class="banner-container"> <div> <div> <div class="acm-banner-container" style="background: url(/binaries/bannerlarge/content/gallery/acm/banners/7_awards_acm_banner.jpg) no-repeat center 0 / 130% #000;"> <div class="gradient-wrapper" style="background: url('/binaries/content/gallery/global/gradient.png') repeat-x center 0 / 130% transparent;"></div> <div class="overlay" style="background: url('/binaries/content/gallery/global/tintpattern.png') repeat 0 0;"></div> <div class="row"> <div class="columns large-12 medium-12 banner-content"> <p class="banner-heading"> <small>Specific Types of Contributions</small> ACM Paris Kanellakis Award</p> <p>Theoretical accomplishments that have had a significant, demonstrable effect on the practice of computing</p><a class="button" href="kanellakis/award-recipients" > Award Recipients</a> <a class="button" href="/kanellakis/nominations" > Nominations</a> <a class="button" href="kanellakis/committee" > Committee Members</a> </div> </div> </div> </div> </div> </div> <div class="article" id="maincontent"> <article class="has-edit-button" id="SkipTarget" tabindex="-1"> <div class="row"> <div class="columns small-12 zone-1"> <div> <div> <ul class="breadcrumbs"> <li><a href="/">Home</a></li> <li class="current"> <a href="/kanellakis">ACM Paris Kanellakis Theory and Practice Award</a> </li> </ul> </div> </div> </div> </div> <div class="row"> <div class="columns large-8 medium-8 small-12 zone-2"> <div> <div> <div class="articles"> <div class="landing"> <h1> About ACM Paris Kanellakis Theory and Practice Award</h1> <p>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.</p> <p> </p></div> </div> </div> <div> <h2> Recent Paris Kanellakis Theory and Practice Award News </h2> <div class="awards-winners__related-content"> <h3> 2023 ACM Paris Kanellakis Theory and Practice Award</h3> <div class="awards-winners__related-content-body"> <div class="video-wrapper" style="display: block;"><iframe allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen="allowfullscreen" data-cookieconsent="ignore" frameborder="0" height="315" src="https://www.youtube-nocookie.com/embed/9go_VpfSr10?si=IRA5_g31ZKhZtS76" width="560"></iframe></div> <div style="padding-top: 38px;"> <p><strong><a href="https://awards.acm.org/award-recipients/blelloch_3352499" target="_blank">Guy E. Blelloch</a>, </strong>Carnegie Mellon University; <strong><a href="https://awards.acm.org/award-recipients/dhulipala_1225466" target="_blank"> Laxman Dhulipala</a></strong>, University of Maryland; and <a href="https://awards.acm.org/award-recipients/shun_5599760" target="_blank"><strong>Julian Shun</strong></a>, Massachusetts Institute of Technology, receive the <strong><a href="https://awards.acm.org/kanellakis" target="_blank"> ACM Paris Kanellakis Theory and Practice Award</a> </strong> for contributions to algorithm engineering, including the Ligra, GBBS, and Aspen frameworks which revolutionized large-scale graph processing on shared-memory machines.</p> <p>Beginning in 2013, Blelloch, Dhulipala and Shun began to explore how to analyze huge graphs (billions of vertices and hundreds of billions of edges) on relatively inexpensive shared-memory multiprocessors. They built several frameworks (Ligra, Ligra +, Julienne, GBBS, and Aspen) that make it much easier for programmers to efficiently solve a wide variety of graph problems. They have obtained many truly outstanding results in which their provably efficient algorithms running on an inexpensive multi-core shared-memory machine are faster than any prior algorithms, even those running on much bigger and more expensive machines. Examples of such results include clustering, clique counting, and various forms of connectivity. These ideas and implementations are being used in industry to handle real-world problems and have also had tremendous impact on research in the field.</p> <p>One important upshot of this work was the paradigm-changing demonstration that shared-memory computers are an ideal platform for analyzing large graphs. At the time Ligra was first developed, the predominant approach used to analyze large graphs was distributed systems such as Pregel (developed by Google). This was overturned when, for many important large real-world graph problems, the Ligra approach turned out to be much more efficient in terms of energy, cost, and end-to-end running time.</p> <p>Their work on graph processing also allows algorithms with provable performance guarantees in the PRAM model to live up to their theoretical performance in practice. Recently, the nominees addressed the emerging setting of processing streaming graphs, which models graphs that change in real time and developed Aspen, a novel graph streaming system that uses new purely functional data structures to enable low-latency updates and snapshots on massive graph datasets.</p></div></div> </div> <div class="awards-winners__related-content"> <h3> 2022 ACM Paris Kanellakis Theory and Practice Award</h3> <div class="awards-winners__related-content-body"> <div class="video-wrapper" style="display: block;"><iframe allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen="allowfullscreen" data-cookieconsent="ignore" frameborder="0" height="315" src="https://www.youtube-nocookie.com/embed/rwIsn2cIC7w" width="560"></iframe></div> <div style="padding-top: 38px;"> <p><strong><a href="https://awards.acm.org/award-recipients/burrows_9434147">Michael Burrows</a>, </strong> Google; <a href="https://awards.acm.org/award-recipients/ferragina_nd16004"><strong>Paolo Ferragina</strong></a>, University of Pisa; and <a href="https://awards.acm.org/award-recipients/manzini_4219625"><strong>Giovanni Manzini</strong></a>, University of Pisa, receive the <a href="https://awards.acm.org/kanellakis"><strong>ACM Paris Kanellakis Theory and Practice Award</strong></a> for inventing the BW-transform and the FM-index that opened and influenced the field of Compressed Data Structures with fundamental impact on Data Compression and Computational Biology.</p> <p>In 1994, Michael Burrows and his late coauthor David Wheeler published their paper describing revolutionary data compression algorithm based on a reversible transformation of the input. This transformation, which became known as the “Burrows-Wheeler Transform” (BWT), was used as the core of the compressor bzip2. bzip2 achieved compression performance superior to the standard of the time.</p> <p>A few years later, Paolo Ferragina and Giovanni Manzini showed that, by orchestrating the BWT with a new set of mathematical techniques and algorithmic tools, it became possible to build a “compressed index,” later called the FM-index. Before the FM-index, it seemed unavoidable to incur a significant space penalty for achieving efficient queries. With the FM-index, Ferragina and Manzini were able to disprove this common belief. In addition to being a theoretical breakthrough, the simplicity and effectiveness of the FM-index has made it a premier indexing choice for software tools working on large collections of unstructured data, with the most impressive applications in the field of DNA alignment and Computational Biology in general.</p> <p>The introduction of the BW Transform by Burrows and Wheeler, and then the development of the FM-index by Ferragina and Manzini, have had a profound impact on the theory of algorithms and data structures with fundamental advancements—first and foremost to Data Compression and Computational Biology, but also to a number of applications in many other areas, including Databases and Information Retrieval at large.</p> </div></div> </div> <div class="awards-winners__related-content"> <h3> 2021 ACM Paris Kanellakis Theory and Practice Award</h3> <div class="awards-winners__related-content-body"> <div class="video-wrapper" style="display: block;"><iframe allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen="allowfullscreen" data-cookieconsent="ignore" frameborder="0" height="315" src="https://www.youtube-nocookie.com/embed/s-73XnQ5oug" width="560"></iframe></div> <div style="padding-top: 38px;"> <p><strong><a href="https://awards.acm.org/award_winners/blum_3732674">Avrim Blum</a></strong>, Toyota Technological Institute at Chicago; <strong><a href="https://awards.acm.org/award_winners/dinur_7594620">Irit Dinur</a></strong>, Weizmann Institute; <strong><a href="https://awards.acm.org/award_winners/dwork_5162449">Cynthia Dwork</a></strong>, Harvard University; <strong><a href="https://awards.acm.org/award_winners/mcsherry_8624197">Frank McSherry</a></strong>, Materialize Inc.; <strong><a href="https://awards.acm.org/award_winners/nissim_1629626">Kobbi Nissim</a></strong>, Georgetown University; and <strong><a href="https://awards.acm.org/award_winners/smith_9268378">Adam Davison Smith</a></strong>, Boston University, receive the ACM <strong><a href="https://awards.acm.org/kanellakis">Paris Kanellakis Theory and Practice Award</a></strong> for their fundamental contributions to the development of differential privacy.</p> <p>Differential privacy is a definition and framework for reasoning about privacy in statistical databases. While the privacy of individuals contributing to a dataset has been a long-standing concern, prior to the Kanellakis recipients’ work, computer scientists only knew how to mitigate several specific privacy attacks via a disparate set of techniques. The foundation for differential privacy emerged in the early 2000’s from several key papers. At the ACM Symposium on the Principles of Database Systems (PODS 2003) Dinur and Nissim presented a paper which showed that any technique that allows reasonably accurate answers to a large number of queries is inherently non-private.</p> <p>Later, a sequence of papers by Dwork and Nissim at the International Conference on Cryptology (Crypto 2004); as well as Blum, Dwork, McSherry, and Nissim at the ACM Symposium on the Principles of Database Systems (PODS 2005); and Dwork, McSherry, Nissim, and Smith at the Theory of Cryptology Conference (TCC 2006) further defined and studied the notion of differential privacy.</p> <p>These separate but related papers formed a definition of differential privacy which captures the kind of privacy needed in statistical settings, where individual information must be protected while still allowing for discovery of common trends. These fundamental works created a vibrant and multidisciplinary area of research, leading to practical deployments of Differential Privacy in industry and by the U.S. Census Bureau, among other applications.</p> <p>The authors also showed that their definition includes post-processing and composition properties that facilitate design, analysis, and applications of differentially private algorithms. The Laplace and the Gaussian noise mechanisms, which show differentially private analogs of statistical query learning algorithms, also grew out of the Kanellakis recipients’ work on differential privacy.</p> </div></div> </div> <div class="awards-winners__related-content"> <h3> 2020 ACM Paris Kanellakis Theory and Practice Award</h3> <div class="awards-winners__related-content-body"> <div class="video-wrapper" style="display: block;"><iframe allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen="allowfullscreen" frameborder="0" height="315" src="https://www.youtube-nocookie.com/embed/IbBm0WPo5cs" data-cookieconsent="ignore" width="560"></iframe></div> <div style="padding-top: 38px;"> <p><strong><a href="/award_winners/azar_N969196">Yossi Azar</a></strong>, Tel Aviv University; <strong><a href="/award_winners/broder_N005132">Andrei Broder</a></strong>, Google Research; <strong><a href="/award_winners/karlin_3133790">Anna Karlin</a></strong>, University of Washington; <strong><a href="/award_winners/mitzenmacher_N017376">Michael Mitzenmacher</a></strong>, Harvard University; and <strong><a href="/award_winners/upfal_5076278">Eli Upfal</a></strong>, Brown University, receive the ACM <a href="https://awards.acm.org/kanellakis"><strong>Paris Kanellakis Theory and Practice Award</strong></a> for the discovery and analysis of balanced allocations, known as the power of two choices, and their extensive applications to practice.</p> <p>Azar, Broder, Karlin, Mitzenmacher and Upfal introduced the Balanced Allocations framework, also known as the power of two choices paradigm, an elegant theoretical work that had a widespread practical impact.</p> <p>When <em>n</em> balls are thrown into <em>n</em> bins chosen uniformly at random, it is known that with high probability, the maximum load on any bin is bounded by (lg n/lg lg n) (1+o(1)). Azar, Broder, Karlin, and Upfal (STOC 1994) proved that adding a little bit of choice makes a big difference. When throwing each ball, instead of choosing one bin at random, choose two bins at random, and then place the ball in the bin with the lesser load. This minor change brings on an exponential improvement; now with high probability, the maximal load in any bin is bounded by (lg lg n/lg 2)+O(1).</p> <p>In the same work, they have shown that, if each ball has <em>d</em> choices, then the maximum load drops with high probability to (ln ln n/ ln d)+O(1). These results were greatly extended by Mitzenmacher in his 1996 PhD dissertation, where he removed the sequential setting, and developed a framework for using the power of two choices in queueing systems.</p> <p>Since bins and balls are the basic model for analyzing data structures, such as hashing or processes like load balancing of jobs in servers, it is not surprising that the power of two choices that requires only a local decision rather than global coordination has led to a wide range of practical applications. These include i-Google's web index, Akamai’s overlay routing network, and highly reliable distributed data storage systems used by Microsoft and Dropbox, which are all based on variants of the power of two choices paradigm. There are many other software systems that use balanced allocations as an important ingredient.</p> <p>The Balanced Allocations paper and the follow-up work on the power of two choices are elegant theoretical results, and their content had, and will surely continue to have, a demonstrable effect on the practice of computing.</p> </div></div> </div> <div class="awards-winners__related-content"> <h3> 2019 ACM Paris Kanellakis Theory and Practice Award</h3> <div class="awards-winners__related-content-body"> <div class="video-wrapper" style="display: block;"><iframe allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen="allowfullscreen" data-cookieconsent="ignore" frameborder="0" height="315" src="https://www.youtube-nocookie.com/embed/IbBm0WPo5cs" width="560"></iframe></div> <div style="padding-top: 38px;"> <p>ACM has named <strong><a href="/award_winners/alon_6955744" target="_blank">Noga Alon</a></strong> of Princeton University and Tel Aviv University; <strong><a href="/award_winners/gibbons_2965317" target="_blank">Phillip Gibbons</a></strong> of Carnegie Mellon University; <strong><a href="/award_winners/matias_4099198" target="_blank">Yossi Matias</a></strong> of Google and Tel Aviv University; and <strong><a href="/award_winners/szegedy_9293586" target="_blank">Mario Szegedy</a></strong> of Rutgers University recipients of the <strong>ACM Paris Kanellakis Theory and Practice Award</strong> for seminal work on the foundations of streaming algorithms and their application to large-scale data analytics.</p> <p>Alon, Gibbons, Matias and Szegedy pioneered a framework for algorithmic treatment of streaming massive datasets. Today, their sketching and streaming algorithms remain the core approach for streaming big data and constitute an entire subarea of the field of algorithms. Additionally, the concepts of sketches and synopses that they introduced are now routinely used in a variety of data analysis tasks in databases, network monitoring, usage analytics in internet products, natural language processing and machine learning.</p> <p>In their seminal paper, “<a href="https://dl.acm.org/doi/pdf/10.1145/237814.237823" target="_blank">The Space Complexity of Approximating the Frequency Moments</a>,” Alon, Matias and Szegedy laid the foundations of the analysis of data streams using limited memory. Follow-up papers, including “<a href="https://dl.acm.org/doi/pdf/10.1145/303976.303978" target="_blank">Tracking Join and Self-join Sizes in Limited Storage</a>,” by Alon, Gibbons, Matias, and Szegedy, and “<a href="https://dl.acm.org/doi/10.1145/276304.276334" target="_blank">New Sampling-Based Summary Statistics for Improving Approximate Query Answers</a>,” by Gibbons and Matias, expanded on the idea of data synopses and were instrumental in the development of the burgeoning fields of streaming and sketching algorithms. This work has been applied to query planning and processing in databases and the design of small synopses to monitor vast quantities of data generated in networks.</p> </div></div> </div> <div class="awards-winners__related-content"> <h3> 2018 ACM Paris Kanellakis Theory and Practice Award</h3> <div class="awards-winners__related-content-body"> <div class="video-wrapper" style="display: block;"><iframe allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen="allowfullscreen" frameborder="0" height="315" src="https://www.youtube-nocookie.com/embed/z2MyB47umRU" data-cookieconsent="ignore" width="560"></iframe></div> <div style="padding-top: 38px;"> <p><a href="/award_winners/pevzner_4068235"><strong>Pavel Pevzner</strong></a>, a professor at the University of California San Diego, receives the <strong>ACM Paris Kanellakis Theory and Practice Award</strong> for pioneering contributions to the theory, design and implementation of algorithms for string reconstruction and to their applications in the assembly of genomes.</p> <p>Pevzner’s research interests span the field of computational biology, and his work has been guided by tailoring algorithmic ideas to biological problems. The life sciences have been transformed by the ability to rapidly sequence and assemble genomes for organisms from existing and extant species and use these assembled genomes to answer fundamental and applied questions in biology, medicine and other sciences. Pevzner has 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. Pevzner’s algorithms underlie almost all sequence assemblers used today and were used to reconstruct the vast majority of genomic sequences available in databases.</p> <p><em>The <a href="https://awards.acm.org/kanellakis" target="_blank">ACM Paris Kanellakis Theory and Practice Award</a> 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 Computation Theory (SIGACT), Design Automation (SIGDA), Management of Data (SIGMOD), and Programming Languages (SIGPLAN), the ACM SIG Projects Fund, and individual contributions.</em></p> </div></div> </div> <div class="awards-winners__related-content"> <h3> 2017 ACM Paris Kanellakis Theory and Practice Award</h3> <div class="awards-winners__related-content-body"> <div class="video-wrapper" style="display: block;"><iframe allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen="allowfullscreen" frameborder="0" height="315" src="https://www.youtube-nocookie.com/embed/rtPEf5DTY3k" data-cookieconsent="ignore" width="560"></iframe></div> <div style="padding-top: 38px;"> <p><a href="/award_winners/shenker_3005626"><strong>Scott Shenker</strong></a> was honored for pioneering contributions to fair queueing in packet-switching networks, which had a major impact on modern practice in computer communication. Shenker’s work was fundamental to helping the internet grow from a tool used by a small community of researchers, to a staple of daily life that is used by billions of people. Since the internet was introduced, demand has grown for the ability of computer networks to transmit voice and data simultaneously. Traditionally, this was a challenge, as early networks were not designed to offer integrated services. Shenker was the first to develop the first practical fair queueing algorithm for packet-switching networks, which provided equitable access to transmission bandwidth for different grades of service quality. Many of the commercial routers that make up the internet today use Shenker’s algorithms.</p> <p>Shenker also developed a mathematical tool for rigorous network research, and introduced ideas for implementing “guaranteed” real-time services such as voice, video streaming and multicasts. Recently, Shenker has been involved in positing how to redesign the internet from the ground up. Software-defined networking (SDN) and software-defined internet architecture (SDIA) are key ideas he developed as part of these inquiries. Researchers consider SDN and SDIA invaluable concepts for mapping out how to most effectively maintain and expand the internet in the coming years.</p> <p><em>The <a href="https://awards.acm.org/kanellakis" target="_blank">ACM Paris Kanellakis Theory and Practice Award</a> 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 Computation Theory (SIGACT), Design Automation (SIGDA), Management of Data (SIGMOD), and Programming Languages (SIGPLAN), the ACM SIG Projects Fund, and individual contributions.</em></p> </div></div> </div> <div class="awards-winners__related-content"> <h3> 2016 ACM Paris Kanellakis Theory and Practice Award</h3> <div class="awards-winners__related-content-body"> <div class="video-wrapper" style="display: block;"><iframe allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen="allowfullscreen" data-cookieconsent="ignore" frameborder="0" height="315" src="https://www.youtube-nocookie.com/embed/BdOWoouCQv8" width="560"></iframe></div> <div style="padding-top: 38px;"> <p><a href="/award_winners/fiat_8021946"><strong>Amos Fiat</strong></a> and <a href="/award_winners/naor_5261987"><strong>Moni Naor</strong></a> were honored for the development of broadcast encryption and traitor tracing systems. Sending broadcast transmissions that only paid subscribers have access to is one of the most important parts of a pay TV system. A traditional challenge of sending encrypted keys to subscribers has been that the pool of subscribers is constantly changing, as are the specific package of channels each customer may be subscribing to at any time. Traditional approaches to Broadcast Encryption would require TV providers to send either very long transmissions or for subscribers to store an inordinate number of cryptographic keys. In 1993, the Israeli team of Amos Fiat and Moni Naor published their landmark paper <a href="https://pdfs.semanticscholar.org/d4bd/74e4b3007724ee0b78532d232bbbd4c3c2ef.pdf" target="_blank">Broadcast Encryption</a>, which proposed a system of broadcast encryption that was efficient, both in terms of the length of the transmissions the provider sends, and the number of keys a subscriber would need to store. Fiat and Naor’s work is widely regarded as laying the foundation of the broadcast encryption field. Their original ideas are now used by cable television and satellite radio providers to ensure that only paying subscribers can decrypt a broadcast. A form of broadcast encryption is also the standard key management system that is used to protect against the unauthorized copying of Blu-ray discs.</p> <p>Building on this work, Fiat (Tel Aviv University) and Naor (Weizmann Institute of Science) collaborated with Benny Chor to invent traitor tracing. Traitor tracing enables legal parties who leak their keys to unauthorized parties to be tracked down and identified. Traitor tracing has been an important tool in the war against piracy.</p> <p><em>The <a href="https://awards.acm.org/kanellakis" target="_blank">ACM Paris Kanellakis Theory and Practice Award</a> 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 Computation Theory (SIGACT), Design Automation (SIGDA), Management of Data (SIGMOD), and Programming Languages (SIGPLAN), the ACM SIG Projects Fund, and individual contributions.</em></p> </div></div> </div> <div class="awards-winners__related-content"> <h3> Recipient of 2015 ACM Paris Kanellakis Theory and Practice Award Announced</h3> <div class="awards-winners__related-content-body"> <p>ACM announced the recipients of four prestigious technical awards:  ACM Grace Murray Hopper Award, ACM Paris Kanellakis Theory and Practice Award, ACM-AAAI Allen Newell Award, and ACM Software System Award. These innovators were selected by their peers for making significant contributions that enable the computing field to solve real-world challenges. The awards reflect achievements in cryptography, network coding systems, computer-human interaction, and software systems. The 2015 recipients will be formally honored at the ACM Awards Banquet on June 11 in San Francisco.</p> <p><a href="/award-winners/luby_4157467">Michael Luby</a>, recipient of the <a href="/kanellakis">ACM Paris Kanellakis Theory and Practice Award</a> for groundbreaking contributions to erasure correcting codes, which are essential for improving the quality of video transmission over the Internet. An important aspect of coding theory is to ensure that it is possible to recover data at a receiver transmitted from a sender, despite the fact that errors, often occurring naturally from “noise” on a channel, can impair the transmission. In coding theory, Luby made several theoretical contributions —including, but not limited to, Tornado Codes, Fountain Codes, and LT Codes — that have led to major advances in the reliable transmission and recoverability of data across mobile, broadcast and satellite channels. His work on erasure correcting codes has had an especially significant impact on the ability to stream videos, including mobile broadcast TV channels. Luby’s contributions have been applied to military technology as well as consumer devices in both wired and wireless networks. Luby is a vice president of technology at Qualcomm Technologies, Inc., a subsidiary of Qualcomm Incorporated, and an ACM Fellow.</p></div> </div> <div class="awards-winners__related-content"> <h3> James Demmel Receives 2014 The Paris Kanellakis Theory And Practice Award</h3> <div class="awards-winners__related-content-body"> <p><a href="https://awards.acm.org/award_winners/demmel_6010135">James Demmel</a> is the recipient of the Paris Kanellakis Theory and Practice Award for his work on numerical linear algebra libraries, including LAPACK (Linear Algebra Package), a standard software library that forms part of the standard mathematical libraries for many vendors. The software and standards Demmel developed enable users to transition their computer programs to new high-performance computers without resorting to basic building blocks. His accomplishments range from creation of algorithms with rigorous mathematical foundations to hands-on development of high-quality, widely available software. Demmel is a professor of Computer Science and of Mathematics at UC Berkeley and an ACM Fellow.</p> <p><a href="/binaries/content/assets/press_releases/2014_technical_awards.pdf">Press Release</a></p></div> </div> <div class="awards-winners__related-content"> <h3> Andrei Broder, Moses Charikar, Piotr Indyk Named Recipients Of The 2012 Paris Kanellakis Theory And Practice Award</h3> <div class="awards-winners__related-content-body"> <div class="video-wrapper" style="display: block;"><iframe allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen="allowfullscreen" data-cookieconsent="ignore" frameborder="0" height="315" src="https://www.youtube-nocookie.com/embed/xu5hXQZBans" width="560"></iframe></div> <div style="padding-top: 38px;"> <p style="color: rgb(51, 51, 51); line-height: 20.8px; text-align: left;">Broder, Charikar, and Indyk were recognized for their work on algorithms that allow for quickly finding similar entries in large databases, known as locality-sensitive hashing (LSH), These algorithms can drastically reduce the computational time needed for retrieving similar items, at the cost of a small probability of failing to find the absolute closest match.  LSH has impacted fields as diverse as computer vision, databases, information retrieval, data mining, machine learning, and signal processing.</p> <p style="color: rgb(51, 51, 51); line-height: 20.8px; text-align: left;"><a href="https://awards.acm.org/award_winners/broder_N005132">Andrei Broder</a> introduced specific locality-sensitive min-hash functions, used to estimate the similarity of data sets and identify near-duplicate documents.  He is a Google Distinguished Scientist.  </p> <p style="color: rgb(51, 51, 51); line-height: 20.8px; text-align: left;"><a href="https://awards.acm.org/award_winners/indyk_2720472">Piotr Indyk</a>, with the late Rajeev Motwani, extended LSH functions to a wider range of distance functions, and applied them to design efficient approximate nearest neighbor algorithms. Indyk is a professor at MIT's Computer Science and Artificial Intelligence Lab.  </p> <p style="color: rgb(51, 51, 51); line-height: 20.8px; text-align: left;"><a href="https://awards.acm.org/award_winners/charikar_0308379">Moses Charikar</a> introduced sim-hash functions for angular distances. He is a professor of Computer Science at Princeton University.</p> </div></div> </div> </div> </div> </div> <div class="columns large-4 medium-4 small-12 zone-3"> <div> <div> <div class="articles single-cta"> <div class="two-col-alt article-block"> <div class="row" data-equalizer=""> <div class="large-12 medium-12 small-12 columns"> <div class="cta shadowed " data-equalizer-watch=""> <div class="row" style="margin: inherit;"> <div class="medium-12 columns d-table top-cta"> <div class="text-wrap"> <span class="article-category">Awards & Recognition</span> <h2 class="text-left"><a href='/about/2023-technical-awards' target='_blank'>Contributors to Algorithm Engineering Receive Kanellakis Award</a></h2> <div class="dek"> <p><strong><a href="https://awards.acm.org/award-recipients/blelloch_3352499" target="_blank">Guy E. Blelloch</a>, </strong>Carnegie Mellon University; <a href="https://awards.acm.org/award-recipients/dhulipala_1225466" target="_blank"><strong> Laxman Dhulipala</strong></a>, University of Maryland; and <a href="https://awards.acm.org/award-recipients/shun_5599760" target="_blank"><strong>Julian Shun</strong></a>, Massachusetts Institute of Technology, receive the <strong><a href="https://awards.acm.org/kanellakis" target="_blank"> ACM Paris Kanellakis Theory and Practice Award</a> </strong> for contributions to algorithm engineering, including the Ligra, GBBS, and Aspen frameworks which revolutionized large-scale graph processing on shared-memory machines. They have obtained many truly outstanding results in which their provably efficient algorithms running on an inexpensive multi-core shared-memory machine are faster than any prior algorithms, even those running on much bigger and more expensive machines. </p></div> </div> <a href='/about/2023-technical-awards' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/kanellakis-2023.jpg" alt="2023 ACM Paris Kanellakis Award recipients Guy E. Blelloch, Laxman Dhulipala, and Julian Shun" /></a></div> </div> </div></div> </div> </div> </div> </div> <div> <div class="articles single-cta"> <div class="two-col-alt article-block"> <div class="row" data-equalizer=""> <div class="large-12 medium-12 small-12 columns"> <div class="cta shadowed " data-equalizer-watch=""> <div class="row" style="margin: inherit;"> <div class="medium-12 columns d-table top-cta"> <div class="text-wrap"> <h2 class="text-left"></h2> <div class="dek"> <div> <div class="panel awards-navigation"> <h2 class="sidebar-header"><a href="/list-of-awards">Full List of ACM Awards</a></h2> </div> </div></div> </div> </div> </div> </div></div> </div> </div> </div> </div> <div> <div class="panel awards-navigation"> <h2 class="sidebar-header">ACM Awards by Category</h2> <div class="data-list"> <dl class="awards-navigation__accordion accordion" data-accordion> <dd class="accordion-navigation"> <a href="#awards_9_0" class="awards-navigation__link"> <h3>Career-Long Contributions</h3> </a> <div id="awards_9_0" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/turing">ACM A.M. Turing Award</a> <hr> <a class="awards-navigation__link" href="/distinguished-service">ACM Distinguished Service Award</a> <hr> <a class="awards-navigation__link" href="/fellows">ACM Fellows</a> </div> </dd> <dd class="accordion-navigation"> <a href="#awards_9_1" class="awards-navigation__link"> <h3>Early-to-Mid-Career Contributions</h3> </a> <div id="awards_9_1" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/hopper">ACM Grace Murray Hopper Award</a> <hr> <a class="awards-navigation__link" href="/acm-prize">ACM Prize in Computing</a> <hr> <a class="awards-navigation__link" href="/distinguished-members">ACM Distinguished Member</a> <hr> <a class="awards-navigation__link" href="/senior-members">ACM Senior Member</a> </div> </dd> <dd class="accordion-navigation"> <a href="#awards_9_2" class="awards-navigation__link"> <h3>Specific Types of Contributions</h3> </a> <div id="awards_9_2" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/thacker">ACM Charles P. "Chuck" Thacker Breakthrough in Computing Award</a> <hr> <a class="awards-navigation__link" href="/lawler">ACM Eugene L. Lawler Award for Humanitarian Contributions within Computer Science and Informatics</a> <hr> <a class="awards-navigation__link" href="/allen">ACM Frances E. Allen Award for Outstanding Mentoring</a> <hr> <a class="awards-navigation__link" href="/bell">ACM Gordon Bell Prize</a> <hr> <a class="awards-navigation__link" href="/bell-climate">ACM Gordon Bell Prize for Climate Modeling</a> <hr> <a class="awards-navigation__link" href="/barroso">ACM Luiz André Barroso Award</a> <hr> <a class="awards-navigation__link" href="/karlstrom">ACM Karl V. Karlstrom Outstanding Educator Award</a> <hr> <a class="awards-navigation__link" href="/kanellakis">ACM Paris Kanellakis Theory and Practice Award</a> <hr> <a class="awards-navigation__link" href="/policy">ACM Policy Award</a> <hr> <a class="awards-navigation__link" href="/president">ACM Presidential Award</a> <hr> <a class="awards-navigation__link" href="/software-system">ACM Software System Award</a> <hr> <a class="awards-navigation__link" href="/athena">ACM Athena Lecturer Award</a> <hr> <a class="awards-navigation__link" href="/newell">ACM AAAI Allen Newell Award</a> <hr> <a class="awards-navigation__link" href="/eckert-mauchly">ACM-IEEE CS Eckert-Mauchly Award</a> <hr> <a class="awards-navigation__link" href="/kennedy">ACM-IEEE CS Ken Kennedy Award</a> <hr> <a class="awards-navigation__link" href="/outstanding-contribution">Outstanding Contribution to ACM Award</a> <hr> <a class="awards-navigation__link" href="/computational-science">SIAM/ACM Prize in Computational Science and Engineering</a> <hr> <a class="awards-navigation__link" href="/programming-systems-and-languages-paper">ACM Programming Systems and Languages Paper Award</a> </div> </dd> <dd class="accordion-navigation"> <a href="#awards_9_3" class="awards-navigation__link"> <h3>Student Contributions</h3> </a> <div id="awards_9_3" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/doctoral-dissertation">ACM Doctoral Dissertation Award</a> <hr> <a class="awards-navigation__link" href="/hpc-fellows">ACM-IEEE CS George Michael Memorial HPC Fellowships</a> <hr> <a class="awards-navigation__link" href="/cutler-bell">ACM/CSTA Cutler-Bell Prize in High School Computing</a> <hr> <a class="awards-navigation__link" href="/international-science-and-engineering-fair">International Science and Engineering Fair</a> </div> </dd> <dd class="accordion-navigation"> <a href="#awards_9_4" class="awards-navigation__link"> <h3>Regional Awards</h3> </a> <div id="awards_9_4" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/india-doctoral-dissertation">ACM India Doctoral Dissertation Award</a> <hr> <a class="awards-navigation__link" href="/acm-india-ecr">ACM India Early Career Researcher Award</a> <hr> <a class="awards-navigation__link" href="/acm-india-occw">ACM India Outstanding Contributions in Computing by a Woman Award</a> <hr> <a class="awards-navigation__link" href="/acm-india-occe">ACM India Outstanding Contribution to Computing Education Award</a> <hr> <a class="awards-navigation__link" href="/ipsj-acm-global">IPSJ/ACM Award for Early Career Contributions to Global Research</a> <hr> <a class="awards-navigation__link" href="/ccf-acm-ai">CCF-ACM Award for Artificial Intelligence</a> </div> </dd> <dd class="accordion-navigation"> <a href="/sig-awards" class="awards-navigation__link--title awards-navigation__link state-disabled"> <h3>SIG Awards</h3> </a> <div id="awards_9_5" class="awards-navigation__content content"> </div> </dd> <dd class="accordion-navigation"> <a href="#awards_9_6" class="awards-navigation__link"> <h3>How Awards Are Proposed</h3> </a> <div id="awards_9_6" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/guides">Establishing an ACM Award</a> <hr> <a class="awards-navigation__link" href="https://www.acm.org/publications/policies/guidelines-best-paper-award">Establishing a Best Paper Award for ACM Periodicals</a> </div> </dd> </dl> </div> </div> </div> </div> </div> </div> <div class="row"> <div class="columns small-12 zone-4"> <div> </div> </div> </div> </article> </div> </div> <div class="row"> <footer> <nav> <div class="footer-nav"> <ul class="footer-nav-lists"> <li> About ACM</li> <li><a href="https://www.acm.org/about-acm" title="About ACM">About ACM</a></li> <li><a href="https://www.acm.org/about-acm/get-involved" title="About ACM">Volunteer</a></li> </ul> <ul class="footer-nav-lists"> <li> Membership</li> <li><a href="https://www.acm.org/membership/join-acm" title="Membership">Join ACM</a></li> <li><a href="https://www.acm.org/membership/acm-membership-renewal" title="Membership">Renew My Membership</a></li> <li><a href="https://www.acm.org/membership/membership-options" title="Membership">Membership Options</a></li> <li><a href="https://www.acm.org/membership/membership-benefits" title="Membership">Membership Benefits</a></li> <li><a href="https://www.acm.org/membership/myacm-at-a-glance" title="Membership">MyACM Sign In</a></li> </ul> <ul class="footer-nav-lists"> <li> Publications</li> <li><a href="https://www.acm.org/publications/about-publications" title="Publications">About Publications</a></li> <li><a href="https://www.acm.org/publications/digital-library" title="Publications">Digital Library</a></li> <li><a href="https://dl.acm.org/pubs.cfm" title="Publications">Submit a Paper</a></li> </ul> <ul class="footer-nav-lists"> <li> Chapters</li> <li><a href="https://www.acm.org/chapters/chapter-administrative-interface" title="Chapters">Chapter Admin Interface</a></li> <li><a href="https://www.acm.org/chapters/local-activities" title="Chapters">Chapter Activities Calendar</a></li> <li><a href="https://www.acm.org/chapters/start-chapter" title="Chapters">Start a Chapter</a></li> </ul> <ul class="footer-nav-lists"> <li> Awards</li> <li><a href="/about" title="Awards">About ACM's Awards</a></li> </ul> <ul class="footer-nav-lists"> <li> Conferences</li> <li><a href="https://www.acm.org/conferences" title="Conferences">ACM's Conferences</a></li> </ul> <ul class="footer-nav-lists"> <li> Code of Ethics</li> <li><a href="https://www.acm.org/code-of-ethics" title="Code of Ethics">ACM's Code of Ethics</a></li> <li><a href="https://www.acm.org/code-of-ethics/enforcement-procedures" title="Code of Ethics">Enforcement Procedures</a></li> </ul> <ul class="footer-nav-lists"> <li> Media Center</li> <li><a href="https://www.acm.org/media-center" title="Media Center">ACM Media Center</a></li> </ul> </div> </nav> <div> <div> <div class="logo_social_group"> <hr /> <img src='/binaries/content/gallery/acm/logos/logo_footer_acm.png' alt='ACM Logo' /> <ul class="footer__social"> <li> <a href="https://www.facebook.com/AssociationForComputingMachinery/" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_facebook.png" alt="Facebook logo" /> </a> </li> <li> <a href="https://twitter.com/theofficialacm" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_x_twitter.png" alt="Twitter logo" /> </a> </li> <li> <a href="https://www.linkedin.com/company/association-for-computing-machinery" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_linkedin.png" alt="LinkedIn logo" /> </a> </li> <li> <a href="https://www.reddit.com/user/TheOfficialACM" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_reddit.png" alt="Reddit" /> </a> </li> <li> <a href="https://www.youtube.com/user/TheOfficialACM" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_youtube.png" alt="YouTube logo" /> </a> </li> <li> <a href="https://www.instagram.com/theofficialacm/" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_instagram.png" alt="Instagram" /> </a> </li> <li> <a href="https://www.flickr.com/photos/theofficialacm" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_flickr.png" alt="Flickr" /> </a> </li> <li> <a href="https://mastodon.acm.org/@ACM" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_mastodon.png" alt="Mastodon" /> </a> </li> <li> <a href="https://bsky.app/profile/acm.org" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_bluesky.png" alt="Bluesky" /> </a> </li> <li> <a href="/cdn-cgi/l/email-protection#99f8faf4f1fcf5e9d9f8faf4b7f6ebfe" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_mail.png" alt="Email" /> </a> </li> </ul> </div> </div> </div> <div> <div> <ul class="footer__legal clearfix"> <li><a href="/">Home</a></li> <li><a href="/sitemap">Sitemap</a></li> <li><a href="https://www.acm.org/about-acm/contact-us">Contact Us</a></li> <li><a href="https://www.acm.org/membership/acm-hq-contact">Member Service</a></li> <li><a href="https://www.acm.org/about-acm/privacy-policy">Privacy Policy</a></li> <li><a href="https://www.acm.org/accessibility">Accessibility</a></li> <li><a href="https://www.acm.org/cookie-declaration">Cookie Declaration</a></li> <li class="footer__copyright">Copyright © 2025, ACM, Inc</li> </ul> </div> </div> </footer> </div>  <script data-cfasync="false" src="/cdn-cgi/scripts/5c5dd728/cloudflare-static/email-decode.min.js"></script><script data-cookieconsent="ignore" type="text/javascript" src="/js/acm.js?antiCache=1741611205408"></script> <script>$(document).foundation();</script> <script type="text/javascript" src="//s7.addthis.com/js/300/addthis_widget.js#pubid=ra-5654b74db1437702" async="async"></script> <script async src="https://www.googletagmanager.com/gtag/js?id=G-CM2RT513Q1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){ dataLayer.push(arguments); } gtag('js', new Date()); gtag('config', 'G-CM2RT513Q1'); </script> </body> </html>

CINXE.COM

ACM Paris Kanellakis Theory and Practice Award