Masuzawa / Katayama / Kakugawa | Stabilization, Safety, and Security of Distributed Systems | Buch | 978-3-031-74497-6 | sack.de

Buch, Englisch, Band 14931, 468 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 815 g

Reihe: Lecture Notes in Computer Science

Masuzawa / Katayama / Kakugawa

Stabilization, Safety, and Security of Distributed Systems

26th International Symposium, SSS 2024, Nagoya, Japan, October 20-22, 2024, Proceedings
2025
ISBN: 978-3-031-74497-6
Verlag: Springer Nature Switzerland

26th International Symposium, SSS 2024, Nagoya, Japan, October 20-22, 2024, Proceedings

Buch, Englisch, Band 14931, 468 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 815 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-031-74497-6
Verlag: Springer Nature Switzerland


This book constitutes the proceedings of the 26th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2024, held in Nagoya, Japan, during October 20-22, 2024.

The 22 full and 4 invited papers as well as 6 short papers included in this book were carefully reviewed and selected from 69 submissions. They 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. The book also includes one invited talk in full paper length.

Masuzawa / Katayama / Kakugawa Stabilization, Safety, and Security of Distributed Systems jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Keynote.- On Distributed Computing: A View, Physical vs Logical Objects, and a Look at Fully Anonymous Systems.- Invited Papers.- Invited Paper: A Survey of the Impact of Knowledge on the Competitive.- Ratio in Linear Search.- Invited Paper: Gathering Oblivious Robots in the Plane.- Invited Paper: The Smart Contract Model.- Invited Paper: Using signed formulas for online certification.- Papers.- Optimal Asynchronous Perpetual Grid Exploration.- Gathering of Robots in Butterfly Networks.- Brief Announcement: Pebble Guided Rendezvous Despite Fault.- Complete Graph Identification in Population Protocols.- Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots.- Brief Announcement: Perpetual Exploration of Triangular Grid by Myopic Oblivious Robots without Chirality.- An optimal algorithm for geodesic mutual visibility on hexagonal grids.- Coating in SILBOT with One Axis Agreement.- Rendezvous and Merging for Two Metamorphic Robotic Systems without Global Compass.- Gathering Semi-Synchronously Scheduled Two-State Robots.- Selective Population Protocols.- Partially Disjoint Shortest Paths and Near-Shortest Paths Trees.- Brief Announcement: Towards Proportionate Fair Assignment.- BlindexTEE: A Blind Index Approach towards TEE-supported End-to-end Encrypted DBMS.- Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion.- Adding All Flavors: A Hybrid Random Number Generator for dApps and Web3.- SUPI-Rear: Privacy-Preserving Subscription Permanent Identification Strategy in 5G-AKA.- Anomaly Detection Within Mission-Critical Call Processing.- Brief Announcement: Make Master Private-Keys Secure by Keeping it Public.- Selection Guidelines for Geographical SMR Protocols: A Communication Pattern-based Latency Modeling Approach.- Byzantine Reliable Broadcast with One Trusted Monotonic Counter.- Brief Announcement: On the Feasibility of Local Failover Routing on Directed Graphs.- TRAIL: Cross-Shard Validation for Byzantine Shard Protection.- Softening the Impact of Collisions in Contention Resolution.- Generating the Convergence Stairs of the Collatz Program.- Consensus Through Knot Discovery in Asynchronous Dynamic Networks.- A Self-Stabilizing Algorithm for the 1-Minimal Minus Domination Problem.- Brief Announcement: A Self-* and Persistent Hub Sampling Service.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.