1  20
Next
 Choudhury, Ashish, author.
 Cham : Springer, [2022]
 Description
 Book — 1 online resource (xiii, 231 pages) : illustrations (some color).
 Summary

 Introduction. Relevant Topics from Abstract Algebra. Secret Sharing. A Toy MPC Protocol. The BGW PerfectlySecure MPC Protocol for Linear Functions. The BGW PerfectlySecure MPC Protocol for Any Arbitrary Function. PerfectlySecure MPC in the PreProcessing Model. PerfectlySecure MPC Tolerating General Adversaries. PerfectlySecure MPC for Small Number of parties. The GMW MPC Protocol. Oblivious Transfer.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Altisen, Karine, author.
 Cham, Switzerland : Springer, 2019.
 Description
 Book — 1 online resource (167 pages)
 Summary

 Preface Acknowledgments Introduction Preliminaries Coloring under a Locally Central Unfair Daemon Synchronous Unison BFS Spanning Tree Under a Distributed Unfair Daemon Dijkstra's Token Ring Hierarchical Collateral Composition SelfStabilization in Message Passing Systems Bibliography Authors' Biographies Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Sakavalas, Dimitris.
 Cham, Switzerland : Springer, [2019]
 Description
 Book — 1 online resource (xxi, 153 pages) : illustrations
 Summary

 List of Figures List of Tables List of Algorithms Preface Acknowledgments Introduction Consensus and Network Topology Synchronous Crash Fault Tolerance Asynchronous Crash Fault Tolerance Byzantine Fault Tolerance Relay Depth and Approximate Consensus Broadcast Under Local Adversaries General Adversary Bibliography Authors' Biographies.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Vukolić, Marko.
 Cham, Switzerland : Springer, ©2012.
 Description
 Book — 1 online resource (xv, 130 pages) : illustrations
 Summary

 Introduction Preliminaries Classical Quorum Systems Classical QuorumBased Emulations Byzantine Quorum Systems Latencyefficient Quorum Systems Probabilistic Quorum Systems.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
5. Communication and agreement abstractions for faulttolerant asynchronous distributed systems [2010]
 Raynal, M. (Michel)
 Cham, Switzerland : Springer, ©2010.
 Description
 Book — 1 online resource (xxii, 251 pages) : illustrations
 Summary

 List of Figures The Atomic Register Abstraction Implementing an Atomic Register in a CrashProne Asynchronous System The Uniform Reliable Broadcast Abstraction Uniform Reliable Broadcast Abstraction Despite Unreliable Channels The Consensus Abstraction Consensus Algorithms for Asynchronous Systems Enriched with Various Failure Detectors Constructing Failure Detectors.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Kranakis, Evangelos.
 Cham, Switzerland : Springer, ©2010.
 Description
 Book — 1 online resource (xvi, 106 pages) : illustrations (some color)
 Summary

 1. Models for mobile agent computing
 Introduction
 What is a mobile agent
 Why mobile agents
 An algorithmic model for mobile agents
 Mobile agents
 Distributed networks
 Resource measures
 Mobile agent rendezvous
 Outline of the book
 Comments and bibliographic remarks.
 2. Deterministic rendezvous in a ring
 Introduction
 A single stationary token
 The feasibility of rendezvous
 The time complexity of rendezvous
 Memory tradeoff for rendezvous with detection
 Limits to the memory tradeoff
 Movable tokens
 Comments and bibliographic remarks.
 3. Multiple agent rendezvous in a ring
 Introduction
 Impossibility of rendezvous
 Rendezvous with detection
 Conditional solutions
 Comments and bibliographic remarks.
 4. Randomized rendezvous in a ring
 Introduction
 Random walk algorithm
 Randomization and tokens
 Time/memory tradeoffs
 Coin half tour algorithm
 Approximate counting algorithm
 Comments and bibliographic remarks.
 5. Other models
 Introduction
 Leader election and rendezvous
 Rendezvous with failing tokens
 Rendezvous when tokens fail upon release
 Rendezvous when tokens can fail at any time
 The cost of token failure
 Flickering tokens
 Asynchronous rendezvous
 Lookcomputemove
 Model and terminology
 Impossibility results
 Gathering configurations with a single multiplicity
 Gathering rigid configurations
 Gathering an odd number of robots
 Dangerous networks
 Blackhole search in an asynchronous ring
 Rendezvous in asynchronous rings in spite of a blackhole
 Comments and bibliographic remarks.
 6. Other topologies
 Introduction
 Synchronous torus
 Memory lower bounds for rendezvous
 Rendezvous algorithms
 Trees
 Arbitrary graphs
 Comments and bibliographic remarks.
 Bibliography
 Glossary
 Authors' biographies
 Index.
7. Distributed computing pearls [2018]
 Taubenfeld, Gadi, author.
 Cham, Switzerland : Springer, [2018]
 Description
 Book — 1 online resource (xv, 107 pages) : illustrations
 Summary

 Preface Acknowledgments Distributed Computing One Loaf of Bread, Please A Tale of Two Lovers A Night at the Movies The Fall of the Byzantine Empire Sightseeing in Paris Food for Thought All for One and One for All The World is a Playground Getting the Service You Deserve Bibliography Author's Biography Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Bloem, Roderick P., author.
 Cham, Switzerland : Springer, [2015]
 Description
 Book — 1 online resource (xi, 158 pages) : illustrations
 Summary

 Acknowledgments Introduction System Model and Specification Languages Standard Proof Machinery Tokenpassing Systems Rendezvous and Broadcast Guarded Protocols Ad Hoc Networks Related Work Parameterized Model Checking Tools Conclusions Bibliography Authors' Biographies.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Attiya, Hagit, author.
 Cham, Switzerland : Springer, [2014]
 Description
 Book — 1 online resource (xv, 146 pages) : illustrations
 Summary

 Acknowledgments Introduction Indistinguishability Shifting and Scaling Scenario Arguments Information Theory Arguments Covering Arguments Valency Arguments Combinatorial Arguments Reductions and Simulations Bibliography Authors' Biographies.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Barenboim, Leonid.
 Cham, Switzerland : Springer, ©2013.
 Description
 Book — 1 online resource (xiii, 157 pages) : illustrations
 Summary

 Acknowledgments Introduction Basics of Graph Theory Basic Distributed Graph Coloring Algorithns Lower Bounds ForestDecomposition Algorithms and Applications Defective Coloring Arbdefective Coloring EdgeColoring and Maximal Matching Network Decompositions Introduction to Distributed Randomized Algorithms Conclusion and Open Questions Bibliography Authors' Biographies.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
11. Link reversal algorithms [2012]
 Welch, Jennifer.
 Cham, Switzerland : Springer, ©2012.
 Description
 Book — 1 online resource (viii, 93 pages) : illustrations
 Summary

 Introduction Routing in a Graph: Correctness Routing in a Graph: Complexity Routing and Leader Election in a Distributed System Mutual Exclusion in a Distributed System Distributed Queueing Scheduling in a Graph Resource Allocation in a Distributed System Conclusion.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Georgiou, Chryssis.
 Cham, Switzerland : Springer, ©2011.
 Description
 Book — 1 online resource (ix, 155 pages) : illustrations
 Summary

 Introduction Distributed Cooperation and Adversity Paradigms and Techniques SharedMemory Algorithms MessagePassing Algorithms The DoAll Problem in Other Settings Bibliography Authors' Biographies.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
13. New models for population protocols [2011]
 Michail, Othon.
 Cham, Switzerland : Springer, ©2011.
 Description
 Book — 1 online resource (xvi, 140 pages) : illustrations
 Summary

 1. Population protocols
 Introduction
 A formal model
 Stable computation
 Computational complexity
 Overview of the content
 Organization of the text
 Exercises.
 2. The computational power of population protocols
 Semilinear sets and Presburger arithmetic
 Semilinear predicates are stably computable
 Stably computable predicates are semilinear
 Exercises.
 3. Enhancing the model
 Introduction
 Composition of protocols: stabilizing inputs
 Probabilistic population protocols
 Epidemics
 3state approximate majority protocol
 Virtual register machine simulation
 Community protocols
 The model
 Computational power
 Exercises.
 4. Mediated population protocols and symmetry
 Symmetric nondeterministic space (n2)
 Stable computation
 Predicates on input assignments
 Stably decidable network properties
 Weakly connected graphs
 Graphs not even weakly connected
 Exercises.
 5. Passively mobile machines that use restricted space
 The model and the power of log space
 A first inclusion for PMSPACE (log n)
 Assigning unique ids by reinitiating computation
 A better inclusion for PMSPACE (log n)
 An exact characterization for PMSPACE (log n)
 Below log space, above log space and a space hierarchy
 Behavior of the PM model for space o(log log n)
 The logarithmic predicate
 Exercises.
 6. Conclusions and open research directions
 Conclusions
 Open research directions
 Bibliography
 Acronyms
 Authors' biographies.
 Raynal, M. (Michel)
 Cham, Switzerland : Springer, ©2010.
 Description
 Book — 1 online resource (xxi, 167 pages : illustrations.
 Summary

 List of Figures Synchronous Model, Failure Models, and Agreement Problems Consensus and Interactive Consistency in the Crash Failure Model Expedite Decision in the Crash Failure Model Simultaneous Consensus Despite Crash Failures From Consensus to kSet Agreement NonBlocking Atomic Commit in Presence of Crash Failures kSet Agreement Despite Omission Failures Consensus Despite Byzantine Failures Byzantine Consensus in Enriched Models.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
15. Consistent distributed storage [2021]
 Gramoli, Vincent, author.
 San Rafael, California (1537 Fourth Street, 1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool Publishers, [2021]
 Description
 Book — 1 PDF (xv, 176 pages)
 Summary

 Acknowledgments Outline Introduction Model of Computation The Static Environment The SingleWriter Setting The MultipleWriter Setting The Dynamic Environment RAMBO: Reconfigurable Dynamic Memory RDS: Integrated Reconfigurations DynaStore: Incremental Reconfigurations Concluding Remarks and Looking Ahead Bibliography Authors' Biographies Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Altisen, Karine, author.
 [San Rafael, California] : Morgan & Claypool, [2019]
 Description
 Book — 1 PDF (xvii, 147 pages)
 Summary

 Preface Acknowledgments Introduction Preliminaries Coloring under a Locally Central Unfair Daemon Synchronous Unison BFS Spanning Tree Under a Distributed Unfair Daemon Dijkstra's Token Ring Hierarchical Collateral Composition SelfStabilization in Message Passing Systems Bibliography Authors' Biographies Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Sakavalas, Dimitris, author.
 [San Rafael, California] : Morgan & Claypool, [2019]
 Description
 Book — 1 PDF (xxi, 129 pages).
 Summary

 List of Figures List of Tables List of Algorithms Preface Acknowledgments Introduction Consensus and Network Topology Synchronous Crash Fault Tolerance Asynchronous Crash Fault Tolerance Byzantine Fault Tolerance Relay Depth and Approximate Consensus Broadcast Under Local Adversaries General Adversary Bibliography Authors' Biographies.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Sakavalas, Dimitris, author.
 [San Rafael, California] : Morgan & Claypool, [2019]
 Description
 Book — 1 PDF (xxi, 129 pages).
 Summary

 List of Figures List of Tables List of Algorithms Preface Acknowledgments Introduction Consensus and Network Topology Synchronous Crash Fault Tolerance Asynchronous Crash Fault Tolerance Byzantine Fault Tolerance Relay Depth and Approximate Consensus Broadcast Under Local Adversaries General Adversary Bibliography Authors' Biographies.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
19. Distributed computing pearls [2018]
 Taubenfeld, Gadi, author.
 [San Rafael, California] : Morgan & Claypool, 2018.
 Description
 Book — 1 PDF (xv, 107 pages).
 Summary

 Preface Acknowledgments Distributed Computing One Loaf of Bread, Please A Tale of Two Lovers A Night at the Movies The Fall of the Byzantine Empire Sightseeing in Paris Food for Thought All for One and One for All The World is a Playground Getting the Service You Deserve Bibliography Author's Biography Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
20. Decidability of parameterized verification [2015]
 Bloem, Roderick P., author.
 San Rafael, California (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool, 2015.
 Description
 Book — 1 PDF (xi, 158 pages).
 Summary

 Acknowledgments Introduction System Model and Specification Languages Standard Proof Machinery Tokenpassing Systems Rendezvous and Broadcast Guarded Protocols Ad Hoc Networks Related Work Parameterized Model Checking Tools Conclusions Bibliography Authors' Biographies.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.