Structural Information and Communication Complexity

23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers

  • Jukka Suomela
Conference proceedings SIROCCO 2016

DOI: 10.1007/978-3-319-48314-6

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

Table of contents (25 papers)

  1. Front Matter
    Pages I-XXIX
  2. Message Passing

    1. Front Matter
      Pages 1-1
    2. How Many Cooks Spoil the Soup?
      Othon Michail, Paul G. Spirakis
      Pages 3-18
    3. Dynamic Networks of Finite State Machines
      Yuval Emek, Jara Uitto
      Pages 19-34
    4. Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
      Ralf Klasing, Adrian Kosowski, Dominik Pajak
      Pages 35-48
    5. Fooling Pairs in Randomized Communication Complexity
      Shay Moran, Makrand Sinha, Amir Yehudayoff
      Pages 49-59
    6. Message Lower Bounds via Efficient Network Synchronization
      Gopal Pandurangan, David Peleg, Michele Scquizzato
      Pages 75-91
  3. Shared Memory

    1. Front Matter
      Pages 109-109
    2. Asynchronous Coordination Under Preferences and Constraints
      Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy
      Pages 111-126
    3. Concurrent Use of Write-Once Memory
      James Aspnes, Keren Censor-Hillel, Eitan Yaakobi
      Pages 127-142
    4. In the Search for Optimal Concurrency
      Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi
      Pages 143-158
    5. The F-Snapshot Problem
      Gal Amram
      Pages 159-176
    6. t-Resilient Immediate Snapshot Is Impossible
      Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal
      Pages 177-191
  4. Mobile Agents

    1. Front Matter
      Pages 193-193
    2. Linear Search by a Pair of Distinct-Speed Robots
      Evangelos Bampas, Jurek Czyzowicz, Leszek Gąsieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka et al.
      Pages 195-211
    3. Deterministic Meeting of Sniffing Agents in the Plane
      Samir Elouasbi, Andrzej Pelc
      Pages 212-227
    4. Distributed Evacuation in Graphs with Multiple Exits
      Piotr Borowiecki, Shantanu Das, Dariusz Dereniowski, Łukasz Kuszner
      Pages 228-241
    5. Universal Systems of Oblivious Mobile Robots
      Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
      Pages 242-257

About these proceedings


This book constitutes the refereed proceedings of the 23rd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2016, held in Helsinki, Finland in July 2016.

The 25 full papers presented were carefully reviewed and selected from 50 submissions. The papers are organized around the following topics: message passing; shared memory; mobile agent; data dissemination and routing.


algorithm design and analysis computational complexity distributed computing graph theory mobile agents approximation algorithms asynchronous computing communication networks concurrency data dissemination discrete mathematics distributed algorithms dynamic networks information complexity linear programming message passing multi-processor systems networked finite automata routing shared memory

Editors and affiliations

  • Jukka Suomela
    • 1
  1. 1.Aalto UniversityEspooFinland

Bibliographic information

  • Copyright Information Springer International Publishing AG 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-48313-9
  • Online ISBN 978-3-319-48314-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349