1 option
Stabilization, Safety, and Security of Distributed Systems : 26th International Symposium, SSS 2024, Nagoya, Japan, October 20–22, 2024, Proceedings / edited by Toshimitsu Masuzawa, Yoshiaki Katayama, Hirotsugu Kakugawa, Junya Nakamura, Yonghwan Kim.
Springer Nature - Springer Computer Science (R0) eBooks 2025 English International Available online
View online- Format:
- Book
- Series:
- Lecture Notes in Computer Science, 1611-3349 ; 14931
- Language:
- English
- Subjects (All):
- Computer networks.
- Robotics.
- Software engineering.
- Operating systems (Computers).
- Microprogramming.
- Data structures (Computer science).
- Information theory.
- Computer Communication Networks.
- Software Engineering.
- Operating Systems.
- Control Structures and Microprogramming.
- Data Structures and Information Theory.
- Local Subjects:
- Computer Communication Networks.
- Robotics.
- Software Engineering.
- Operating Systems.
- Control Structures and Microprogramming.
- Data Structures and Information Theory.
- Physical Description:
- 1 online resource (477 pages)
- Edition:
- 1st ed. 2025.
- Place of Publication:
- Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
- Summary:
- 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. .
- Contents:
- 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.
- Notes:
- Includes bibliographical references and index.
- ISBN:
- 9783031744983
- 3031744985
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.