Stabilization, Safety, and Security of Distributed Systems: 19th International Symposium, SSS 2017, Boston, MA, USA, November 5–8, 2017, Proceedings: Lecture Notes in Computer Science, cartea 10616
Editat de Paul Spirakis, Philippas Tsigasen Limba Engleză Paperback – 7 oct 2017
The 29 revised full papers presented together with 8 revised short papers were carefully reviewed and selected from 68 initial submissions. This year the Symposium was organized into three tracks reflecting major trends related to self-* systems: Stabilizing Systems: Theory and Practice: Distributed Computing and Communication Networks; and Computer Security and Information Privacy.
Din seria Lecture Notes in Computer Science
- 15%
Preț: 558.12 lei - 20%
Preț: 573.45 lei - 20%
Preț: 330.54 lei - 20%
Preț: 620.33 lei - 20%
Preț: 400.77 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 629.71 lei - 20%
Preț: 328.94 lei - 20%
Preț: 375.72 lei - 20%
Preț: 568.70 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 489.11 lei - 20%
Preț: 560.93 lei - 20%
Preț: 731.97 lei - 20%
Preț: 563.29 lei - 20%
Preț: 403.00 lei - 20%
Preț: 782.57 lei - 20%
Preț: 336.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 850.42 lei - 20%
Preț: 432.78 lei - 20%
Preț: 342.61 lei - 20%
Preț: 631.96 lei - 20%
Preț: 904.16 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 487.46 lei - 20%
Preț: 400.17 lei - 20%
Preț: 984.64 lei - 20%
Preț: 556.96 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 793.92 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 679.09 lei - 20%
Preț: 558.53 lei - 20%
Preț: 327.36 lei - 20%
Preț: 340.04 lei - 20%
Preț: 327.36 lei - 20%
Preț: 560.93 lei - 20%
Preț: 324.19 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 735.28 lei - 20%
Preț: 373.80 lei -
Preț: 395.25 lei - 20%
Preț: 488.90 lei - 20%
Preț: 293.24 lei
Preț: 329.91 lei
Preț vechi: 412.39 lei
-20%
Puncte Express: 495
Preț estimativ în valută:
58.32€ • 69.17$ • 50.59£
58.32€ • 69.17$ • 50.59£
Carte tipărită la comandă
Livrare economică 11-25 martie
Specificații
ISBN-13: 9783319690834
ISBN-10: 3319690833
Pagini: 496
Ilustrații: XIII, 496 p. 82 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.71 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
ISBN-10: 3319690833
Pagini: 496
Ilustrații: XIII, 496 p. 82 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.71 kg
Ediția:1st ed. 2017
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
Proof-Labeling Schemes: Broadcast, Unicast and in Between.- Self-Stabilizing Rendezvous of Synchronous Mobile Agents in Graphs.- The Dynamics and Stability of Probabilistic Population Processes.- Self-stabilizing Distributed Stable Marriage.- Computing the Fault-Containment Time of Self-Stabilizing Algorithms Using Markov Chains and Lumping.- Self-Tuning Eventually-Consistent Data Stores.- An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm under Distributed Daemon for Arbitrary Networks.- An Improved Approximate Agreement Algorithm in the Presence of
Mobile Byzantine Faults.- Fault-Induced Dynamics of Oblivious Robots on a Line.- Relaxed Data Types as Consistency Conditions.- Ant-Inspired Dynamic Task Allocation via Gossiping.- Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited visibility.- Robust Routing Made Easy.- Generalized Paxos Made Byzantine (and Less Complex).- ASSESS: A Tool for Automated Synthesisof Distributed Self-Stabilizing Algorithms.- How to Simulate Message-passing Algorithms in mobile agent systems with faults.- A Self-Stabilizing General De Bruijn Graph.- Constant-Time Complete Visibility for Asynchronous Robots with Lights.- On Security Analysis of Proof-of-Elapsed-Time (PoET).- Brief Announcement: Federated Code Auditing and Delivery for MPC.- Brief Announcement: Reduced Space Self-stabilizing Center Finding Algorithms in Chains and Trees.- A Fully Asynchronous and Fault Tolerant Distributed Algorithm to Compute a Minimum Graph Orientation.- Universally Optimal Gathering under Limited Visibility.- Optimum Algorithm for Mutual Visibility among Asynchronous Robots with Lights.- Brief Announcement: ZeroBlock: Timestamp-Free Prevention of Block-Withholding Attack in Bitcoin.- Scalable Funding of Bitcoin Micropayment Channel Networks.- Brief Announcement: A Self-stabilizing Algorithm for the Minimal Generalized Dominating Set Problem.- Space-Optimal Proportion Consensuswith Population Protocols.- Brief Announcement: Asynchronous, Distributed Optical Mutual Exclusion.- Brief Announcement: Passive and Active Attacks on Audience Response Systems Using Software Defined Radios.- Cryptocurrency Smart Contracts for Distributed Consensus of Public Randomness.- TorBricks: Blocking-Resistant Tor Bridge Distribution.- Cover Time in Edge-Uniform Stochastically-Evolving Graphs.- Bitcoin a Distributed Shared Register.- Broadcast Encryption with Both Temporary and Permanent Revocation.- Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights.- Brief Announcement: Space-efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings.
Mobile Byzantine Faults.- Fault-Induced Dynamics of Oblivious Robots on a Line.- Relaxed Data Types as Consistency Conditions.- Ant-Inspired Dynamic Task Allocation via Gossiping.- Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited visibility.- Robust Routing Made Easy.- Generalized Paxos Made Byzantine (and Less Complex).- ASSESS: A Tool for Automated Synthesisof Distributed Self-Stabilizing Algorithms.- How to Simulate Message-passing Algorithms in mobile agent systems with faults.- A Self-Stabilizing General De Bruijn Graph.- Constant-Time Complete Visibility for Asynchronous Robots with Lights.- On Security Analysis of Proof-of-Elapsed-Time (PoET).- Brief Announcement: Federated Code Auditing and Delivery for MPC.- Brief Announcement: Reduced Space Self-stabilizing Center Finding Algorithms in Chains and Trees.- A Fully Asynchronous and Fault Tolerant Distributed Algorithm to Compute a Minimum Graph Orientation.- Universally Optimal Gathering under Limited Visibility.- Optimum Algorithm for Mutual Visibility among Asynchronous Robots with Lights.- Brief Announcement: ZeroBlock: Timestamp-Free Prevention of Block-Withholding Attack in Bitcoin.- Scalable Funding of Bitcoin Micropayment Channel Networks.- Brief Announcement: A Self-stabilizing Algorithm for the Minimal Generalized Dominating Set Problem.- Space-Optimal Proportion Consensuswith Population Protocols.- Brief Announcement: Asynchronous, Distributed Optical Mutual Exclusion.- Brief Announcement: Passive and Active Attacks on Audience Response Systems Using Software Defined Radios.- Cryptocurrency Smart Contracts for Distributed Consensus of Public Randomness.- TorBricks: Blocking-Resistant Tor Bridge Distribution.- Cover Time in Edge-Uniform Stochastically-Evolving Graphs.- Bitcoin a Distributed Shared Register.- Broadcast Encryption with Both Temporary and Permanent Revocation.- Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights.- Brief Announcement: Space-efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings.
Caracteristici
Includes supplementary material: sn.pub/extras