An equivariance theorem with applications to renaming (Q486986): Difference between revisions

@@ Property / OpenAlex ID @@
+W2157325951
@@ Property / OpenAlex ID: W2157325951 / rank @@
+Normal rank
@@ Property / cites work @@
+Renaming in an asynchronous environment
@@ Property / cites work: Renaming in an asynchronous environment / rank @@
+Normal rank
@@ Property / cites work @@
+The Combinatorial Structure of Wait-Free Solvable Tasks
+Normal rank
@@ Property / cites work @@
+Counting-Based Impossibility Proofs for Renaming and Set Agreement
+Normal rank
@@ Property / cites work @@
+New combinatorial topology bounds for renaming: the lower bound
+Normal rank
@@ Property / cites work @@
+New combinatorial topology bounds for renaming
@@ Property / cites work: New combinatorial topology bounds for renaming / rank @@
+Normal rank
@@ Property / cites work @@
+Transformation groups
@@ Property / cites work: Transformation groups / rank @@
+Normal rank
@@ Property / cites work @@
+The extended BG-simulation and the characterization of t-resiliency
+Normal rank
@@ Property / cites work @@
+Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
+Normal rank
@@ Property / cites work @@
+Unifying synchronous and asynchronous message-passing models
+Normal rank
@@ Property / cites work @@
+The topological structure of asynchronous computability
+Normal rank
@@ Property / cites work @@
+Algebraic spans
@@ Property / cites work: Algebraic spans / rank @@
+Normal rank
@@ Property / cites work @@
+The topology of shared-memory adversaries
@@ Property / cites work: The topology of shared-memory adversaries / rank @@
+Normal rank
@@ Property / cites work @@
+Q3827224
@@ Property / cites work: Q3827224 / rank @@
+Normal rank