Distributed Algorithms for Message-Passing Systems
From MaRDI portal
Publication:2841748
DOI10.1007/978-3-642-38123-2zbMath1282.68004OpenAlexW564832898MaRDI QIDQ2841748
Publication date: 29 July 2013
Full work available at URL: https://doi.org/10.1007/978-3-642-38123-2
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (18)
Strong eventual consistency of the collaborative editing framework WOOT ⋮ On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency ⋮ A visit to mutual exclusion in seven dates ⋮ On the diversity of asynchronous communication ⋮ Communication Patterns and Input Patterns in Distributed Computing ⋮ Reasoning about knowledge and messages in asynchronous multi-agent systems ⋮ Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems ⋮ A symmetry-based splitting strategy for discretizable distance geometry problems ⋮ Optimal algorithms for synchronous Byzantine \(k\)-set agreement ⋮ Optimal algorithms for synchronous Byzantine \(k\)-set agreement ⋮ On certifying distributed algorithms: problem of local correctness ⋮ Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ Transition scale-spaces: A computational theory for the discretized entorhinal cortex ⋮ Time-efficient read/write register in crash-prone asynchronous message-passing systems ⋮ Crash-tolerant causal broadcast in \(O(n)\) messages ⋮ Unnamed Item ⋮ A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring ⋮ Election in fully anonymous shared memory systems: tight space bounds and algorithms
This page was built for publication: Distributed Algorithms for Message-Passing Systems
