Stabilization, safety, and security of distributed systems : 21st International Symposium, SSS 2019, Pisa, Italy, October 22-25, 2019, Proceedings /: 21st International Symposium, SSS 2019, Pisa, Italy, October 22-25, 2019, Proceedings. (2019)
- Record Type:
- Book
- Title:
- Stabilization, safety, and security of distributed systems : 21st International Symposium, SSS 2019, Pisa, Italy, October 22-25, 2019, Proceedings /: 21st International Symposium, SSS 2019, Pisa, Italy, October 22-25, 2019, Proceedings. (2019)
- Main Title:
- Stabilization, safety, and security of distributed systems : 21st International Symposium, SSS 2019, Pisa, Italy, October 22-25, 2019, Proceedings
- Other Titles:
- SSS 2019
- Further Information:
- Note: Mohsen Ghaffari, Mikhail Nesterenko, Sébastien Tixeuil, Sara Tucci, Yukiko Yamauchi (eds.).
- Editors:
- Ghaffari, Mohsen
Nesterenko, Mikhail V
Tixeuil, Sébastien
Tucci, Sara
Yamauchi, Yukiko - Other Names:
- SSS (Symposium), 21st
- Contents:
- Invited Paper: On the Characterization of Blockchain Consensus under Incentives.- Brief announcement: Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots.- Stationary and Deterministic Leader Election in Self-Organizing Particle Systems.- Robust Privacy-Preserving Gossip Averaging.- Synchronous t-Resilient Consensus in Arbitrary Graphs.- Tasks in Modular Proofs of Concurrent Algorithms.- On Gathering of Semi-Synchronous Robots in Graphs.- Brief Announcement: Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree Construction.- Brief Announcement: Distributed Computing in the Asynchronous LOCAL model.- An Environment for Specifying and Model Checking Mobile Ring Robot Algorithms.- Brief Announcement: Self-Stabilizing LCM Schedulers for Autonomous Mobile Robots using Neighborhood Mutual Remainder.- Reducing the Number of Messages in Self-stabilizing Protocols.- A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.- Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view.- iperfTZ: Understanding Network Bottlenecks for TrustZone-based Trusted Applications.- Atomic Cross-Chain Swaps with Improved Space and Local Time Complexity.- Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems.- Improved-Zigzag: An improved local-information based self-optimizing routing algorithm in virtual grid networks.- Fault TolerantInvited Paper: On the Characterization of Blockchain Consensus under Incentives.- Brief announcement: Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots.- Stationary and Deterministic Leader Election in Self-Organizing Particle Systems.- Robust Privacy-Preserving Gossip Averaging.- Synchronous t-Resilient Consensus in Arbitrary Graphs.- Tasks in Modular Proofs of Concurrent Algorithms.- On Gathering of Semi-Synchronous Robots in Graphs.- Brief Announcement: Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree Construction.- Brief Announcement: Distributed Computing in the Asynchronous LOCAL model.- An Environment for Specifying and Model Checking Mobile Ring Robot Algorithms.- Brief Announcement: Self-Stabilizing LCM Schedulers for Autonomous Mobile Robots using Neighborhood Mutual Remainder.- Reducing the Number of Messages in Self-stabilizing Protocols.- A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.- Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view.- iperfTZ: Understanding Network Bottlenecks for TrustZone-based Trusted Applications.- Atomic Cross-Chain Swaps with Improved Space and Local Time Complexity.- Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems.- Improved-Zigzag: An improved local-information based self-optimizing routing algorithm in virtual grid networks.- Fault Tolerant Network Constructors.- Ring Exploration of Myopic Luminous Robots with Visibility More than One.- Brief Announcement: Self-Stabilizing Construction of a Minimal Weakly nmathcal{ST}-Reachable Directed Acyclic Graph.- Adaptive Versioning in Transactional Memories.- Brief Announcement: Blockguard: Adaptive Blockchain Security.- Brief Announcement: Fully Anonymous Shared Memory Algorithms.- A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus.- Logarithmic Expected-Time Leader Election in Population Protocol Model.- A Self-stabilizing 1-maximal Independent Set Algorithm.- Black hole search despite Byzantine agents.- Self-Adjusting Linear Networks. … (more)
- Publisher Details:
- Cham, Switzerland : Springer
- Publication Date:
- 2019
- Extent:
- 1 online resource (xxiii, 384 pages), illustrations (some color)
- Subjects:
- 004/.36
Self-stabilization (Computer science) -- Congresses
Electronic data processing -- Distributed processing -- Safety measures -- Congresses
Computer security -- Congresses
Electronic books - Languages:
- English
- ISBNs:
- 9783030349929
3030349926 - Related ISBNs:
- 9783030349912
- Notes:
- Note: Online resource; title from PDF title page (SpringerLink, viewed November 20, 2019).
- Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.472547
- Ingest File:
- 03_026.xml