The topology of distributed adversaries
From MaRDI portal
Publication:360277
DOI10.1007/s00446-013-0189-9zbMath1285.68013OpenAlexW1976163479MaRDI QIDQ360277
Sergio Rajsbaum, Maurice P. Herlihy
Publication date: 26 August 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-013-0189-9
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)
Related Items
Collapsibility of read/write models using discrete Morse theory, The solvability of consensus in iterated models extended with safe-consensus, The computational structure of progress conditions and shared objects, Untangling Partial Agreement: Iterated x-consensus Simulations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The disagreement power of an adversary
- On interprocess communication. I: Basic formalism
- A lower bound for the time to assure interactive consistency
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- A Layered Analysis of Consensus
- Unifying synchronous and asynchronous message-passing models
- Round-by-round fault detectors (extended abstract)
- An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
- An Equivariance Theorem with Applications to Renaming
- Simulations and reductions for colorless tasks
- Fast set agreement in the presence of timing uncertainty
- Tight bounds for k -set agreement
- Authenticated Algorithms for Byzantine Agreement
- Structured Derivation of Semi-Synchronous Algorithms
- The topological structure of asynchronous computability
- Renaming in an asynchronous environment
- Knowledge and common knowledge in a distributed environment
- A combinatorial characterization of the distributed 1-solvable tasks
- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
- Concurrent Computing and Shellable Complexes
- Impossibility of distributed consensus with one faulty process
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Three-Processor Tasks Are Undecidable
- Atomic snapshots of shared memory
- Bounds on the time to reach agreement in the presence of timing uncertainty
- Algebraic spans
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- The topology of shared-memory adversaries
- Set consensus using arbitrary objects (preliminary version)
- A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
- Immediate atomic snapshots and fast renaming
- Combinatorial algebraic topology
