Wait-free approximate agreement on graphs
From MaRDI portal
Publication:5918635
DOI10.1007/978-3-030-79527-6_6OpenAlexW3173988940MaRDI QIDQ5918635
Dan Alistarh, Joel Rybicki, Faith Ellen
Publication date: 22 March 2022
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.08949
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- Multidimensional agreement in Byzantine systems
- Easy impossibility proofs for distributed consensus problems
- On local convexity in graphs
- On diameters and radii of bridged graphs
- Asynchronous approximate agreement
- A polytopal generalization of Sperner's lemma
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies
- Round-by-round fault detectors (extended abstract)
- Distributed Computing by Mobile Robots: Gathering
- The topological structure of asynchronous computability
- Toward a Topological Characterization of Asynchronous Complexity
- Reaching approximate agreement in the presence of faults
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Are wait-free algorithms fast?
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- The BG distributed simulation algorithm
- Tight Bounds for Asymptotic and Approximate Consensus
- Why extension-based proofs fail
- Generalized FLP impossibility result for t-resilient asynchronous computations
- The asynchronous computability theorem for t-resilient tasks
- Distributed computability in Byzantine asynchronous systems
- A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Principles of Distributed Systems
- Brief Announcement: Why Extension-Based Proofs Fail
