001468310 000__ 05507cam\\22006857i\4500
001468310 001__ 1468310
001468310 003__ OCoLC
001468310 005__ 20230707003246.0
001468310 006__ m\\\\\o\\d\\\\\\\\
001468310 007__ cr\un\nnnunnun
001468310 008__ 230530s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001468310 019__ $$a1380459675
001468310 020__ $$a9783031327339$$q(electronic bk.)
001468310 020__ $$a3031327330$$q(electronic bk.)
001468310 020__ $$z9783031327322$$q(print)
001468310 020__ $$z3031327322
001468310 0247_ $$a10.1007/978-3-031-32733-9$$2doi
001468310 035__ $$aSP(OCoLC)1380697433
001468310 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dEBLCP
001468310 049__ $$aISEA
001468310 050_4 $$aQA76.9.A43
001468310 08204 $$a005.1$$223/eng/20230530
001468310 1112_ $$aColloquium on Structural Information and Communication Complexity$$n(30th :$$d2023 :$$cAlcalá de Henares, Spain)
001468310 24510 $$aStructural Information and Communication Complexity :$$b30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023, Proceedings /$$cSergio Rajsbaum, Alkida Balliu, Joshua J. Daymude, Dennis Olivetti, editors.
001468310 2463_ $$aSIROCCO 2023
001468310 264_1 $$aCham, Switzerland :$$bSpringer,$$c2023.
001468310 300__ $$a1 online resource (xi, 596 pages) :$$billustrations (some color).
001468310 336__ $$atext$$btxt$$2rdacontent
001468310 337__ $$acomputer$$bc$$2rdamedia
001468310 338__ $$aonline resource$$bcr$$2rdacarrier
001468310 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v13892
001468310 500__ $$aIncludes author index.
001468310 5050_ $$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.
001468310 506__ $$aAccess limited to authorized users.
001468310 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.
001468310 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed May 30, 2023).
001468310 650_0 $$aElectronic data processing$$xDistributed processing$$vCongresses.
001468310 650_0 $$aComputer networks$$vCongresses.
001468310 650_0 $$aDigital communications$$vCongresses.
001468310 655_0 $$aElectronic books.
001468310 7001_ $$aRajsbaum, Sergio,$$eeditor.$$1https://orcid.org/0000-0002-0009-5287
001468310 7001_ $$aBalliu, Alkida,$$eeditor.
001468310 7001_ $$aDaymude, Joshua J.$$eeditor.
001468310 7001_ $$aOlivetti, Dennis,$$eeditor.
001468310 77608 $$iPrint version: $$z3031327322$$z9783031327322$$w(OCoLC)1375545753
001468310 830_0 $$aLecture notes in computer science ;$$v13892.$$x1611-3349
001468310 852__ $$bebk
001468310 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-32733-9$$zOnline Access$$91397441.1
001468310 909CO $$ooai:library.usi.edu:1468310$$pGLOBAL_SET
001468310 980__ $$aBIB
001468310 980__ $$aEBOOK
001468310 982__ $$aEbook
001468310 983__ $$aOnline
001468310 994__ $$a92$$bISE