Prize for Innovation in Distributed Computing: Difference between revisions

Revision as of 23:27, 8 July 2017

Revision as of 14:24, 8 September 2017

Line 16:

| Analysis of properties of labeled graphs

|-

| 2010<ref>Proceedings of SIROCCO 2010 [httphttps://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 [httphttps://link.springer.com/content/pdf/bfm%3A978-3-642-22212-2%2F1.pdf]</ref>

| [[David_Peleg_(computer_scientist)|David Peleg]]

| Local computing, robot computing, dynamic monopolies, sparse spanners, compact routing and labeling schemes

Line 28:

| Distributed approximation

|-

| 2013<ref>Proceedings of SIROCCO 2013 [httphttps://link.springer.com/content/pdf/bfm%3A978-3-319-03578-9%2F1.pdf]</ref>

| Andrzej Pelc

| Communication paradigms for information dissemination

|-

| 2014<ref>Proceedings of SIROCCO 2014 [httphttps://link.springer.com/book/10.1007%2F978-3-319-09620-9]</ref>

|[[:fr:Pierre Fraigniaud|Pierre Fraigniaud]]

| On the role of identities in local distributed computing