000 05472nam a22006855i 4500
001 978-3-031-32733-9
003 DE-He213
005 20240730174512.0
007 cr nn 008mamaa
008 230510s2023 sz | s |||| 0|eng d
020 _a9783031327339
_9978-3-031-32733-9
024 7 _a10.1007/978-3-031-32733-9
_2doi
050 4 _aQA9.58
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.13
_223
245 1 0 _aStructural Information and Communication Complexity
_h[electronic resource] :
_b30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023, Proceedings /
_cedited by Sergio Rajsbaum, Alkida Balliu, Joshua J. Daymude, Dennis Olivetti.
250 _a1st ed. 2023.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2023.
300 _aXI, 596 p. 134 illus., 79 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13892
505 0 _a30th 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.
520 _aThis 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 6-9, 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.
650 0 _aAlgorithms.
_93390
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aApplication software.
_9112774
650 0 _aOperating systems (Computers).
_95329
650 0 _aComputer engineering.
_910164
650 0 _aComputer networks .
_931572
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aDesign and Analysis of Algorithms.
_931835
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aComputer and Information Systems Applications.
_9112775
650 2 4 _aOperating Systems.
_937074
650 2 4 _aComputer Engineering and Networks.
_9112776
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aRajsbaum, Sergio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9112777
700 1 _aBalliu, Alkida.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9112778
700 1 _aDaymude, Joshua J.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9112779
700 1 _aOlivetti, Dennis.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9112780
710 2 _aSpringerLink (Online service)
_9112781
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031327322
776 0 8 _iPrinted edition:
_z9783031327346
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13892
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-32733-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c89468
_d89468