Why Extension-Based Proofs Fail

v1v2v3 (latest)

Why Extension-Based Proofs Fail

4 November 2018

Dan Alistarh

Rati Gelashvili

ArXiv (abs)PDF HTML

Papers citing "Why Extension-Based Proofs Fail"

8 / 8 papers shown

Title
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks Hagit Attiya Pierre Fraigniaud A. Paz S. Rajsbaum LRM 73 3 0 08 Aug 2023
Quorum Subsumption for Heterogeneous Quorum Systems Xiao Li Eric Chan M. Lesani 59 6 0 11 Apr 2023
Topological Characterization of Task Solvability in General Models of Computation Hagit Attiya Armando Castañeda Thomas Nowak 20 4 0 31 Jan 2023
Reaching Agreement Among $k$ out of $n$ Processes G. Taubenfeld 49 0 0 10 May 2022
Wait-free approximate agreement on graphs Dan Alistarh Faith Ellen Joel Rybicki 32 17 0 16 Mar 2021
Locally Solvable Tasks and the Limitations of Valency Arguments Hagit Attiya Armando Castañeda S. Rajsbaum LRM 31 13 0 20 Nov 2020
K set-agreement bounds in round-based models through combinatorial topology A. Shimi Armando Castañeda 71 2 0 05 Mar 2020
A Topological Perspective on Distributed Network Algorithms Armando Castañeda Pierre Fraigniaud A. Paz S. Rajsbaum Matthieu Roy Corentin Travers 58 25 0 08 Jul 2019