Why Extension-Based Proofs Fail

Alistarh, Dan; Aspnes, James; Ellen, Faith; Gelashvili, Rati; Zhu, Leqi

doi:10.1137/20m1375851

Why Extension-Based Proofs Fail

Journal Article · 25 July 2023 · SIAM Journal on Computing

DOI:https://doi.org/10.1137/20m1375851· OSTI ID:2422443

Alistarh, Dan ^[1]; Aspnes, James ^[2]; ^[3]; Gelashvili, Rati ^[4]; Zhu, Leqi ^[5]

IST Austria, Klosterneuburg, 3400, Austria.; OSTI
Department of Computer Science, Yale University, New Haven, CT 06520-8285 USA.
Department of Computer Science, University of Toronto, Toronto, ON, M5S 3G4, Canada.
Aptos, Palo Alto, CA 94301 USA.
Department of EECS, University of Michigan, Ann Arbor, MI 48109 USA.

Not provided.

Research Organization:: Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)

Sponsoring Organization:: USDOE Office of Science (SC)

DOE Contract Number:: SC0008923

OSTI ID:: 2422443

Journal Information:: SIAM Journal on Computing, Journal Name: SIAM Journal on Computing Journal Issue: 4 Vol. 52; ISSN 0097-5397

Publisher:: Society for Industrial and Applied Mathematics (SIAM)

Country of Publication:: United States

Language:: English

References (15)

Tight bounds for k -set agreement Chaudhuri, Soma; Erlihy, Maurice; Lynch, Nancy A. Journal of the ACM, Vol. 47, Issue 5 https://doi.org/10.1145/355483.355489	journal	September 2000
New combinatorial topology bounds for renaming: the lower bound Castañeda, Armando; Rajsbaum, Sergio Distributed Computing, Vol. 22, Issue 5-6 https://doi.org/10.1007/s00446-010-0108-2	journal	June 2010
Convergence and covering on graphs for wait-free robots Castañeda, Armando; Rajsbaum, Sergio; Roy, Matthieu Journal of the Brazilian Computer Society, Vol. 24, Issue 1 https://doi.org/10.1186/s13173-017-0065-8	journal	January 2018
More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems Chaudhuri, S. Information and Computation, Vol. 105, Issue 1 https://doi.org/10.1006/inco.1993.1043	journal	July 1993
Atomic snapshots of shared memory Afek, Yehuda; Attiya, Hagit; Dolev, Danny Journal of the ACM, Vol. 40, Issue 4 https://doi.org/10.1145/153724.153741	journal	September 1993
The topological structure of asynchronous computability Herlihy, Maurice; Shavit, Nir Journal of the ACM, Vol. 46, Issue 6 https://doi.org/10.1145/331524.331529	journal	November 1999
Wait-free synchronization Herlihy, Maurice ACM Transactions on Programming Languages and Systems, Vol. 13, Issue 1 https://doi.org/10.1145/114005.102808	journal	January 1991
Toward a Topological Characterization of Asynchronous Complexity Hoest, Gunnar; Shavit, Nir SIAM Journal on Computing, Vol. 36, Issue 2 https://doi.org/10.1137/S0097539701397412	journal	January 2006
Impossibility of distributed consensus with one faulty process Fischer, Michael J.; Lynch, Nancy A.; Paterson, Michael S. Journal of the ACM, Vol. 32, Issue 2 https://doi.org/10.1145/3149.214121	journal	April 1985
An Overview of Synchronous Message-Passing and Topology Herlihy, Maurice; Rajsbaum, Sergio; Tuttle, Mark R. Electronic Notes in Theoretical Computer Science, Vol. 39, Issue 2 https://doi.org/10.1016/S1571-0661(05)01148-5	journal	January 2000
Wait-Free k -Set Agreement is Impossible: The Topology of Public Knowledge Saks, Michael; Zaharoglou, Fotios SIAM Journal on Computing, Vol. 29, Issue 5 https://doi.org/10.1137/S0097539796307698	journal	January 2000
A Layered Analysis of Consensus Moses, Yoram; Rajsbaum, Sergio SIAM Journal on Computing, Vol. 31, Issue 4 https://doi.org/10.1137/S0097539799364006	journal	January 2002
The Combinatorial Structure of Wait-Free Solvable Tasks Attiya, Hagit; Rajsbaum, Sergio SIAM Journal on Computing, Vol. 31, Issue 4 https://doi.org/10.1137/S0097539797330689	journal	January 2002
Exponential lower bounds for the pigeonhole principle Pitassi, Toniann; Beame, Paul; Impagliazzo, Russell Computational Complexity, Vol. 3, Issue 2 https://doi.org/10.1007/BF01200117	journal	June 1993
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems Herlihy, Maurice; Rajsbaum, Sergio; Tuttle, Mark Electronic Notes in Theoretical Computer Science, Vol. 230 https://doi.org/10.1016/j.entcs.2009.02.018	journal	March 2009

Similar Records

Revisiting diffusion-based moisture functions: why do they fail?

Journal Article · 2021 · Soil Biology and Biochemistry · OSTI ID:1840751

Why a fire flood project failed

Journal Article · 1966 · World Oil; (United States) · OSTI ID:6569525

Related Subjects

Computer Science
Mathematics

Why Extension-Based Proofs Fail

Citation Formats

References (15)

Similar Records

Related Subjects