Structural information and communica...
Colloquium on Structural Information and Communication Complexity (2023 :)

Linked to FindBook      Google Book      Amazon      博客來     
  • Structural information and communication complexity = 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023 : proceedings /
  • Record Type: Electronic resources : Monograph/item
    Title/Author: Structural information and communication complexity/ edited by Sergio Rajsbaum ... [et al.].
    Reminder of title: 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023 : proceedings /
    remainder title: SIROCCO 2023
    other author: Rajsbaum, Sergio.
    corporate name: Colloquium on Structural Information and Communication Complexity
    Published: Cham :Springer Nature Switzerland : : 2023.,
    Description: 1 online resource (xi, 596 p.) :ill. (some col.), digital ;24 cm.
    [NT 15003449]: 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.
    Contained By: Springer Nature eBook
    Subject: Electronic data processing - Congresses. - Distributed processing -
    Online resource: https://doi.org/10.1007/978-3-031-32733-9
    ISBN: 9783031327339
Location:  Year:  Volume Number: 
Items
  • 1 records • Pages 1 •
  • 1 records • Pages 1 •
Multimedia
Reviews
Export
pickup library
 
 
Change password
Login