Structural Information and Communication Complexity 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2–4, 2025, Proceedings /
This 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...
Shranjeno v:
| Korporativna značnica: | |
|---|---|
| Drugi avtorji: | , |
| Format: | Elektronski eKnjiga |
| Jezik: | angleščina |
| Izdano: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2025.
|
| Izdaja: | 1st ed. 2025. |
| Serija: | Lecture Notes in Computer Science,
15671 |
| Teme: | |
| Online dostop: | https://doi.org/10.1007/978-3-031-91736-3 |
| Oznake: |
Označite
Brez oznak, prvi označite!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-91736-3 | ||
| 003 | DE-He213 | ||
| 005 | 20260706115946.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 250522s2025 sz | s |||| 0|eng d | ||
| 020 | |a 9783031917363 |9 978-3-031-91736-3 | ||
| 024 | 7 | |a 10.1007/978-3-031-91736-3 |2 doi | |
| 050 | 4 | |a QA9.58 | |
| 072 | 7 | |a UYA |2 bicssc | |
| 072 | 7 | |a COM014000 |2 bisacsh | |
| 072 | 7 | |a UYA |2 thema | |
| 082 | 0 | 4 | |a 005.13 |2 23 |
| 245 | 1 | 0 | |a Structural Information and Communication Complexity |h [electronic resource] : |b 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2–4, 2025, Proceedings / |c edited by Ulrich Schmid, Roman Kuznets. |
| 250 | |a 1st ed. 2025. | ||
| 264 | 1 | |a Cham : |b Springer Nature Switzerland : |b Imprint: Springer, |c 2025. | |
| 300 | |a XXVII, 446 p. 97 illus., 32 illus. in color. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 341 | 0 | |b Table of contents navigation |2 onix | |
| 341 | 0 | |b Single logical reading order |2 onix | |
| 341 | 0 | |b Short alternative textual descriptions |2 onix | |
| 341 | 0 | |b Use of color is not sole means of conveying information |2 onix | |
| 341 | 0 | |b Use of high contrast between text and background color |2 onix | |
| 341 | 0 | |b Next / Previous structural navigation |2 onix | |
| 341 | 0 | |b All non-decorative content supports reading without sight |2 onix | |
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Lecture Notes in Computer Science, |x 1611-3349 ; |v 15671 | |
| 505 | 0 | |a Regular 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. | |
| 520 | |a This 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. . | ||
| 532 | 8 | |a Accessibility summary: This PDF does not fully comply with PDF/UA standards, but does feature limited screen reader support, described non-text content (images, graphs), bookmarks for easy navigation and searchable, selectable text. Users of assistive technologies may experience difficulty navigating or interpreting content in this document. We recognize the importance of accessibility, and we welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us at accessibilitysupport@springernature.com. | |
| 532 | 8 | |a No reading system accessibility options actively disabled | |
| 532 | 8 | |a Publisher contact for further accessibility information: accessibilitysupport@springernature.com | |
| 650 | 0 | |a Algorithms. | |
| 650 | 0 | |a Data structures (Computer science). | |
| 650 | 0 | |a Information theory. | |
| 650 | 0 | |a Application software. | |
| 650 | 0 | |a Operating systems (Computers). | |
| 650 | 0 | |a Computer engineering. | |
| 650 | 0 | |a Computer networks . | |
| 650 | 0 | |a Computer science |x Mathematics. | |
| 650 | 0 | |a Discrete mathematics. | |
| 650 | 1 | 4 | |a Design and Analysis of Algorithms. |
| 650 | 2 | 4 | |a Data Structures and Information Theory. |
| 650 | 2 | 4 | |a Computer and Information Systems Applications. |
| 650 | 2 | 4 | |a Operating Systems. |
| 650 | 2 | 4 | |a Computer Engineering and Networks. |
| 650 | 2 | 4 | |a Discrete Mathematics in Computer Science. |
| 700 | 1 | |a Schmid, Ulrich. |e editor. |0 (orcid)0000-0001-9831-8583 |1 https://orcid.org/0000-0001-9831-8583 |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Kuznets, Roman. |e editor. |0 (orcid)0000-0001-5894-8724 |1 https://orcid.org/0000-0001-5894-8724 |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783031917356 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031917370 |
| 830 | 0 | |a Lecture Notes in Computer Science, |x 1611-3349 ; |v 15671 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-91736-3 |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 912 | |a ZDB-2-SXPS | ||
| 912 | |a ZDB-2-LNC | ||
| 912 | |a ZDB-2-238 | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||
| 950 | |a Springer Nature Proceedings Computer Science (SpringerNature-85344) | ||
| 950 | |a Focus Bundle Foundational Computer Science (SpringerNature-85408) | ||