Produktbild: Stabilization, Safety, and Security of Distributed Systems
Band 13751 - 11%

Stabilization, Safety, and Security of Distributed Systems 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings

11% sparen

72,99 € UVP 82,49 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

09.11.2022

Abbildungen

X, 372 p. 79 illus., 55 illus. in color.

Herausgeber

Stéphane Devismes + weitere

Verlag

Springer

Seitenzahl

372

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

581 g

Auflage

1st ed. 2022

Sprache

Englisch

ISBN

978-3-031-21016-7

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

09.11.2022

Abbildungen

X, 372 p. 79 illus., 55 illus. in color.

Herausgeber

Verlag

Springer

Seitenzahl

372

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

581 g

Auflage

1st ed. 2022

Sprache

Englisch

ISBN

978-3-031-21016-7

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

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: Stabilization, Safety, and Security of Distributed Systems
  • Plateau: A Secure and Scalable Overlay Network for Large Distributed Trust Applications.- The Limits of Helping in Non-Volatile Memory Data Structures Treasure Hunt in Graph using Pebbles.- Blockchain in Dynamic Networks.- Improving the Efficiency of Report and Trace Ring Signatures.- Flexible Scheduling of Transactional Memory on Trees.- Invited Paper: Simple, strict, proper, happy: A study of reachability in temporal graphs.- Brief Announcement: Dynamic graph models for the Bitcoin P2P network: simulation analysis for expansion and flooding time.- Brief Announcement: Self Masking for Hardening Inversions.- Perpetual Torus Exploration by Myopic Luminous Robots.- Optimal Algorithms for Synchronous Byzantine k-Set Agreement.- Reaching Consensus in the Presence of Contention-Related Crash Failures.- Self-stabilizing Byzantine Fault-tolerant Repeated Reliable Broadcast.- Capacity Planning for Dependable Services.- Lower bound for constant-size local certification.- Collaborative Dispersion by Silent Robots.- Time Optimal Gathering of Myopic Robots on an Infinite Triangular Grid.- Brief Announcement: Lattice Linear Algorithms.- Brief Announcement: Distributed Reconfiguration of Spanning Trees.- Brief Announcement: Mutually-visible Uniform Circle Formation by Asynchronous Mobile Robots on Grid Plane.- Brief Announcement: Self-stabilizing Total-order Broadcast.- Brief Announcement: Secure And Efficient Participant Authentication — Application to Mobile E-voting.- Card-Based ZKP Protocol for Nurimisaki.- Invited Paper: One Bit Agent Memory is Enough for Snap-stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles Consensus on Demand.- Better Incentives for Proof-of-Work.- Invited Paper: Towards Practical Atomic Distributed Shared Memory: An Experimental Evaluation.- Invited Paper: Cross-Chain State Machine Replication.