Why Extension-Based Proofs Fail (Q6115415): Difference between revisions

@@ Property / cites work @@
+Atomic snapshots of shared memory
@@ Property / cites work: Atomic snapshots of shared memory / rank @@
+Normal rank
@@ Property / cites work @@
+Why extension-based proofs fail
@@ Property / cites work: Why extension-based proofs fail / rank @@
+Normal rank
@@ Property / cites work @@
+Brief Announcement: Why Extension-Based Proofs Fail
+Normal rank
@@ Property / cites work @@
+Wait-free approximate agreement on graphs
@@ Property / cites work: Wait-free approximate agreement on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Impossibility Results for Distributed Computing
@@ Property / cites work: Impossibility Results for Distributed Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Counting-Based Impossibility Proofs for Renaming and Set Agreement
+Normal rank
@@ Property / cites work @@
+The Combinatorial Structure of Wait-Free Solvable Tasks
+Normal rank
@@ Property / cites work @@
+Hardness of Distributed Optimization
@@ Property / cites work: Hardness of Distributed Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized FLP impossibility result for <i>t</i>-resilient asynchronous computations
+Normal rank
@@ Property / cites work @@
+Immediate atomic snapshots and fast renaming
@@ Property / cites work: Immediate atomic snapshots and fast renaming / rank @@
+Normal rank
@@ Property / cites work @@
+A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
+Normal rank
@@ Property / cites work @@
+New combinatorial topology bounds for renaming: the lower bound
+Normal rank
@@ Property / cites work @@
+More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
+Normal rank
@@ Property / cites work @@
+Tight bounds for             <i>k</i>             -set agreement
@@ Property / cites work: Tight bounds for <i>k</i> -set agreement / rank @@
+Normal rank
@@ Property / cites work @@
+Revisionist Simulations
@@ Property / cites work: Revisionist Simulations / rank @@
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+Q2703723
@@ Property / cites work: Q2703723 / rank @@
+Normal rank
@@ Property / cites work @@
+An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
+Normal rank
@@ Property / cites work @@
+The topological structure of asynchronous computability
+Normal rank
@@ Property / cites work @@
+Toward a Topological Characterization of Asynchronous Complexity
+Normal rank
@@ Property / cites work @@
+A Layered Analysis of Consensus
@@ Property / cites work: A Layered Analysis of Consensus / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential lower bounds for the pigeonhole principle
+Normal rank
@@ Property / cites work @@
+Wait-Free <i>k</i>-Set Agreement is Impossible: The Topology of Public Knowledge
+Normal rank