Prize for Innovation in Distributed Computing

The Prize for Innovation in Distributed Computing (also called SIROCCO award) is an award presented annually at the conference International Colloquium on Structural Information and Communication Complexity (SIROCCO) to a living individual (or individuals) who have made a major contribution to understanding "the relationships between information and efficiency in decentralized computing", which is main area of interest for this conference. The award recognizes innovation, in particular, it recognizes inventors of new ideas that were unorthodox and outside the mainstream at the time of their introduction. There are two restrictions for being eligible for this award: (1) The original contribution must have appeared in a publication at least five years before the year of the award, (2) One of the articles related to this contribution and authored by this candidate must have appeared in the proceedings of SIROCCO.[1]

The award was presented for the first time in 2009.[2]

Winners

Year Recipient Topic
2009[2] Nicola Santoro Analysis of properties of labeled Graphs
2010[3] Jean-Claude Bermond Impact of structure of networks on the efficiency of parallel or distributed algorithms
2011[4] David Peleg Local computing, robot computing, dynamic monopolies, sparse spanners, compact routing and labeling schemes
2012[5] Roger Wattenhofer Distributed approximation
2013[6] Andrzej Pelc Communication paradigms for information dissemination
2014[7] Pierre Fraigniaud On the role of identities in local distributed computing
2015[8] Michel Raynal Condition-based approach to solving agreement problems

References

  1. Call for Nominations for the Prize (2013)
  2. 2.0 2.1 Idit Keidar, ACM-SIGACT News Distributed Computing Column, December 2009
  3. Proceedings of SIROCCO 2010
  4. Proceedings of SIROCCO 2011
  5. Idit Keidar, ACM-SIGACT News Distributed Computing Column, June 2013
  6. Proceedings of SIROCCO 2013
  7. Proceedings of SIROCCO 2014
  8. SIROCCO 2015 Website

External links

This article is issued from Wikipedia - version of the Friday, May 29, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.