Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Stabilization, Safety, and Security of Distributed Systems [[electronic resource] ] : 21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings / / edited by Mohsen Ghaffari, Mikhail Nesterenko, Sébastien Tixeuil, Sara Tucci, Yukiko Yamauchi
| Stabilization, Safety, and Security of Distributed Systems [[electronic resource] ] : 21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings / / edited by Mohsen Ghaffari, Mikhail Nesterenko, Sébastien Tixeuil, Sara Tucci, Yukiko Yamauchi |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XXIII, 384 p. 304 illus., 54 illus. in color.) |
| Disciplina | 004.2 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Computer systems Computers, Special purpose Operating systems (Computers) Application software Computer science—Mathematics Computer Communication Networks Computer System Implementation Special Purpose and Application-Based Systems Operating Systems Computer and Information Systems Applications Mathematics of Computing |
| ISBN | 3-030-34992-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 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. |
| Record Nr. | UNISA-996466310603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Stabilization, Safety, and Security of Distributed Systems : 21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings / / edited by Mohsen Ghaffari, Mikhail Nesterenko, Sébastien Tixeuil, Sara Tucci, Yukiko Yamauchi
| Stabilization, Safety, and Security of Distributed Systems : 21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings / / edited by Mohsen Ghaffari, Mikhail Nesterenko, Sébastien Tixeuil, Sara Tucci, Yukiko Yamauchi |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XXIII, 384 p. 304 illus., 54 illus. in color.) |
| Disciplina |
004.2
004.36 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Computer systems Computers, Special purpose Operating systems (Computers) Application software Computer science—Mathematics Computer Communication Networks Computer System Implementation Special Purpose and Application-Based Systems Operating Systems Computer and Information Systems Applications Mathematics of Computing |
| ISBN | 3-030-34992-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 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. |
| Record Nr. | UNINA-9910357844803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||