Skip to main content
  • Conference proceedings
  • © 2016

Structural Information and Communication Complexity

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

Editors:

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

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

Conference series link(s): SIROCCO: International Colloquium on Structural Information and Communication Complexity

Conference proceedings info: SIROCCO 2016.

Buying options

eBook USD 64.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-48314-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 84.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

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

Other Volumes

  1. Structural Information and Communication Complexity

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

About this book

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.

Keywords

  • 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
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Aalto University, Espoo, Finland

    Jukka Suomela

Bibliographic Information

Buying options

eBook USD 64.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-48314-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 84.99
Price excludes VAT (USA)