Prize for Innovation in Distributed Computing: Difference between revisions

Content deleted Content added
Nashatun (talk | contribs)
No edit summary
Nashatun (talk | contribs)
No edit summary
Line 1:
 
 
The '''Prize for Innovation in Distributed Computing''' (also called SIROCCO award) is an award presented annually at the conference [[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, new ideas that were unorthodox and outside the mainstream at the tie 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.<ref>httpsCall for Nominations for the Prize (2013) [http://sites.google.com/site/sirocco2013italy/call-for-prize-nomination]</ref>
 
The award was presented for the first time in 2009.<ref name="DCcol36">Idit Keidar, ACM-SIGACT News Distributed Computing Column, December 2009 [http://people.csail.mit.edu/idish/sigactNews/DC-col36-Dec09.pdf]</ref>
 
==Winners==
Line 12:
! Topic
|-
| 2009<ref name="DCcol36" />
| 2009<ref>http://people.csail.mit.edu/idish/sigactNews/DC-col36-Dec09.pdf</ref>
| Nicola Santoro
| Analysis of properties of labeled Graphs
|-
| 2010<ref>Proceedings of SIROCCO 2010 [http://link.springer.com/content/pdf/bfm%3A978-3-642-13284-1%2F1.pdf]</ref>
| Jean-Claude Bermond
| Impact of structure of networks on the efficiency of parallel or distributed algorithms
|-
| 2011<ref>Proceedings of SIROCCO 2011 [http://link.springer.com/content/pdf/bfm%3A978-3-642-22212-2%2F1.pdf]</ref>
| David Peleg
| Local computing, robot computing, dynamic monopolies, sparse spanners, compact routing and labeling schemes
|-
| 2012<ref>Idit Keidar, ACM-SIGACT News Distributed Computing Column, June 2013 [http://people.csail.mit.edu/idish/sigactNews/DC-col50-Jun13.pdf]</ref>
| Roger Wattenhofer
| Distributed approximation
|-
| 2013<ref>Proceedings of SIROCCO 2013 [http://link.springer.com/content/pdf/bfm%3A978-3-319-03578-9%2F1.pdf]</ref>
| Andrzej Pelc
| Communication paradigms for information dissemination
|}
 
 
== References ==
Line 39 ⟶ 38:
 
== External links ==
* Call for Nomination for the Prize [httpshttp://sites.google.com/site/sirocco2013italy/call-for-prize-nomination Call for Nomination for the Prize (2013)]
 
<!--- Categories --->