ברכות לפרופ' נוגה אלון מבית הספר למדעי המחשב על זכייתו ב- Edsger W. Dijkstra Prize in Distributed Computing

The Dijkstra Prize Committee has decided to grant the 2016 Edsger W. Dijkstra Prize in Distributed Computing jointly to Noga Alon, László Babai, Alon Itai, and Michael Luby for the following two papers:

A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem by Noga Alon, László Babai, and Alon Itai, published in Journal of Algorithms, 7(4):567-583, 1986

A Simple Parallel Algorithm for the Maximal Independent Set Problem by Michael Luby, published in the Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC), pp. 1-10, May 1985, and in SIAM Journal on Computing, 15(4):1036-1053, 1986

The Prize is awarded for outstanding papers on the principles of distributed computing, whose significance and impact on the theory and/or practice of distributed computing have been evident for at least a decade.

For feature infomation please press here.