Dijkstra Prize

The Dijkstra Prize is a computer science prize. It is awarded for outstanding work in 's Distributed Computing ( Distributed Computing ). It is named in honor of Edsger W. Dijkstra in 2003 after his death (2002) and was previously called PODC Influential Paper Award, awarded by the ACM Symposium on Principles of Distributed Computing ( PODC ). Since 2007 he is also awarded along with the European Association for Theoretical Computer Science ( EATCS ) from the International Symposium on Distributed Computing ( DISC). It is endowed with $ 2,000 and will be awarded annually, alternating at the meetings of the PODC or DISC.

Award winners

  • Leslie Lamport in 2000 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, Impossibility of Distributed Consensus with One Faulty of Process, Journal of the ACM, Volume 32, 1985, p 374
  • Edsger W. Dijkstra in 2002 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 multi- processors, ACM Transactions on Computer Systems, Volume 9, 1991, p 21
  • 2007 Cynthia Dwork, Nancy A. Lynch, Larry Stockmeyer, Consensus in the presence of partial synchrony of, Journal of the ACM, Volume 35, 1988, pp. 288-323
  • 2008 Baruch Awerbuch, David Peleg, Sparse partitions, Proceedings of the 31st Annual Symposium on Foundations of Computer Science ( FOCS ), 1990, pp. 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 Unreliable Failure Detectors for Reliable Distributed Systems for, Journal of the ACM, Volume 43, 1996, pp. 225-267, The Weakest Failure Detector for Solving Consensus, ibid, pp. 685 - 722
  • Hagit Attiya 2011, 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
Association for Computing Machinery Nancy Lynch Mike Paterson
240149
de