Dijkstra Prize

from Wikipedia, the free encyclopedia

The Dijkstra Prize is a computer science prize. It is awarded for outstanding work in distributed computing . It has been named in honor of Edsger W. Dijkstra since 2003 after his death (2002) and was previously called the PODC Influential Paper Award , presented by the ACM Symposium on Principles of Distributed Computing (PODC). Since 2007 it has also been awarded by the International Symposium on Distributed Computing (DISC) together with the European Association for Theoretical Computer Science (EATCS ). It is endowed with 2000 dollars and is awarded annually alternately at the meetings of the PODC or the DISC.

Award winners

  • 2000 Leslie Lamport for Time, clocks and the ordering of events in distributed systems , Communications of the ACM, Volume 21, 1978, p. 558
  • 2001 Michael J. Fischer , Nancy A. Lynch , Michael S. Paterson for Impossibility of Distributed Consensus with One Faulty Process , Journal of the ACM, Volume 32, 1985, p. 374
  • 2002 Edsger W. Dijkstra for Self-stabilizing systems in spite of distributed control , Communications of the ACM, Volume 17, 1974, p. 643
  • 2003 Maurice Herlihy for Wait-Free Synchronization , ACM Transactions on Programming Languages ​​and Systems, Volume 13, 1991, pp. 124-149
  • 2004 Robert G. Gallager , Pierre A. Humblet , Philip M. Spira for A Distributed Algorithm for Minimum-Weight Spanning Trees , ACM Transactions on Programming Languages ​​and Systems, Volume 5, 1983, pp. 66-77
  • 2005 Marshall Pease , Robert Shostak , Leslie Lamport for Reaching agreement in the presence of faults , Journal of the ACM, Volume 27, 1980, p. 228 (Byzantine Agreement Problem)
  • 2006 John M. Mellor-Crummey , Michael L. Scott for Algorithms for scalable synchronization on shared-memory multiprocessors , ACM Transactions on Computer Systems, Volume 9, 1991, p. 21
  • 2007 Cynthia Dwork , Nancy A. Lynch , Larry Stockmeyer for Consensus in the presence of partial synchrony , Journal of the ACM, Volume 35, 1988, pp. 288-323
  • 2008 Baruch Awerbuch , David Peleg for Sparse partitions , Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS), 1990, p. 503
  • 2009 Joseph Halpern , Yoram Moses for Knowledge and Common Knowledge in a Distributed Environment , Journal of the ACM, Volume 37, 1990, p. 549
  • 2010 Tushar D. Chandra , Vassos Hadzilacos , Sam Toueg for Unreliable Failure Detectors for Reliable Distributed Systems , Journal of the ACM, Volume 43, 1996, pp. 225–267, The Weakest Failure Detector for Solving Consensus , ibid, p. 685– 722
  • 2011 Hagit Attiya , Amotz Bar-Noy and Danny Dolev for Sharing Memory Robustly in Message-Passing Systems , Journal of the ACM, Volume 42, 1995, pp. 124-142
  • 2012 Maurice Herlihy , Eliot Moss , Nir Shavit , Dan Touitou for Herlihy, Moss Transactional Memory: Architectural Support for Lock-Free Data Structures , Proceedings of the 20th Annual International Symposium on Computer Architecture, 1993, pp. 289-300, and Shavit, Touitou Software Transactional Memory , Distributed Computing, Volume 10, 1997, pp. 99-116, February 1997 (and Proc. 14th Annual ACM Symp. On Principles of Distributed Computing, August 1995, pp. 204-213).
  • 2013 Nati Linial for Locality in Distributed Graph Algorithms. SIAM Journal on Computing, Volume 21, 1992, pp. 193-201
  • 2014 Kanianthra Mani Chandy and Leslie Lamport for Distributed Snapshots: Determining Global States of Distributed Systems. ACM Transactions on Computer Systems, Vol. 3, 1985, pp. 63-75
  • 2015
    • Michael Ben-Or for Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. Proceedings of the Second ACM Symposium on Principles of Distributed Computing, pp. 27-30, August 1983
    • Michael O. Rabin for Randomized Byzantine Generals. Proceedings of Twenty-Fourth IEEE Annual Symposium on Foundations of Computer Science, pp. 403-409, November 1983
  • 2016
    • Noga Alon , László Babai , Alon Itai for A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. Journal of Algorithms, 7 (4): 567-583, 1986
    • Michael Luby for Simple Parallel Algorithm for the Maximal Independent Set Problem. Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC), pp. 1-10, May 1985, and SIAM Journal on Computing, 15 (4): 1036-1053, 1986
  • 2017 Elizabeth Borowsky , Eli Gafni for Generalized FLP impossibility result for t-resilient asynchronous computations. Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC 93), pp. 91-100, May 1993
  • 2018 Bowen Alpern , Fred B. Schneider for defining liveness . Information Processing Letters 21 (4), October 1985, pp. 181-185
  • 2019 Alessandro Panconesi , Aravind Srinivasan for Randomized Distributed Edge Coloring via an Extension of the Chernoff – Hoeffding Bounds . SIAM Journal on Computing, 26 (2), 1997, pp. 350-36
  • 2020 Dana Angluin , James Aspnes , Zoe Diamadi , Michael J. Fischer , Rene Peralta for Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18 (4), 2006, pp. 235-253

Web links