Dijkstra Prize
From Wikipedia, the free encyclopedia
The Edsger W. Dijkstra Prize is a prize for outstanding papers on the principles of distributed computing, named after Edsger W. Dijkstra. The prize is given to recognize a paper that has had significance in the theory or practice of distributed computing for at least ten years. It is awarded annually at the Association for Computing Machinery's Symposium on Principles of Distributed Computing, and a description of the winning paper's contributions is published in the proceedings of that conference.
For the first three years, the prize was called the PODC Influential Paper Award.
[edit] Winners
- 2000 - Leslie Lamport for his paper on logical clocks.
- 2001 - Michael J. Fischer, Nancy A. Lynch, Michael S. Paterson for proving the impossibility of consensus using asynchronous communication.
- 2002 - Edsger W. Dijkstra for his paper that introduced self-stabilization.
- 2003 - Maurice Herlihy for his paper on the solvability and universality of consensus in shared-memory systems.
- 2004 - R. G. Gallager, P. A. Humblet, P. M. Spira for their distributed algorithm to find a minimum spanning tree.
- 2005 - Marshal Pease, Robert Shostak, Leslie Lamport for their paper on Byzantine agreement.
- 2006 - John M. Mellor-Crummey, Michael L. Scott for their mutual exclusion algorithm.
