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.
Lecture Notes in Computer Science 4056 Springer 2006, ISBN 3-540-35474-3 
- Evangelos Kranakis, Danny Krizanc, Sergio Rajsbaum:
Mobile Agent Rendezvous: A Survey.
1-9
- Hagit Attiya:
Adapting to Point Contention with Long-Lived Safe Agreement .
10-23
- Roger Wattenhofer:
Sensor Networks: Distributed Algorithms Reloaded - or Revolutions?.
24-28
- Reuven Cohen, David Peleg:
Local Algorithms for Autonomous Robot Systems.
29-43
- Dariusz R. Kowalski, Adam Malinowski:
How to Meet in Anonymous Network.
44-58
- 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 Bonichon, Cyril Gavoille, Arnaud Labourel:
Short Labels by Traversal and Jumping.
143-156
- 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
- Graham Cormode, S. Muthukrishnan:
Combinatorial Algorithms for Compressed Sensing.
280-294
- 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
- Boaz Patt-Shamir, Allon Shafrir:
Approximate Top-k Queries in Sensor Networks.
319-333
- 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
Last update Tue Feb 14 04:11:18 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
