Vor Ort
Merkzettel Warenkorb
Produktbild: Structural Information and Communication Complexity
Band 16488

Structural Information and Communication Complexity 33rd International Colloquium, SIROCCO 2026, Durham, UK, June 9–11, 2026, Proceedings

Aus der Reihe Lecture Notes in Computer Science

73,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

25.05.2026

Abbildungen

XXI, 550 p. 82 illus., 37 illus. in color.

Herausgeber

Chryssis Georgiou

Verlag

Springer

Seitenzahl

550

Maße (L/B/H)

23,5/15,5/3,1 cm

Gewicht

855 g

Sprache

Englisch

ISBN

978-3-032-26464-0

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

25.05.2026

Abbildungen

XXI, 550 p. 82 illus., 37 illus. in color.

Herausgeber

Chryssis Georgiou

Verlag

Springer

Seitenzahl

550

Maße (L/B/H)

23,5/15,5/3,1 cm

Gewicht

855 g

Sprache

Englisch

ISBN

978-3-032-26464-0

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Structural Information and Communication Complexity

  • .- A Simple Distributed Deterministic Planar Separator.



    .- Maintaining Bipartite Colourings on Temporal Graphs on a Budget.



    .- Formal certification of ASYNC protocols: the case of Gathering in R
    2
    using Weber points.



    .- Equivalence and Separation between Heard-Of and Asynchronous Message-Passing Models



    .- Minimum Deviation Distance Realization.



    .- Online Bisection with Ring Demands.



    .- On the Solvability of Byzantine-tolerant Reliable Communication in Dynamic Networks.



    .- A Lightweight Approach for State Machine Replication.



    .- Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes.



    .- Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness.


    .- Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks.



    .- Fast distributed sampling of colorings of trees with few colors.



    .- Distributed Sparsest Cut via Eigenvalue Estimation.



    .- Cow Path by Finite Agent: Time vs Pebbles.



    .- Multiparty equality in the local broadcast model.



    .- Universal Dancing by Luminous Robots Under Sequential Schedulers.



    .- Polynomial Time Local Decision Revisited.



    .- Proving there is a leader without naming it.



    .- Fast Distributed Computation of Compact Routing Schemes.



    .- Online Exploration of Grid Graphs with Multiple Searchers.



    .- Towards Optimal Distributed Delta Coloring.



    .- Extending the writing distance: the R(dr)W(dw) communication model for self-stabilizing distributed algorithms.



    .- Indirect Coflow Scheduling.



    .- Byzantine Approximate Agreement Cross-chain Task.



    .- Asynchronous Fault-tolerant Mutual Visibility.



    .- Distributed MIS Algorithms for Rational Agents using Games.



    .- Uniform deployment of myopic luminous robots in rings.



    .- A Formalization of Knowledge in Fault Tolerant Distributed Algorithms.