13. SIROCCO 2006: Chester, UK
Paola Flocchini, Leszek Gasieniec (Eds.): Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings. Springer 2006 Lecture Notes in Computer Science 4056 ISBN 3-540-35474-3- Hagit Attiya: Adapting to Point Contention with Long-Lived Safe Agreement . 10-23
- Roger Wattenhofer: Sensor Networks: Distributed Algorithms Reloaded - or Revolutions?. 24-28
- David Ilcinkas: Setting Port Numbers for Fast Graph Exploration. 59-69
- Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial: Distributed Chasing of Network Intruders. 70-84
- Jérémie Chalopin: Election in the Qualitative World. 85-99
- Bilel Derbel, Cyril Gavoille: Fast Deterministic Distributed Algorithms for Sparse Spanners. 100-114
- Jaap-Henk Hoepman, Shay Kutten, Zvi Lotker: Efficient Distributed Weighted Matchings on Trees. 115-129
- Adrian Kosowski: Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. 130-142
- Nicolas Thibault, Christian Laforest: An Optimal Rebuilding Strategy for a Decremental Tree Problem. 157-170
- Amotz Bar-Noy, Richard E. Ladner, Tami Tamir: Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering. 171-181
- Philippe Raipin Parvédy, Michel Raynal, Corentin Travers: Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. 182-196
- Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro: On Fractional Dynamic Faults with Threshold. 197-211
- Mikhail Nesterenko, Sébastien Tixeuil: Discovering Network Topology in the Presence of Byzantine Faults. 212-226
- Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri: Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. 227-239
- Alfredo Navarra: 3-D Minimum Energy Broadcasting. 240-252
- Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Average-Time Complexity of Gossiping in Radio Networks. 253-267
- Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, Paola Vocca: L(h, 1, 1)-Labeling of Outerplanar Graphs. 268-279
- Davide Bilò, Luciano Gualà, Guido Proietti: On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. 295-309
- Travis Gagie: Dynamic Asymmetric Communication. 310-318
- Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore: Self-stabilizing Space Optimal Synchronization Algorithms on Trees. 334-348
- Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan: Distance-k Information in Self-stabilizing Algorithms. 349-356
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-12-12T214815 by the dblp team