2019 Edsger W. Dijkstra Prize in Distributed Computing

Shlomi Dolev, Lorenzo Alvisi, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The committee decided to award the 2019 Edsger W. Dijkstra Prize in Distributed Computing to Alessandro Panconesi and Aravind Srinivasan for their paper Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds, SIAM Journal on Computing, volume 26, number 2, 1997, pages 350-368. A preliminary version of this paper appeared as Fast Randomized Algorithms for Distributed Edge Coloring, Proceedings of the Eleventh Annual ACM Symposium Principles of Distributed Computing (PODC), 1992, pages 251-262.
Original languageEnglish
Title of host publicationProceedings of the 2019 ACM Symposium on Principles of Distributed Computing
StatePublished - 16 Jul 2019


Dive into the research topics of '2019 Edsger W. Dijkstra Prize in Distributed Computing'. Together they form a unique fingerprint.

Cite this