Structural Information and Communication Complexity
Description
This book constitutes the refereed proceedings of the 33rd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2026, held in Durham, UK, during June 9-11, 2026.
The 28 full papers included in this book were carefully reviewed and selected from 65 submissions.They focus on innovative methodological and solution approaches in structural knowledge, communication, and computing in decentralized systems of multiple comunicating entities.
More details
Other editions
Additional editions
Content
.- A Simple Distributed Deterministic Planar Separator.
.- Maintaining Bipartite Colourings on Temporal Graphs on a Budget.
.- Formal certi?cation of ASYNC protocols: the case of Gathering in R
2
using Weber points.
.- Equivalence and Separation between Heard-Of and Asynchronous Message-Passing Models
.- Minimum Deviation Distance Realization.
.- Online Bisection with Ring Demands.
.- On the Solvability of Byzantine-tolerant Reliable Communication in Dynamic Networks.
.- A Lightweight Approach for State Machine Replication.
.- Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes.
.- Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness.
.- Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks.
.- Fast distributed sampling of colorings of trees with few colors.
.- Distributed Sparsest Cut via Eigenvalue Estimation.
.- Cow Path by Finite Agent: Time vs Pebbles.
.- Multiparty equality in the local broadcast model.
.- Universal Dancing by Luminous Robots Under Sequential Schedulers.
.- Polynomial Time Local Decision Revisited.
.- Proving there is a leader without naming it.
.- Fast Distributed Computation of Compact Routing Schemes.
.- Online Exploration of Grid Graphs with Multiple Searchers.
.- Towards Optimal Distributed Delta Coloring.
.- Extending the writing distance: the R(dr)W(dw) communication model for self-stabilizing distributed algorithms.
.- Indirect Coflow Scheduling.
.- Byzantine Approximate Agreement Cross-chain Task.
.- Asynchronous Fault-tolerant Mutual Visibility.
.- Distributed MIS Algorithms for Rational Agents using Games.
.- Uniform deployment of myopic luminous robots in rings.
.- A Formalization of Knowledge in Fault Tolerant Distributed Algorithms.
