Structural Information and Communication Complexity [electronic resource] : 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007. Proceedings / edited by Giuseppe Prencipe, Shmuel Zaks.

Session 1. Invited Talks -- Fast Distributed Algorithms Via Primal-Dual (Extended Abstract) -- Time Optimal Gathering in Sensor Networks -- Treewidth: Structure and Algorithms -- Session 2. Autonomous Systems: Graph Exploration -- Fast Periodic Graph Exploration with Constant Memory -- Why Robots Need Maps -- Graph Searching with Advice -- Session 3. Distributed Algorithms: Fault Tolerance -- From Renaming to Set Agreement -- A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives -- A New Self-stabilizing Maximal Matching Algorithm -- Session 4. Distributed Algorithms and Data Structures -- Labeling Schemes with Queries -- A Simple Optimistic Skiplist Algorithm -- Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs -- Session 5. Autonomous Systems: Location Problems -- Optimal Moves for Gossiping Among Mobile Agents -- Swing Words to Make Circle Formation Quiescent -- Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots -- Session 6. Wireless Networks -- Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs -- Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers -- Location Oblivious Distributed Unit Disk Graph Coloring -- Session 7. Communication Networks: Fault Tolerance -- Edge Fault-Diameter of Cartesian Product of Graphs -- Rapid Almost-Complete Broadcasting in Faulty Networks -- Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions -- Session 8. Autonomous Systems: Fault Tolerance -- Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots -- Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents -- Session 9. Communication Networks: Parallel Computing and Selfish Routing -- Optimal Conclusive Sets for Comparator Networks -- Selfish Routing with Oblivious Users -- Upper Bounds and Algorithms for Parallel Knock-Out Numbers.

jointly with the GRAAL meeting. We thank the Management Committee of GRAAL, and especially their past and present Chairs Xavier Munoz and Arie Koster, for supporting the idea of this joint event and for their generous support. June 2007 Giuseppe Prencipe Shmuel Zaks Conference Organization Steering Committee Paola Flocchini Andrzej Pelc Pierre Fraigniaud, Chair David Peleg Leszek Gasieniec Giuseppe Prencipe Lefteris Kirousis Michel Raynal Rastislav Kr´ alovi?c Nicola Santoro Evangelos Kranakis Paul Spirakis Danny Krizanc Shmuel Zaks Bernard Mans Program Committee Christoph Ambuhl ¨ Giuseppe Prencipe, Co-chair Ioannis Caragiannis Guido Proietti Lenka Carr-Motyckova Andrzej Proskurowski Bogdan Chlebus Geppino Pucci Thomas Erlebach Tomasz Radzik Rastislav Kr´ alovi?c Sergio Rajsbaum Evangelos Kranakis Michel Raynal Jan van Leeuwen Tami Tamir Euripides Markou Savio Tse Toshimitsu Masuzawa Peter Widmayer Yves M´etivier Shmuel Zaks, Co-chair Local Organization Vincenzo Gervasi, Dipartimento di Informatica, Universitad ` i Pisa Sponsoring Institutions Universit`adi Pisa EU COST 293 action (GRAAL) VIII Organization External Reviewers Ittai Abraham Dariusz Kowalski Hagit Attiya Richard Kral ´ ovi?c Alberto Bertoldo Danny Krizanc Vittorio Bil` o Qin Lv Davide Bil` o Francesca Martelli Maria Blesa Russell Martin Anat Bremler-Barr Valia Mitsou Marco Bressan Gianpiero Monaco Alfred Bruckstein Mohamed Mosbah Keren Censor Luca Moscardelli Milind Dawande Alfredo Navarra Xavier Defago Francesco Nidito Stefan Dobrev Fukuhito Ooshita Frederick Ducatelle Aris Pagourtzis Toby Ehrenkrantz Evi Papaioannou Michael Elkin Dana Pardubska Angelo Fanelli Susanna Pelagatti Arthur Farley Andrzej Pelc Laura Feeney David Peleg Michele Flammini Enoch Peserico Paola Flocchini Andrea Pietracaprina Luca Forlizzi Katerina Potika Leszek Gasieniec