Structural Information and Communication Complexity

1. Front Matter

   PDF

2. Invited Talks

   1. Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful

      • Colin Cooper

      Pages 1-14

   2. SINR Maps: Properties and Applications

      • David Peleg

      Pages 15-16

3. Survey Talk

   1. A Survey on Some Recent Advances in Shared Memory Models

      • Sergio Rajsbaum, Michel Raynal

      Pages 17-28

4. Fault Tolerance

   1. Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults

      • Emmanuel Godard, Joseph Peters

      Pages 29-41

   2. Reconciling Fault-Tolerant Distributed Algorithms and Real-Time Computing

      • Heinrich Moser, Ulrich Schmid

      Pages 42-53

   3. Self-stabilizing Hierarchical Construction of Bounded Size Clusters

      • Alain Bui, Simon Clavière, Ajoy K. Datta, Lawrence L. Larmore, Devan Sohier

      Pages 54-65

   4. The Universe of Symmetry Breaking Tasks

      • Damien Imbs, Sergio Rajsbaum, Michel Raynal

      Pages 66-77

5. Routing

   1. Determining the Conditional Diagnosability of k-Ary n-Cubes Under the MM* Model

      • Sun-Yuan Hsieh, Chi-Ya Kao

      Pages 78-88

   2. Medium Access Control for Adversarial Channels with Jamming

      • Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki

      Pages 89-100

   3. Full Reversal Routing as a Linear Dynamical System

      • Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder

      Pages 101-112

   4. Partial is Full

      • Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder

      Pages 113-124

6. Mobile Agents/Robots (I)

   1. Convergence with Limited Visibility by Asynchronous Mobile Robots

      • Branislav Katreniak

      Pages 125-137

   2. Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally

      • Philipp Brandes, Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide

      Pages 138-149

   3. Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection

      • Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil

      Pages 150-161

7. Mobile Agents/Robots (II)

   1. Gathering Asynchronous Oblivious Agents with Local Vision in Regular Bipartite Graphs

      • Samuel Guilbault, Andrzej Pelc

      Pages 162-173

   2. Gathering of Six Robots on Anonymous Symmetric Rings

      • Gianlorenzo D’Angelo, Gabriele Di Stefano, Alfredo Navarra

      Pages 174-185

   3. Tight Bounds for Scattered Black Hole Search in a Ring

      • Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou

      Pages 186-197

   4. Improving the Optimal Bounds for Black Hole Search in Rings

      • Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro

      Pages 198-209

8. Probabilistic Methods

   1. The Cover Times of Random Walks on Hypergraphs

      • Colin Cooper, Alan Frieze, Tomasz Radzik

      Pages 210-221

This book constitutes the refereed proceedings of the 18th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2011, held in Gdańsk, Poland, in June 2011. The 24 revised full papers presented together with 1 survey lecture and 2 invited talks were carefully reviewed and selected from 57 submissions. The papers are organized in topical section on fault tolerance, routing, mobile agents, mobile robots, probabilistic methods, distributed algorithms on graphs, and ad-hoc networks.

• anonymous networks
• distributed algorithms
• geometric networks
• parallel algorithm
• random hypergraphs
• algorithm analysis and problem complexity
• data structures

• INRIA, Bordeau Sud-Ouest Research Center, Talence cedex, France

  Adrian Kosowski

• Department of Computer Science and Communication Engineering, Kyushu University, Fukuoka, Japan

  Masafumi Yamashita

Policies and ethics