Skip to main content
SpringerLink
Log in

Structural Information and Communication Complexity

25th International Colloquium, SIROCCO 2018, Ma'ale HaHamisha, Israel, June 18-21, 2018, Revised Selected Papers

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. Zvi Lotker

    1. Ben-Gurion University of the Negev, Beer-Sheva, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Boaz Patt-Shamir

    1. Tel Aviv University, Tel Aviv, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: SIROCCO 2018.

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 EPUB and 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 (32 papers)

  1. Front Matter

    Pages I-XIX
    Download chapter PDF

  2. Invited Talks and Brief Announcments

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Realizability of Graph Specifications: Characterizations and Algorithms

      • Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
      Pages 3-13

    3. A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model

      • Johanne Cohen, George Manoussakis, Laurence Pilard, Devan Sohier
      Pages 14-19

    4. Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection

      • Anaïs Durand, Shay Kutten
      Pages 20-24

    5. Constant-Space Self-stabilizing Token Distribution in Trees

      • Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
      Pages 25-29

    6. Distributed Counting Along Lossy Paths Without Feedback

      • Vitalii Demianiuk, Sergey Gorinsky, Sergey Nikolenko, Kirill Kogan
      Pages 30-33

    7. Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN

      • Yefim Dinitz, Shlomi Dolev, Daniel Khankin
      Pages 34-37

    8. Brief Announcement: Fast Approximate Counting and Leader Election in Populations

      • Othon Michail, Paul G. Spirakis, Michail Theofilatos
      Pages 38-42

    9. One-Max Constant-Probability Networks: Results and Future Work

      • Mark Korenblit
      Pages 43-47

    10. Reaching Distributed Equilibrium with Limited ID Space

      • Dor Bank, Moshe Sulamy, Eyal Waserman
      Pages 48-51

  3. Full Papers

    1. Front Matter

      Pages 53-53
      Download chapter PDF

    2. Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract)

      • Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar
      Pages 55-71

    3. A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in \(O(\log n)\) Time

      • Volker Turau
      Pages 72-87

    4. Simple and Local Independent Set Approximation

      • Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz
      Pages 88-101

    5. On the Strongest Message Adversary for Consensus in Directed Dynamic Networks

      • Ulrich Schmid, Manfred Schwarz, Kyrill Winkler
      Pages 102-120

    6. Symmetric Rendezvous with Advice: How to Rendezvous in a Disk

      • Konstantinos Georgiou, Jay Griffiths, Yuval Yakubov
      Pages 121-133

    7. Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model

      • Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca
      Pages 134-148

    8. Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings

      • Masahiro Shibata, Hirotsugu Kakugawa, Toshimitsu Masuzawa
      Pages 149-164

    9. Explorable Families of Graphs

      • Andrzej Pelc
      Pages 165-177
Back to top

Other volumes

  1. Structural Information and Communication Complexity

Keywords

About this book

This book constitutes  the refereed post-conference proceedings of the 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018, held in Ma'ale HaHamisha, Israel, in June 2018.

The 23 full papers and 8 short papers presented were carefully reviewed and selected from 47 submissions. They are devoted to the study of the interplay between structural knowledge, communications, and computing in decentralized systems of multiple communicating entities and cover a large range of topics.

Editors and Affiliations

  • Ben-Gurion University of the Negev, Beer-Sheva, Israel

    Zvi Lotker

  • Tel Aviv University, Tel Aviv, Israel

    Boaz Patt-Shamir

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation