LEADER 05320nam 22008055 450 001 996660360703316 005 20250522130238.0 010 $a3-031-91736-7 024 7 $a10.1007/978-3-031-91736-3 035 $a(CKB)38891603600041 035 $a(DE-He213)978-3-031-91736-3 035 $a(MiAaPQ)EBC32127054 035 $a(Au-PeEL)EBL32127054 035 $a(OCoLC)1524420730 035 $a(EXLCZ)9938891603600041 100 $a20250522d2025 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aStructural Information and Communication Complexity $e32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2?4, 2025, Proceedings /$fedited by Ulrich Schmid, Roman Kuznets 205 $a1st ed. 2025. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2025. 215 $a1 online resource (XXVII, 446 p. 97 illus., 32 illus. in color.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15671 311 08$a3-031-91735-9 327 $aRegular Papers -- Support + Belief = Decision Trust -- Asynchronous Byzantine Consensus with Trusted Monotonic Counters -- Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols -- On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement -- Exploration of Convex Terrains by a Deterministic Automaton with Pebbles -- Explicit Token-Based Communication for Mobile Entities -- Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs -- Deterministic Color-optimal Self-stabilizing Semi-synchronous Gathering: a Certified Algorithm -- Approximating Independent Sets in Constant Distributed Rounds -- A Visibility vs. Memory Trade-off for Stand-Up Indulgent Gathering on Lines -- Simplicial Belief -- When MIS and Maximal Matching are Easy in the Congested Clique -- Bankrupting DoS Attackers -- Low-Distortion Clustering in Bounded Growth Graphs -- Multimodal Search on a Line -- Multi-Agent Disk Inspection -- Pointer Chasing with Unlimited Interaction -- Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation -- On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies -- Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity -- Lower bounds for uniform read-once threshold formulae in the randomized decision tree model -- Distributed Distance Sensitivity Oracles -- Self-stabilizing Graph Exploration by a Single Agent -- Labeling Embeddings of Planar Graphs for Face-Adjacency -- Brief Announcements -- Brief Announcement: Relaxation for Efficient Asynchronous Queues -- Brief Announcement: A Sheaf-Theoretic Characterization of Tasks in Distributed Systems -- Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model -- Brief Announcement: Perfect Matching with Few Link Activations. 330 $aThis book constitutes the refereed proceedings of the 32nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2025, held in Delphi, Greece in June 2025. The 24 full papers and 4 brief announcements included in the proceedings were carefully reviewed and selected from a total of 57 submissions. They focus on innovative methodological and solution approaches in structural knowledge, communication, and computing in decentralized systems of multiple comunicating entities. . 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v15671 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aApplication software 606 $aOperating systems (Computers) 606 $aComputer engineering 606 $aComputer networks 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aDesign and Analysis of Algorithms 606 $aData Structures and Information Theory 606 $aComputer and Information Systems Applications 606 $aOperating Systems 606 $aComputer Engineering and Networks 606 $aDiscrete Mathematics in Computer Science 615 0$aAlgorithms. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aApplication software. 615 0$aOperating systems (Computers) 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aDesign and Analysis of Algorithms. 615 24$aData Structures and Information Theory. 615 24$aComputer and Information Systems Applications. 615 24$aOperating Systems. 615 24$aComputer Engineering and Networks. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.13 702 $aSchmid$b Ulrich$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKuznets$b Roman$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996660360703316 996 $aStructural Information and Communication Complexity$92889850 997 $aUNISA