Dijkstra Prize: Difference between revisions

Content deleted Content added

Inline

Revision as of 18:51, 19 September 2020

The Edsger W. Dijkstra Paper Prize in Distributed Computing is given for outstanding papers on the principles of distributed computing, whose significance and impact on the theory and/or practice of distributed computing has been evident for at least a decade. The paper prize has been presented annually since 2000.

Originally the paper prize was presented at the ACM Symposium on Principles of Distributed Computing (PODC), and it was known as the PODC Influential-Paper Award. It was renamed in honor of Edsger W. Dijkstra in 2003, after he received the award for his work in self-stabilization in 2002 and died shortly thereafter.

Since 2007,^[1] the paper prize is sponsored jointly by PODC and the EATCS International Symposium on Distributed Computing (DISC), and the presentation takes place alternately at PODC (even years) and DISC (odd years). The paper prize includes an award of $2000.

Winners

Year	Paper	Topic
2000^[2]	Lamport, L. (1978). "Time, clocks, and the ordering of events in a distributed system" (PDF). Communications of the ACM . 21 (7): 558–565. doi:10.1145/359545.359563.	ll
2001^[3]	Fischer, M. J.; Lynch, N. A.; Paterson, M. S. (1985). "Impossibility of distributed consensus with one faulty process" (PDF). Journal of the ACM. 32 (2): 374–382. doi:10.1145/3149.214121. Archived from the original (PDF) on 2007-07-05.	Proving the impossibility of consensus using asynchronous communication
2002^[4]	Dijkstra, E. W. (November 1974). "Self-stabilizing systems in spite of distributed control". Communications of the ACM. 17 (11): 643–644. doi:10.1145/361179.361202.	Self-stabilization
2003^[5]	Herlihy, M. (1991). "Wait-free synchronization". ACM Transactions on Programming Languages and Systems. 13 (1): 124–149. CiteSeerX 10.1.1.56.5659. doi:10.1145/114005.102808. Maurice Herlihy	Solvability and universality of consensus in shared-memory systems
2004^[6]	Gallager, R. G.; Humblet, P. A.; Spira, P. M. (1983). "A Distributed Algorithm for Minimum-Weight Spanning Trees". ACM Transactions on Programming Languages and Systems. 5 (1): 66–77. doi:10.1145/357195.357200.	Distributed algorithm to find a minimum spanning tree
2005^[7]	Pease, M.; Shostak, R.; Lamport, L. (April 1980). "Reaching Agreement in the Presence of Faults". Journal of the ACM. 27 (2): 228–234. CiteSeerX 10.1.1.68.4044. doi:10.1145/322186.322188.	Byzantine agreement
2006^[8]	Mellor-Crummey, J. M.; Scott, M. L. (1991). "Algorithms for scalable synchronization on shared-memory multiprocessors". ACM Transactions on Computer Systems. 9 (1): 21–65. CiteSeerX 10.1.1.228.3461. doi:10.1145/103727.103729.	"probably the most influential practical mutual exclusion algorithm of all time"
2007^[9]	Dwork, C.; Lynch, N.; Stockmeyer, L. (1988). "Consensus in the presence of partial synchrony". Journal of the ACM. 35 (2): 288–323. CiteSeerX 10.1.1.13.3423. doi:10.1145/42282.42283.	Solving consensus in partially synchronous systems
2008^[10]	Awerbuch, B.; Peleg, D. (1990). "Sparse partitions". Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science. pp. 503–513. doi:10.1109/FSCS.1990.89571. ISBN 978-0-8186-2082-9.	Sparse partitions
2009^[11]	Halpern, J. Y.; Moses, Y. (1990). "Knowledge and Common Knowledge in a Distributed Environment". Journal of the ACM. 37 (3): 549–587. arXiv:cs/0006009. doi:10.1145/79147.79161.	A formal framework for reasoning about knowledge in distributed systems
2010^[12]	Chandra, T. D.; Toueg, S. (1996). "Unreliable Failure Detectors for Reliable Distributed Systems". Journal of the ACM. 43 (2): 225–267. doi:10.1145/226643.226647. hdl:1813/7192. Chandra, T. D.; Hadzilacos, V.; Toueg, S. (1996). "The Weakest Failure Detector for Solving Consensus". Journal of the ACM. 43 (4): 685–722. CiteSeerX 10.1.1.55.8585. doi:10.1145/234533.234549.	Failure detectors
2011^[13]	Attiya, H.; Bar-Noy, A.; Dolev, D. (1995). "Sharing Memory Robustly in Message-Passing Systems". Journal of the ACM. 42 (1): 124–142. doi:10.1145/200836.200869.	Simulating shared memory in fault-prone message-passing systems
2012^[14]	Herlihy, M.; Moss, J. E. B. (1993). "Transactional memory". ACM SIGARCH Computer Architecture News. 21 (2): 289–300. doi:10.1145/173682.165164. Shavit, N.; Touitou, D. (1997). "Software transactional memory". Distributed Computing. 10 (2): 99–116. CiteSeerX 10.1.1.468.7173. doi:10.1007/s004460050028.	Transactional memory
2013^[15]	Linial, N. (1992). "Locality in Distributed Graph Algorithms". SIAM Journal on Computing. 21: 193–201. CiteSeerX 10.1.1.711.689. doi:10.1137/0221015.	Locality in distributed graph algorithms
2014^[16]	Chandy, K. M.; Lamport, L. (1985). "Distributed snapshots: Determining global states of distributed systems". ACM Transactions on Computer Systems. 3: 63–75. CiteSeerX 10.1.1.69.2561. doi:10.1145/214451.214456.	The Chandy-Lamport algorithm to get a consistent picture of the global state of a system
2015^[17]	Ben-Or, M. (1983). Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. pp. 27–30. doi:10.1145/800221.806707. ISBN 978-0897911108. `{{cite book}}`: `\|journal=` ignored (help) Rabin, M. O. (1983). Randomized byzantine generals. pp. 403–409. doi:10.1109/SFCS.1983.48. ISBN 978-0-8186-0508-6. `{{cite book}}`: `\|journal=` ignored (help)	Fault-tolerant randomized distributed algorithms
2016^[18]	Alon, Noga; Babai, László; Itai, Alon (1986). "A fast and simple randomized parallel algorithm for the maximal independent set problem". Journal of Algorithms. 7 (4): 567. doi:10.1016/0196-6774(86)90019-2. and Luby, Michael (1986). "A Simple Parallel Algorithm for the Maximal Independent Set Problem". SIAM Journal on Computing. 15 (4): 1036–1053. CiteSeerX 10.1.1.225.5475. doi:10.1137/0215074.	Algorithms for finding a maximal independent set
2017^[19]	Borowsky, Elizabeth; Gafni, Eli (1993). "Generalized FLP impossibility result for t-resilient asynchronous computations". P 25th Annual ACM Symposium on Theory of Computing. ACM. pp. 91–100.	The BG Simulation Algorithm, which allows a set of processes to simulate a larger set of processes in a coordinated way
2018^[20]	Alpern, Bowen; Schneider, Fred B. (1985). "Defining liveness". Information Processing Letters Volume 21, Issue 4. pp. 181–185.	Formal definition of liveness property.
2019^[21]^[22]	Panconesi, A.; Srinivasan, A. (1997). "Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds". SIAM Journal on Computing. 26 (2): 350–368. doi:10.1137/S0097539793250767. hdl:1813/6127.	Distributed edge coloring

Funding

The award is financed by ACM PODC and EATCS DISC, each providing an equal share of $1,000 towards the $2,000 of the award.

The PODC share is financed by an endowment at ACM that is based on gifts from the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), the ACM Special Interest Group on Operating Systems (SIGOPS), the AT&T Corporation, the Hewlett-Packard Company, the International Business Machines (IBM) Corporation, the Intel Corporation, and Sun Microsystems, Inc.
The DISC share is financed by an endowment at EATCS that is based on contributions from several year's DISC budgets, and gifts from Microsoft Research, the Universidad Rey Juan Carlos and the Spanish Ministry of Science and Innovation.

References

^ Hendler, Danny (Jan 25, 2005). "Edsger W. Dijkstra Prize in Distributed Computing: Early call for paper nominations". Archived from the original on 2010-06-24.
–"Call for Nominations: 2006 Edsger W. Dijkstra Prize in Distributed Computing – PODC Influential Paper Award". 25th Annual ACM SIGACT-SIGOPS Symposium on Principles Of Distributed Computing (PODC 2006) July 23-26, 2006, Denver, Colorado, USA.
–Andrzej Pelc (ed.). Distributed Computing. 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007. doi:10.1007/978-3-540-75142-7.
–"Dijkstra Prize 2007". www2.cs.ucy.ac.cy.
^ "PODC Influential Paper Award: 2000", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-10
^ "PODC Influential Paper Award: 2001", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-10
^ "2002 PODC Influential Paper Award", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
^ "Edsger W. Dijkstra Prize in Distributed Computing: 2003", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
^ "Edsger W. Dijkstra Prize in Distributed Computing: 2004", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
^ "Edsger W. Dijkstra Prize in Distributed Computing: 2005", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
^ "Edsger W. Dijkstra Prize in Distributed Computing: 2006", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
^ "Edsger W. Dijkstra Prize in Distributed Computing: 2007", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
^ "Edsger W. Dijkstra Prize in Distributed Computing: 2008", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
^ "2009 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
^ "2010 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
^ "2011 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
^ "2012 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
^ "2013 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
^ "2014 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-19
^ "2015 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-19
^ "2016 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
^ "2017 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
^ "2018 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
^ "2019 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-09
^ "Prof. Alessandro Panconesi won Edsger W. Dijkstra Prize in Distributed Computing". Journal of Computer and System Sciences. Elsevier B.V.

External links

EATCS web site: Awards: Dijkstra Prize.
PODC web site: Edsger W. Dijkstra Prize in Distributed Computing.
DISC web site: Edsger W. Dijkstra Prize in Distributed Computing.
Algorithms hall of fame: Rutger Dijkstra receives portrait of his father Edsger Dijkstra.
MPG eBooks on Dijkstra.

[1] Hendler, Danny (Jan 25, 2005). "Edsger W. Dijkstra Prize in Distributed Computing: Early call for paper nominations". Archived from the original on 2010-06-24.
–"Call for Nominations: 2006 Edsger W. Dijkstra Prize in Distributed Computing – PODC Influential Paper Award". 25th Annual ACM SIGACT-SIGOPS Symposium on Principles Of Distributed Computing (PODC 2006) July 23-26, 2006, Denver, Colorado, USA.
–Andrzej Pelc (ed.). Distributed Computing. 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007. doi:10.1007/978-3-540-75142-7.
–"Dijkstra Prize 2007". www2.cs.ucy.ac.cy.

[2] "PODC Influential Paper Award: 2000", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-10

[3] "PODC Influential Paper Award: 2001", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-10

[4] "2002 PODC Influential Paper Award", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30

[5] "Edsger W. Dijkstra Prize in Distributed Computing: 2003", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24

[6] "Edsger W. Dijkstra Prize in Distributed Computing: 2004", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24

[7] "Edsger W. Dijkstra Prize in Distributed Computing: 2005", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24

[8] "Edsger W. Dijkstra Prize in Distributed Computing: 2006", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24

[9] "Edsger W. Dijkstra Prize in Distributed Computing: 2007", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24

[10] "Edsger W. Dijkstra Prize in Distributed Computing: 2008", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24

[11] "2009 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30

[12] "2010 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30

[13] "2011 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30

[14] "2012 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30

[15] "2013 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30

[16] "2014 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-19

[17] "2015 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-19

[18] "2016 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30

[19] "2017 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30

[20] "2018 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30

[21] "2019 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-09

[22] "Prof. Alessandro Panconesi won Edsger W. Dijkstra Prize in Distributed Computing". Journal of Computer and System Sciences. Elsevier B.V.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

[19]

[20]

[21]

[22]

@@ Line 1: / Line 1: @@
-{{Notability|date=January 2018}}
 The '''Edsger W. Dijkstra Paper Prize in Distributed Computing''' is given for outstanding papers on the principles of [[distributed computing]], whose significance and impact on the theory and/or practice of distributed computing has been evident for at least a decade. The paper prize has been presented annually since 2000.
 Originally the paper prize was presented at the [[Association for Computing Machinery|ACM]] [[Symposium on Principles of Distributed Computing]] (PODC), and it was known as the '''PODC Influential-Paper Award'''. It was renamed in honor of [[Edsger W. Dijkstra]] in 2003, after he received the award for his work in [[self-stabilization]] in 2002 and died shortly thereafter.
-Since 2007,<ref>Calls for nominations: [https://lists.cs.columbia.edu/pipermail/tccc/2005-January/002478.html 2005] {{Webarchive|url=https://web.archive.org/web/20100624054857/https://lists.cs.columbia.edu/pipermail/tccc/2005-January/002478.html |date=2010-06-24 }}, [http://www.podc.org/podc2006/call-for-nominations.html 2006]. DISC 2007 [https://dx.doi.org/10.1007/978-3-540-75142-7 proceedings] and [http://www2.cs.ucy.ac.cy/~disc07/en_pages/Dijkstra-2007.html web site].</ref> the paper prize is sponsored jointly by PODC and the [[EATCS]] [[International Symposium on Distributed Computing]] (DISC), and the presentation takes place alternately at PODC (even years) and DISC (odd years). The paper prize includes an award of $2000.
+Since 2007,<ref>{{cite web |url=https://lists.cs.columbia.edu/pipermail/tccc/2005-January/002478.html |title=Edsger W. Dijkstra Prize in Distributed Computing: Early call for paper nominations |last=Hendler |first=Danny |date=Jan 25, 2005 |url-status=dead |archive-url=https://web.archive.org/web/20100624054857/https://lists.cs.columbia.edu/pipermail/tccc/2005-January/002478.html |archive-date=2010-06-24}}<br/>–{{cite conference |conference=25th Annual ACM SIGACT-SIGOPS Symposium on Principles Of Distributed Computing (PODC 2006) July 23-26, 2006, Denver, Colorado, USA |url=http://www.podc.org/podc2006/call-for-nominations.html |title=''"Call for Nominations: 2006 Edsger W. Dijkstra Prize in Distributed Computing – PODC Influential Paper Award"''}}<br/>–{{cite conference |book-title=Distributed Computing |doi=10.1007/978-3-540-75142-7 |conference=21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007 |editor=Andrzej Pelc}}<br/>–{{cite web |title=Dijkstra Prize 2007 |url=http://www2.cs.ucy.ac.cy/~disc07/en_pages/Dijkstra-2007.html |website=www2.cs.ucy.ac.cy}}</ref> the paper prize is sponsored jointly by PODC and the [[EATCS]] [[International Symposium on Distributed Computing]] (DISC), and the presentation takes place alternately at PODC (even years) and DISC (odd years). The paper prize includes an award of $2000.
 ==Winners==
@@ Line 13: / Line 12: @@
 ! Topic
 |-
-| 2000<ref>{{Citation | url=http://www.podc.org/influential/2000.html | title=PODC Influential Paper Award: 2000 | work=ACM Symposium on Principles of Distributed Computing | accessdate=2009-08-24 | archive-url=https://www.webcitation.org/6HyUAxRoN?url=http://www.podc.org/influential/2000-influential-paper/ | archive-date=2013-07-09 | url-status=dead }}</ref>
+| 2000<ref>{{Citation |url=http://www.podc.org/influential/2000-influential-paper/ |title=PODC Influential Paper Award: 2000 |work=ACM Symposium on Principles of Distributed Computing |accessdate=2020-09-10}}</ref>
 | {{Cite journal | last1 = Lamport | first1 = L. |authorlink1=Leslie Lamport| title = Time, clocks, and the ordering of events in a distributed system | doi = 10.1145/359545.359563 | journal = [[Communications of the ACM ]]| volume = 21 | issue = 7 | pages = 558–565| year = 1978 | url=http://research.microsoft.com/users/lamport/pubs/time-clocks.pdf}}
 |ll
 |-
-| 2001<ref>{{Citation | url=http://www.podc.org/influential/2001.html | title=PODC Influential Paper Award: 2001 | work=ACM Symposium on Principles of Distributed Computing | accessdate=2009-08-24}}</ref>
+| 2001<ref>{{Citation |url=http://www.podc.org/influential/2001-influential-paper/ |title=PODC Influential Paper Award: 2001 |work=ACM Symposium on Principles of Distributed Computing |accessdate=2020-09-10}}</ref>
 | {{Cite journal | last1 = Fischer | first1 = M. J. | authorlink1 = Michael J. Fischer | last2 = Lynch | first2 = N. A. | authorlink2 = Nancy Lynch | last3 = Paterson | first3 = M. S. | authorlink3 = Michael S. Paterson | doi = 10.1145/3149.214121 | title = Impossibility of distributed consensus with one faulty process | journal = [[Journal of the ACM]] | volume = 32 | issue = 2 | pages = 374–382 | year = 1985 | url = http://theory.lcs.mit.edu/tds/papers/Lynch/jacm85.pdf | url-status = dead | archiveurl = https://web.archive.org/web/20070705132628/http://theory.lcs.mit.edu/tds/papers/Lynch/jacm85.pdf | archivedate = 2007-07-05 }}
 | Proving the impossibility of [[consensus (computer science)|consensus]] using [[asynchronous communication]]
@@ Line 49: / Line 48: @@
 | [[Sparse partitions]]
 |-
-| 2009<ref>{{citation | url = https://www.podc.org/dijkstra/2009-dijkstra-prize/ | title = 2009 Edsger W. Dijkstra Prize in Distributed Computing | work = ACM Symposium on Principles of Distributed Computing | accessdate = 2019-09-30}}</ref>
+| 2009<ref>{{citation |url=https://www.podc.org/dijkstra/2009-dijkstra-prize/ |title=2009 Edsger W. Dijkstra Prize in Distributed Computing |work=ACM Symposium on Principles of Distributed Computing |accessdate=2019-09-30}}</ref>
 | {{Cite journal | last1 = Halpern | first1 = J. Y. |authorlink1=Joseph Halpern| last2 = Moses | first2 = Y. |authorlink2=Yoram Moses| doi = 10.1145/79147.79161 | title = Knowledge and Common Knowledge in a Distributed Environment| journal = [[Journal of the ACM]]| volume = 37 | issue = 3 | pages = 549–587 | year = 1990 | pmid =  | pmc = | arxiv = cs/0006009}}
 | A formal framework for reasoning about knowledge in distributed systems
 |-
-| 2010<ref>{{citation | url = https://www.podc.org/dijkstra/2010-dijkstra-prize/ | title = 2010 Edsger W. Dijkstra Prize in Distributed Computing | work = ACM Symposium on Principles of Distributed Computing | accessdate = 2019-09-30}}</ref>
+| 2010<ref>{{citation |url=https://www.podc.org/dijkstra/2010-dijkstra-prize/ |title=2010 Edsger W. Dijkstra Prize in Distributed Computing |work=ACM Symposium on Principles of Distributed Computing |accessdate=2019-09-30}}</ref>
 | {{Cite journal | last1 = Chandra | first1 = T. D. | last2 = Toueg | first2 = S. | doi = 10.1145/226643.226647 | title = Unreliable Failure Detectors for Reliable Distributed Systems| journal = [[Journal of the ACM]]| volume = 43 | issue = 2 | pages = 225–267| year = 1996 | hdl = 1813/7192 }}<br />{{Cite journal | last1 = Chandra | first1 = T. D. | last2 = Hadzilacos | first2 = V. | last3 = Toueg | first3 = S. | title = The Weakest Failure Detector for Solving Consensus | journal = [[Journal of the ACM]] | volume = 43 | issue = 4 | pages = 685–722 | year = 1996 | doi = 10.1145/234533.234549| citeseerx = 10.1.1.55.8585 }}
 | [[Failure detector]]s
 |-
-| 2011<ref>{{citation | url = https://www.podc.org/dijkstra/2011-dijkstra-prize/ | title = 2011 Edsger W. Dijkstra Prize in Distributed Computing | work = ACM Symposium on Principles of Distributed Computing | accessdate = 2019-09-30}}</ref>
+| 2011<ref>{{citation |url=https://www.podc.org/dijkstra/2011-dijkstra-prize/ |title=2011 Edsger W. Dijkstra Prize in Distributed Computing |work=ACM Symposium on Principles of Distributed Computing |accessdate=2019-09-30}}</ref>
 | {{Cite journal | last1 = Attiya | first1 = H. | authorlink1 = Hagit Attiya| last2 = Bar-Noy | first2 = A. | last3 = Dolev | first3 = D. |authorlink3=Danny Dolev| title = Sharing Memory Robustly in Message-Passing Systems| doi = 10.1145/200836.200869 | journal = [[Journal of the ACM]]| volume = 42| issue = 1| pages = 124–142 | year = 1995 }}
 | Simulating shared memory in fault-prone message-passing systems
 |-
-| 2012<ref>{{citation | url = https://www.podc.org/dijkstra/2012-dijkstra-prize/ | title = 2012 Edsger W. Dijkstra Prize in Distributed Computing | work = ACM Symposium on Principles of Distributed Computing | accessdate = 2019-09-30}}</ref>
+| 2012<ref>{{citation |url=https://www.podc.org/dijkstra/2012-dijkstra-prize/ |title=2012 Edsger W. Dijkstra Prize in Distributed Computing |work=ACM Symposium on Principles of Distributed Computing |accessdate=2019-09-30}}</ref>
 | {{Cite journal | last1 = Herlihy | first1 = M. | authorlink1=Maurice Herlihy| last2 = Moss | first2 = J. E. B. | authorlink2=J. Eliot B. Moss| doi = 10.1145/173682.165164 | title = Transactional memory | journal = ACM SIGARCH Computer Architecture News | volume = 21 | issue = 2 | pages = 289–300 | year = 1993 | pmid =  | pmc = }}<br />{{Cite journal | last1 = Shavit | first1 = N. | authorlink1=Nir Shavit| last2 = Touitou | first2 = D. | doi = 10.1007/s004460050028 | title = Software transactional memory | journal = Distributed Computing | volume = 10 | issue = 2 | pages = 99–116 | year = 1997 | pmid =  | pmc = | citeseerx = 10.1.1.468.7173 }}
 | [[Transactional memory]]
 |-
-| 2013<ref>{{citation | url = https://www.podc.org/dijkstra/2013-dijkstra-prize/ | title = 2013 Edsger W. Dijkstra Prize in Distributed Computing | work = ACM Symposium on Principles of Distributed Computing | accessdate = 2019-09-30}}</ref>
+| 2013<ref>{{citation |url=https://www.podc.org/dijkstra/2013-dijkstra-prize/ |title=2013 Edsger W. Dijkstra Prize in Distributed Computing |work=ACM Symposium on Principles of Distributed Computing |accessdate=2019-09-30}}</ref>
 | {{Cite journal | last1 = Linial | first1 = N. | authorlink1=Nati Linial| doi = 10.1137/0221015 | title = Locality in Distributed Graph Algorithms | journal = SIAM Journal on Computing | volume = 21 | pages = 193–201 | year = 1992 | pmid =  | pmc = | citeseerx = 10.1.1.711.689 }}
 | Locality in distributed graph algorithms
 |-
-| 2014<ref>{{Citation | url=http://www.disc-conference.org/wp/disc2014/dijkstra-prize/ | title=2014 Edsger W. Dijkstra Prize in Distributed Computing | accessdate=2014-06-17}}</ref>
+| 2014<ref>{{Citation |url=https://www.podc.org/dijkstra/2014-dijkstra-prize/ |title=2014 Edsger W. Dijkstra Prize in Distributed Computing |work=ACM Symposium on Principles of Distributed Computing |accessdate=2020-09-19}}</ref>
 | {{Cite journal | doi = 10.1145/214451.214456| title = Distributed snapshots: Determining global states of distributed systems| journal = ACM Transactions on Computer Systems| volume = 3| pages = 63–75| year = 1985| last1 = Chandy | first1 = K. M. | authorlink1=K. Mani Chandy| last2 = Lamport | first2 = L. | authorlink2=Leslie Lamport| citeseerx = 10.1.1.69.2561}}
 | The [[Chandy-Lamport algorithm]] to get a consistent picture of the global state of a system
 |-
-| 2015<ref>{{Citation | url=http://www.disc-conference.org/wp/disc2015/dijkstra-prize/ | title=The 2015 Edsger W. Dijkstra Prize in Distributed Computing | accessdate=2015-05-21}}</ref>
+| 2015<ref>{{Citation |url=https://www.podc.org/dijkstra/2015-dijkstra-prize/ |title=2015 Edsger W. Dijkstra Prize in Distributed Computing |work=ACM Symposium on Principles of Distributed Computing |accessdate=2020-09-19}}</ref>
 | {{Cite book | doi = 10.1145/800221.806707| title = Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols| journal = Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing - PODC '83| pages = 27–30| year = 1983| last1 = Ben-Or | first1 = M. | authorlink1=Michael Ben-Or| isbn = 978-0897911108}}<br />{{Cite book | doi = 10.1109/SFCS.1983.48| title = Randomized byzantine generals| journal = 24th Annual Symposium on Foundations of Computer Science (FOCS 1983)| pages = 403–409| year = 1983| last1 = Rabin | first1 = M. O. | authorlink1=Michael O. Rabin| isbn = 978-0-8186-0508-6}}
 | [[Fault tolerance|Fault-tolerant]] [[randomized algorithms|randomized]] [[distributed algorithms|distributed]] [[algorithms]]
 |-
-| 2016<ref>{{citation | url = https://www.podc.org/dijkstra/2016-dijkstra-prize/ | title = 2016 Edsger W. Dijkstra Prize in Distributed Computing | work = ACM Symposium on Principles of Distributed Computing | accessdate = 2019-09-30}}</ref>
+| 2016<ref>{{citation |url=https://www.podc.org/dijkstra/2016-dijkstra-prize/ |title=2016 Edsger W. Dijkstra Prize in Distributed Computing |work=ACM Symposium on Principles of Distributed Computing |accessdate=2019-09-30}}</ref>
 | {{Cite journal | doi = 10.1016/0196-6774(86)90019-2| title = A fast and simple randomized parallel algorithm for the maximal independent set problem| journal = Journal of Algorithms| volume = 7| issue = 4| pages = 567| year = 1986| last1 = Alon| first1 = Noga| last2 = Babai| first2 = László| last3 = Itai| first3 = Alon| authorlink1=Noga Alon|authorlink2=László Babai}} and {{Cite journal | doi = 10.1137/0215074| title = A Simple Parallel Algorithm for the Maximal Independent Set Problem| journal = SIAM Journal on Computing| volume = 15| issue = 4| pages = 1036–1053| year = 1986| last1 = Luby| first1 = Michael|authorlink1=Michael Luby| citeseerx = 10.1.1.225.5475}}
 | Algorithms for finding a [[maximal independent set]]
 |-
-| 2017<ref>{{citation | url = https://www.podc.org/dijkstra/2017-dijkstra-prize/ | title = 2017 Edsger W. Dijkstra Prize in Distributed Computing | work = ACM Symposium on Principles of Distributed Computing | accessdate = 2019-09-30}}</ref>
+| 2017<ref>{{citation |url=https://www.podc.org/dijkstra/2017-dijkstra-prize/ |title=2017 Edsger W. Dijkstra Prize in Distributed Computing |work=ACM Symposium on Principles of Distributed Computing |accessdate=2019-09-30}}</ref>
 | {{cite conference |url= |title = Generalized FLP impossibility result for t-resilient asynchronous computations|last1 = Borowsky |first1 = Elizabeth |author-link1=Elizabeth Borowsky |last2= Gafni|first2= Eli|author-link2=Eli Gafni |date=1993 |publisher=ACM |book-title=P 25th Annual ACM Symposium on Theory of Computing |pages=91–100}}
 | The BG Simulation Algorithm, which allows a set of processes to simulate a larger set of processes in a coordinated way
 |-
-| 2018<ref>{{citation | url = https://www.podc.org/dijkstra/2018-dijkstra-prize/ | title = 2018 Edsger W. Dijkstra Prize in Distributed Computing | work = ACM Symposium on Principles of Distributed Computing | accessdate = 2019-09-30}}</ref>
+| 2018<ref>{{citation |url=https://www.podc.org/dijkstra/2018-dijkstra-prize/ |title=2018 Edsger W. Dijkstra Prize in Distributed Computing |work=ACM Symposium on Principles of Distributed Computing |accessdate=2019-09-30}}</ref>
 | {{cite conference |url= |title = Defining liveness|last1 = Alpern |first1 = Bowen |author-link1=Bowen Alpern |last2= Schneider|first2= Fred B.|author-link2=Fred B. Schneider |date=1985 |book-title= Information Processing Letters Volume 21, Issue 4 |pages=181–185}}
 | Formal definition of liveness property.
 |-
-| 2019<ref>{{citation | url = https://www.podc.org/dijkstra/2019-dijkstra-prize/ | title = 2019 Edsger W. Dijkstra Prize in Distributed Computing | work = ACM Symposium on Principles of Distributed Computing | accessdate = 2019-09-09}}</ref>
+| 2019<ref>{{citation |url=https://www.podc.org/dijkstra/2019-dijkstra-prize/ |title=2019 Edsger W. Dijkstra Prize in Distributed Computing |work=ACM Symposium on Principles of Distributed Computing |accessdate=2019-09-09}}</ref><ref>{{cite news|title=Prof. Alessandro Panconesi won Edsger W. Dijkstra Prize in Distributed Computing |publisher=Elsevier B.V. |work=Journal of Computer and System Sciences |url= https://www.journals.elsevier.com/journal-of-computer-and-system-sciences/news/prof-alessandro-panconesi}}</ref>
 | {{cite journal | last1 = Panconesi | first1 = A. | authorlink1 = Alessandro Panconesi | last2 = Srinivasan | first2 = A. | authorlink2 = Aravind Srinivasan | title = Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds | doi = 10.1137/S0097539793250767 | journal = SIAM Journal on Computing | volume = 26 | issue = 2 | pages = 350–368 | year = 1997 | hdl = 1813/6127 | hdl-access = free }}
 | Distributed [[edge coloring]]
@@ Line 114: / Line 113: @@
 * [[Symposium on Principles of Distributed Computing|PODC]] web site: [http://www.podc.org/dijkstra/ Edsger W. Dijkstra Prize in Distributed Computing].
 * [[International Symposium on Distributed Computing|DISC]] web site: [https://web.archive.org/web/20080602084402/http://www.disc-conference.org/dijkstra-award.html Edsger W. Dijkstra Prize in Distributed Computing].
-* {{cite news|title=Prof. Alessandro Panconesi won Edsger W. Dijkstra Prize in Distributed Computing |publisher=Elsevier B.V. |work=Journal of Computer and System Sciences |url=https://www.journals.elsevier.com/journal-of-computer-and-system-sciences/news/prof-alessandro-panconesi}}
 * Algorithms hall of fame: [https://www.algorithmhalloffame.org/news/award-for-dijkstra/ Rutger Dijkstra receives portrait of his father Edsger Dijkstra].
 * [https://ebooks.mpdl.mpg.de/ebooks/Author/Home?author=Dijkstra%2C+Edsger+W MPG eBooks on Dijkstra].

v t e Edsger Dijkstra
Works	A Primer of ALGOL 60 Programming (book) Structured Programming (book) A Discipline of Programming (book) A Method of Programming (book) Predicate Calculus and Program Semantics (book) Selected Writings on Computing: A Personal Perspective (book) A Note on Two Problems in Connexion with Graphs Cooperating Sequential Processes Solution of a Problem in Concurrent Programming Control The Structure of the 'THE'-Multiprogramming System Go To Statement Considered Harmful Notes on Structured Programming The Humble Programmer Programming Considered as a Human Activity How Do We Tell Truths That Might Hurt? On the Role of Scientific Thought Self-stabilizing Systems in Spite of Distributed Control On the Cruelty of Really Teaching Computer Science Selected papers EWD manuscripts
Main research areas	Theoretical computing science Software engineering Systems science Algorithm design Concurrent computing Distributed computing Formal methods Programming methodology Programming language research Program design and development Software architecture Philosophy of computer programming and computing science
Related people	Shlomi Dolev Per Brinch Hansen Tony Hoare Ole-Johan Dahl Leslie Lamport David Parnas Jaap Zonneveld Carel S. Scholten Adriaan van Wijngaarden Niklaus Wirth
Wikiquote

Revision as of 18:51, 19 September 2020

Winners

Funding

See also

References

External links