This book constitutes the refereed proceedings of the 30th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2023, held in Alcalá de Henares, Spain, during June 69, 2023.
The 26 full papers presented in this book were carefully reviewed and selected from 48 submissions. SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative approaches leading to better understanding of the relationship between computing and communication. This is the 30th edition of SIROCCO, and 3 of the 26 papers in this book are devoted to celebrating this fact, plus an additional paper about a recent trend to study special models of computation.

Klappentext

30th Anniversary track.- Degree Realization by Bipartite Multigraphs.- Thirty years of SIROCCO. A data and graph mining comparative analysis of its temporal evolution.- About Informatics, Distributed Computing, and our Job: a Personal View.- Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks With Feedback.- SIROCCO Main track.- Distributed Coloring of Hypergraphs.- Lockless Blockchain Sharding with Multiversion Control.- Lockless Blockchain Sharding with Multiversion Control.- Compatibility of convergence algorithms for autonomous mobile robots.- FnF-BFT: A BFT protocol with provable performance under attack.- Divide & Scale: Formalization and Roadmap to Robust Sharding.- Zero-Memory Graph Exploration with Unknown Inports.- The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-genus Networks.- Search and Rescue on the Line.- Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs.- Distributed Half-Integral Matching and Beyond.- Boundary Sketching with Asymptotically Optimal Distance and Rotation.- Cops & Robber on Periodic Temporal Graphs : Characterization and Improved Bounds.- Minimum Cost Flow in the CONGEST Model.- The communication complexity of functions with large outputs.- On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST model.- Energy-Efficient Distributed Algorithms for Synchronous Networks.- Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity.- Overcoming Probabilistic Faults in Disoriented Linear Search.- Packet Forwarding with Swaps.- Exact Distributed Sampling.- Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.

Inhalt
30th Anniversary track.- Degree Realization by Bipartite Multigraphs.- Thirty years of SIROCCO. A data and graph mining comparative analysis of its temporal evolution.- About Informatics, Distributed Computing, and our Job: a Personal View.- Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks With Feedback.- SIROCCO Main track.- Distributed Coloring of Hypergraphs.- Lockless Blockchain Sharding with Multiversion Control.- Lockless Blockchain Sharding with Multiversion Control.- Compatibility of convergence algorithms for autonomous mobile robots.- FnF-BFT: A BFT protocol with provable performance under attack.- Divide & Scale: Formalization and Roadmap to Robust Sharding.- Zero-Memory Graph Exploration with Unknown Inports.- The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-genus Networks.- Search and Rescue on the Line.- Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs.- Distributed Half-Integral Matching and Beyond.- Boundary Sketching with Asymptotically Optimal Distance and Rotation.- Cops & Robber on Periodic Temporal Graphs : Characterization and Improved Bounds.- Minimum Cost Flow in the CONGEST Model.- The communication complexity of functions with large outputs.- On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST model.- Energy-Efficient Distributed Algorithms for Synchronous Networks.- Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity.- Overcoming Probabilistic Faults in Disoriented Linear Search.- Packet Forwarding with Swaps.- Exact Distributed Sampling.- Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.