Cantitate/Preț
Produs
Total produse
Vezi coșul
Stabilization, Safety, and Security of Distributed Systems: 22nd International Symposium, SSS 2020, Austin, TX, USA, November 18–21, 2020, Proceedings de Stéphane Devismes

Stabilization, Safety, and Security of Distributed Systems: 22nd International Symposium, SSS 2020, Austin, TX, USA, November 18–21, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12514

Editat de Stéphane Devismes, Neeraj Mittal
en Limba Engleză Paperback – 25 noi 2020
This book constitutes the refereed proceedings of the 22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2020, held in Austin, TX, USA, in November 2020. The 16 full papers, 7 short and 2 invited papers presented were carefully reviewed and selected from 44 submissions. The papers deal with the design and development of distributed systems with a focus on systems that are able to provide guarantees on their structure, performance, and/or security in the face of an adverse operational environment.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32166 lei

Preț vechi: 40208 lei
-20% Nou

Puncte Express: 482
Preț estimativ în valută:
5693€ • 6653$ • 4942£

Carte tipărită la comandă

Livrare economică 17 februarie-03 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030643478
ISBN-10: 3030643476
Pagini: 400
Ilustrații: XI, 323 p. 45 illus., 20 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.47 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement.- Invited Paper: Homomorphic Operations Techniques Yielding Communication Efficiency.- Boosting the E ciency of Byzantine-tolerant Reliable Communication.- Stand Up Indulgent Rendez-vous.- Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility.- A Discrete and Continuous Study of the Max-Chain-Formation Problem.- Reactive PLS for Distributed Decision.- k-Immediate Snapshot and x-Set Agreement: How Are They Related? .- Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs.- Silent MST approximation for tiny memory.- A Privacy-Preserving Collaborative Caching Approach in InformationCentric Networking.- A ne Tasks for k-Test-and-Set.- A Combinatorial Characterization of Self-Stabilizing Population Protocols.- Smoothed Analysis of Leader Election in Distributed Networks.- Brief Announcement: Byzantine Geoconsensus.- Brief Announcement: Veri able Data Sharing In Distributed Computing.- Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots.- Brief Announcement: Leader Election in the ADD Communication Model.- Physical Zero-Knowledge Proof for Suguru Puzzle.- Uniform deployment of mobile agents in dynamic rings.- Partial Gathering of Mobile Robots from Multiplicity-Allowed Congurations in Rings.- Efficient Dispersion of Mobile Agents without Global Knowledge.- Brief Announcement: TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware.- Time-Optimal Self-Stabilizing Leader Election on Rings in Population Protocols.- Brief Announcement: Effiectiveness of Code Hardening for Fault-Tolerant IoT Software.