Structural Information and Communication Complexity

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

  • Adrian Kosowski
  • Masafumi Yamashita

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

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Survey Talk

    1. Sergio Rajsbaum, Michel Raynal
      Pages 17-28
  4. Fault Tolerance

    1. Alain Bui, Simon Clavière, Ajoy K. Datta, Lawrence L. Larmore, Devan Sohier
      Pages 54-65
    2. Damien Imbs, Sergio Rajsbaum, Michel Raynal
      Pages 66-77
  5. Routing

    1. Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki
      Pages 89-100
    2. Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder
      Pages 101-112
    3. Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder
      Pages 113-124
  6. Mobile Agents/Robots (I)

    1. Philipp Brandes, Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide
      Pages 138-149
    2. Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil
      Pages 150-161
  7. Mobile Agents/Robots (II)

    1. Gianlorenzo D’Angelo, Gabriele Di Stefano, Alfredo Navarra
      Pages 174-185
    2. Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
      Pages 186-197
    3. Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro
      Pages 198-209
  8. Probabilistic Methods

    1. Colin Cooper, Alan Frieze, Tomasz Radzik
      Pages 210-221

About these proceedings

Introduction

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.

Keywords

anonymous networks distributed algorithms geometric networks parallel algorithm random hypergraphs

Editors and affiliations

  • Adrian Kosowski
    • 1
  • Masafumi Yamashita
    • 2
  1. 1.INRIA, Bordeau Sud-Ouest Research CenterTalence cedexFrance
  2. 2.Department of Computer Science and Communication EngineeringKyushu UniversityFukuokaJapan

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-22212-2
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-22211-5
  • Online ISBN 978-3-642-22212-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book