Nati Linial. Locality in Distributed Graph Algorithms. SIAM Journal on Computing, 21(1), pages 193-201, 1992. See also here.
Papers I find interesting---mostly, but not solely, in Process Algebra---, and some fun stuff in Mathematics and Computer Science at large and on general issues related to research, teaching and academic life.
Wednesday, August 07, 2013
2013 Edsger W. Dijkstra Prize in Distributed Computing
This is not exactly news since the announcement of the award was made a few days ago and I heard about it already during the ICALP 2013 conference dinner. However, since I have not come across any mention of the 2013 Edsger W. Dijkstra Prize in Distributed Computing on the TCS blogs, let me "announce" that the Dijkstra Prize Committee has selected Nati Linial as the recipient of this year’s Edsger W. Dijkstra Prize in Distributed Computing. The prize is given to him for his outstanding paper
You can read the official award citation here. Congrats to Nati Linial and to the award committee for an excellent choice.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment