Skip to main content
SpringerLink
Log in

Structural Information and Communication Complexity

18th International Colloquium, SIROCCO 2011, Gdańsk, Poland, June 26-29, 2011

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Adrian Kosowski

    1. INRIA, Bordeau Sud-Ouest Research Center, Talence cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Masafumi Yamashita

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • up-to-date results
  • fast track conference proceedings
  • state-of-the-art report

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6796)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SIROCCO 2011.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (27 papers)

  1. Front Matter

    Download chapter PDF

  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
Back to top

Other volumes

  1. Structural Information and Communication Complexity

Keywords

About this book

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.

Editors and Affiliations

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

    Adrian Kosowski

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

    Masafumi Yamashita

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation