SORT :

Name Year Citation In the ACM DL
Adleman, Leonard M. 1996 University of Southern California
Public-Key Cryptography Leonard Adleman, Whitfield Diffie, Martin Hellman, Ralph Merkle, Ronald Rivest, Adi Shamir For the conception and first effective realization of public-key cryptography. The idea of a public-key cryptosystem was a major conceptual breakthrough that continues to stimulate research to this day, and without it today's rapid growth of electronic commerce would have been impossible.
ACM DL Author Profile
Bellare, Mihir 2009 University of California, San Diego
For their development of the field of Practice-Oriented Provable-Security and its widespread impact on the theory and practice of cryptography and security.
ACM DL Author Profile
Blumofe, Robert 2013 Akamai
For contributions to efficient and robust parallel computation through both provably efficient randomized scheduling protocols and a set of parallel-language primitives constituting the Cilk framework. Implementations of these protocols and conceptual framework have been deployed on scores of millions of machines and therefore enjoy daily impact.
ACM DL Author Profile
Brayton, Robert 2006 University of California at Berkeley
For leading the development and practical realization of algorithms for logic synthesis and for electronic system simulation, thereby helping to create key enabling technologies for the Electronic Design Automation industry.
ACM DL Author Profile
Broder, Andrei 2012 Google
With Moses S Charikar and Piotr Indyk, for their groundbreaking work on Locality-Sensitive Hashing that has had great impact in many fields of computer science including computer vision, databases, information retrieval, machine learning, and signal processing.
ACM DL Author Profile
Bryant, Randal E 1998 Symbolic Model CheckingRandal E. Bryant, Edmund M. Clarke, E. Allen Emerson, Kenneth L. McMillan For their invention of symbolic model checking, a method of formally checking system designs, which is widely used in the computer hardware industry and is beginning to show significant promise also in software verification and other areas. ACM DL Author Profile
Buchberger, Bruno 2007 Johannes Kepler University
For his role in developing the theory of Groebner Bases into a highly effective tool in computer algebra, widely used in symbolic computation systems.
ACM DL Author Profile
Charikar, Moses S 2012 Princeton University
With Andrei Broder and Piotr Indyk, for their groundbreaking work on Locality-Sensitive Hashing that has had great impact in many fields of computer science including computer vision, databases, information retrieval, machine learning, and signal processing.
ACM DL Author Profile
Clarke, Edmund 1998 Carnegie Mellon University
Symbolic Model Checking Randal E. Bryant, Edmund M. Clarke, E. Allen Emerson, Kenneth L. McMillan For their invention of symbolic model checking, a method of formally checking system designs, which is widely used in the computer hardware industry and is beginning to show significant promise also in software verification and other areas.
ACM DL Author Profile
Cortes, Corinna 2008 Google Research
For the development of Support Vector Machines, a highly effective algorithm for classification and related machine learning problems.
ACM DL Author Profile
Demmel, James 2014 University of California, Berkeley
For contributions to algorithms and software for numerical linear algebra used in scientific computing and large-scale data analysis.
ACM DL Author Profile
Diffie, Whitfield 1996 Sun Microsystems
Public-Key Cryptography Leonard Adleman, Whitfield Diffie, Martin Hellman, Ralph Merkle, Ronald Rivest, Adi Shamir For the conception and first effective realization of public-key cryptography. The idea of a public-key cryptosystem was a major conceptual breakthrough that continues to stimulate research to this day, and without it today's rapid growth of electronic commerce would have been impossible.
ACM DL Author Profile
Emerson, E. Allen 1998 University of Texas at Austin
Symbolic Model Checking Randal E. Bryant, Edmund M. Clarke, E. Allen Emerson, Kenneth L. McMillan For their invention of symbolic model checking, a method of formally checking system designs, which is widely used in the computer hardware industry and is beginning to show significant promise also in software verification and other areas.
ACM DL Author Profile
Franaszek, Peter A. 2002 IBM TJ Watson Research Center
Constrained Channel Coding For contributions to the theory and practice of constrained channel coding, creating a revolution in the encoding of digital data for transmission and storage.
ACM DL Author Profile
Freund, Yoav 2004 Columbia University
Theory and Practice of Boosting Yoav Freund, Robert Schapire For the development of the theory and practice of boosting and its applications to machine learning
ACM DL Author Profile
Hellman, Martin 1996 Stanford University
Public-Key Cryptography Leonard Adleman, Whitfield Diffie, Martin Hellman, Ralph Merkle, Ronald Rivest, Adi Shamir For the conception and first effective realization of public-key cryptography. The idea of a public-key cryptosystem was a major conceptual breakthrough that continues to stimulate research to this day, and without it today's rapid growth of electronic commerce would have been impossible.
ACM DL Author Profile
Holzmann, Gerard J. 2005 NASA/JPL, Laboratory for Reliable Software
Gerard J. Holzmann, Robert P. Kurshan, Moshe Y. Vardi, Pierre Wolper For the development of automata-theoretic techniques for reactive-systems verification, and the practical realization of powerful formal-verification tools based on these techniques.
ACM DL Author Profile
Indyk, Piotr 2012 MIT  CSAIL
With Andrei Broder and Moses S Charikar, for their groundbreaking work on Locality-Sensitive Hashing that has had great impact in many fields of computer science including computer vision, databases, information retrieval, machine learning, and signal processing.
ACM DL Author Profile
Karmarkar, Narendra 2000 Tata InstituteTata Institute
Interior Point For his theoretical work in devising an Interior Point method for linear programming that provably runs in polynomial time, and for his implementation work suggesting that Interior Point methods could be effective for linear programming in practice as well as theory. Together, these contributions inspired a renaissance in the theory and practice of linear programming, leading to orders of magnitude improvement in the effectiveness of widely-used commercial optimization codes.
ACM DL Author Profile
Kurshan, Robert P. 2005 Cadence Design Systems
Gerard J. Holzmann, Robert P. Kurshan, Moshe Y. Vardi, Pierre Wolper For the development of automata-theoretic techniques for reactive-systems verification, and the practical realization of powerful formal-verification tools based on these techniques.
ACM DL Author Profile
Leiserson, Charles E 2013 Massachusetts Institute of Technology
For contributions to efficient and robust parallel computation through both provably efficient randomized scheduling protocols and a set of parallel-language primitives constituting the Cilk framework. Implementations of these protocols and conceptual framework have been deployed on scores of millions of machines and therefore enjoy daily impact.
ACM DL Author Profile
Lempel, Abraham 1997 Technion - Israel Institute of Technology
Hewlett-Packard Laboratories - Israel

Data Compression Abraham Lempel, Jacob Ziv For their pioneering work in data compression.
ACM DL Author Profile
Luby, Michael George 2015 For ground-breaking contributions to erasure correcting codes, which are essential for improving the quality of video transmission over the Internet. ACM DL Author Profile
McMillan, Kenneth L. 1998 Cadence Berkeley Labs
Symbolic Model Checking Randal E. Bryant, Edmund M. Clarke, E. Allen Emerson, Kenneth L. McMillan For their invention of symbolic model checking, a method of formally checking system designs, which is widely used in the computer hardware industry and is beginning to show significant promise also in software verification and other areas.
ACM DL Author Profile
Mehlhorn, Kurt 2010 Max Planck Institute
For contributions to algorithm engineering by creating the LEDA library for algorithmic problem solving.
ACM DL Author Profile
Merkle, Ralph 1996 Xerox
Public-Key Cryptography Leonard Adleman, Whitfield Diffie, Martin Hellman, Ralph Merkle, Ronald Rivest, Adi Shamir For the conception and first effective realization of public-key cryptography. The idea of a public-key cryptosystem was a major conceptual breakthrough that continues to stimulate research to this day, and without it today's rapid growth of electronic commerce would have been impossible.
ACM DL Author Profile
Miller, Gary L 2003 Carnegie Mellon University
Development of efficient randomized tests of primality Gary Miller, Michael Rabin, Robert Solovay, Volker Strassen For the development of efficient randomized tests of primality, enabling the practical realization of public key cryptography and demonstrating the power of randomized algorithms.
ACM DL Author Profile
Myers, Eugene 2001 University of Arizona/Celera Genomics
BLAST For distinguished contributions to the theory of sequence analysis and its application to the sequencing of the human genome and the development of BLAST, the most widely used software tool in genomics.
ACM DL Author Profile
Rabin, Michael O. 2003 Harvard University
Development of efficient randomized tests of primalityGary Miller, Michael Rabin, Robert Solovay, Volker Strassen For the development of efficient randomized tests of primality, enabling the practical realization of public key cryptography and demonstrating the power of randomized algorithms.
ACM DL Author Profile
Rivest, Ronald L 1996 Massachussetts Institute of Technology
Public-Key Cryptography Leonard Adleman, Whitfield Diffie, Martin Hellman, Ralph Merkle, Ronald Rivest, Adi Shamir For the conception and first effective realization of public-key cryptography. The idea of a public-key cryptosystem was a major conceptual breakthrough that continues to stimulate research to this day, and without it today's rapid growth of electronic commerce would have been impossible.
ACM DL Author Profile
Rogaway, Phillip 2009 University of California, Davis
For their development of the field of Practice-Oriented Provable-Security and its widespread impact on the theory and practice of cryptography and security.
ACM DL Author Profile
Samet, Hanan 2011 University of Maryland
For fundamental contributions to the development of multidimensional spatial data structures and indexing.
ACM DL Author Profile
Schapire, Robert 2004 Columbia University
Theory and practice of boosting Yoav Freund, Robert Schapire For the development of the theory and practice of boosting and its applications to machine learning.
ACM DL Author Profile
Shamir, Adi 1996 Weizmann Indtitute of Science
Public-Key Cryptography Leonard Adleman, Whitfield Diffie, Martin Hellman, Ralph Merkle, Ronald Rivest, Adi Shamir For the conception and first effective realization of public-key cryptography. The idea of a public-key cryptosystem was a major conceptual breakthrough that continues to stimulate research to this day, and without it today's rapid growth of electronic commerce would have been impossible.
ACM DL Author Profile
Sleator, Daniel 1999 Carnegie Mellon University
Splay Tree Data Structure Daniel D.K. Sleator and Robert E. Tarjan For their invention of the widely-used Splay Tree data s tructure.
ACM DL Author Profile
Solovay, Robert 2003 University of California at Berkeley
Development of efficient randomized tests of primality Gary Miller, Michael Rabin, Robert Solovay, Volker Strassen For the development of efficient randomized tests of primality, enabling the practical realization of public key cryptography and demonstrating the power of randomized algorithms.
ACM DL Author Profile
Strassen, Volker 2003 University of Konstanz Germany
Development of efficient randomized tests of primality Gary Miller, Michael Rabin, Robert Solovay, Volker Strassen For the development of efficient randomized tests of primality, enabling the practical realization of public key cryptography and demonstrating the power of randomized algorithms.
ACM DL Author Profile
Tarjan, Robert E 1999 Rinceton University/InterTrust Technologies Corp.
Splay Tree Data Structure Daniel D.K. Sleator and Robert E. Tarjan For their invention of the widely-used Splay Tree data structure.
ACM DL Author Profile
Vapnik, Vladimir 2008 Fellow of NEC Laboratories/Columbia University
For the development of Support Vector Machines, a highly effective algorithm for classification and related machine learning problems.
ACM DL Author Profile
Vardi, Moshe Y 2005 Rice University
Gerard J. Holzmann, Robert P. Kurshan, Moshe Y. Vardi, Pierre WolperFor the development of automata-theoretic techniques for reactive-systems verification, and the practical realization of powerful formal-verification tools based on these techniques.
ACM DL Author Profile
Wolper, Pierre 2005 University of Liege, Belgium
Gerard J. Holzmann, Robert P. Kurshan, Moshe Y. Vardi, Pierre Wolper For the development of automata-theoretic techniques for reactive-systems verification, and the practical realization of powerful formal-verification tools based on these techniques.
ACM DL Author Profile
Ziv, Jacob 1997 Technion - Israel Institute of Technology
Israel National Academy of Science and the Humanities

Data Compression Abraham Lempel, Jacob Ziv For their pioneering work in data compression.
ACM DL Author Profile