Cantitate/Preț
Produs

Stabilization, Safety, and Security of Distributed Systems: 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings: Lecture Notes in Computer Science, cartea 13751

Editat de Stéphane Devismes, Franck Petit, Karine Altisen, Giuseppe Antonio Di Luna, Antonio Fernandez Anta
en Limba Engleză Paperback – 9 noi 2022
This book constitutes the proceedings of 24th International Symposium, SSS 2022, which took place in Clermont-Ferrand, France, in November 2022. The 17 regular papers together with 4 invited papers and 7 brief announcements,  included in this volume were carefully reviewed and selected from 58 submissions. The SSS 2022 focus on systems built such that they are able to provide on their own guarantees on their structure, performance, and/or security in the face of an adverse environment. The Symposium presents three tracks reflecting major trends related to the conference: (i) Self-stabilizing Systems: Theory and Practice, (ii) Concurrent and Distributed Computing: Foundations, Faulttolerance, and Security, and (iii) Dynamic, Mobile, and Nature-Inspired Computing.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 49737 lei

Preț vechi: 62172 lei
-20% Nou

Puncte Express: 746

Preț estimativ în valută:
9519 9887$ 7907£

Carte tipărită la comandă

Livrare economică 01-15 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031210167
ISBN-10: 3031210166
Pagini: 372
Ilustrații: X, 372 p. 79 illus., 55 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.54 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.