Structural information and communication complexity : 13th international colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006 : proceedings /
Saved in:
| Meeting name: | Colloquium on Structural Information and Communication Complexity (13th : 2006 : Chester, England) |
|---|---|
| Imprint: | Berlin ; New York : Springer, c2006. |
| Description: | x, 356 p. : ill. ; 24 cm. |
| Language: | English |
| Series: | Lecture notes in computer science ; 4056 |
| Subject: | |
| Format: | E-Resource Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/6011950 |
Table of Contents:
- Mobile agent rendezvous : a survey / Evangelos Kranakis, Danny Krizanc and Sergio Rajsbaum
- Adapting to point contention with long-lived safe agreement / Hagit Attiya
- Sensor networks : distributed algorithms reloaded - or revolutions? / Roger Wattenhofer
- Local algorithms for autonomous robot systems / Reuven Cohen and David Peleg
- How to meet in anonymous network / Dariusz R. Kowalski and Adam Malinowski
- Setting port numbers for fast graph exploration / David Ilcinkas
- Distributed chasing of network intruders / Lelia Blin, Pierre Fraigniaud, Nicolas Nisse and Sandrine Vial
- Election in the qualitative world / Jeremie Chalopin
- Fast deterministic distributed algorithms for sparse spanners / Bilel Derbel and Cyril Gavoille
- Efficient distributed weighted matchings on trees / Jaap-Henk Hoepman, Shay Kutten and Zvi Lotker
- Approximation strategies for routing edge disjoint paths in complete graphs / Adrian Kosowski
- Short labels by traversal and jumping / Nicolas Bonichon, Cyril Gavoille and Arnaud Labourel
- An optimal rebuilding strategy for a decremental tree problem / Nicolas Thibault and Christian Laforest
- Optimal delay for media-on-demand with pre-loading and pre-buffering / Amotz Bar-Noy, Richard E. Ladner and Tami Tamir
- Strongly terminating early-stopping k-set agreement in synchronous systems with general omission failures / Philippe Raipin Parvedy, Michel Raynal and Corentin Travers
- On fractional dynamic faults with threshold / Stefan Dobrev, Rastislav Kralovic, Richard Kralovic and Nicola Santoro
- Discovering network topology in the presence of Byzantine faults / Mikhail Nesterenko and Sebastien Tixeuil
- Minimum energy broadcast and disk cover in grid wireless networks / Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti and Riccardo Silvestri
- 3-D minimum energy broadcasting / Alfredo Navarra
- Average-time complexity of gossiping in radio networks / Bogdan S. Chlebus, Dariusz R. Kowalski and Mariusz A. Rokicki
- L(h,1,1)-labeling of outerplanar graphs / Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan and Paola Vocca
- Combinatorial algorithms for compressed sensing / Graham Cormode and S. Muthukrishnan
- On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem / Davide Bilo, Luciano Guala and Guido Proietti
- Dynamic asymmetric communication / Travis Gagie
- Approximate top-k queries in sensor networks / Boaz Patt-Shamir and Allon Shafrir
- Self-stabilizing space optimal synchronization algorithms on trees / Doina Bein, Ajoy K. Datta and Lawrence L. Larmore
- Distance-k information in self-stabilizing algorithms / Wayne Goddard, Stephen T. Hedetniemi, David P. Jacobs and Vilmar Trevisan.
