Tight Bounds for Asynchronous Renaming (Q3189653): Difference between revisions

@@ Property / author @@
-Rachid Guerraoui
@@ Property / author: Rachid Guerraoui / rank @@
-Normal rank
@@ Property / author @@
+Rachid Guerraoui
@@ Property / author: Rachid Guerraoui / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1145/2597630
@@ Property / full work available at URL: https://doi.org/10.1145/2597630 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2057041531
@@ Property / OpenAlex ID: W2057041531 / rank @@
+Normal rank
@@ Property / cites work @@
+Atomic snapshots of shared memory
@@ Property / cites work: Atomic snapshots of shared memory / rank @@
+Normal rank
@@ Property / cites work @@
+Sub-logarithmic Test-and-Set against a Weak Adversary
+Normal rank
@@ Property / cites work @@
+Optimal-time adaptive strong renaming, with applications to counting
+Normal rank
@@ Property / cites work @@
+The Complexity of Renaming
@@ Property / cites work: The Complexity of Renaming / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Randomized Test-and-Set and Renaming
@@ Property / cites work: Fast Randomized Test-and-Set and Renaming / rank @@
+Normal rank
@@ Property / cites work @@
+Polylogarithmic concurrent data structures from monotone circuits
+Normal rank
@@ Property / cites work @@
+Faster than optimal snapshots (for a while)
@@ Property / cites work: Faster than optimal snapshots (for a while) / rank @@
+Normal rank
@@ Property / cites work @@
+Counting networks
@@ Property / cites work: Counting networks / 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 @@
+Adaptive and efficient mutual exclusion (extended abstract)
+Normal rank
@@ Property / cites work @@
+Time bounds for decision problems in the presence of timing uncertainty and failures
+Normal rank
@@ Property / cites work @@
+Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
+Normal rank
@@ Property / cites work @@
+Distributed Computing
@@ Property / cites work: Distributed Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549704
@@ Property / cites work: Q3549704 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient adaptive collect using randomization
@@ Property / cites work: Efficient adaptive collect using randomization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398822
@@ Property / cites work: Q4398822 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
+Normal rank
@@ Property / cites work @@
+Mutual Exclusion with O(log^2 Log n) Amortized Work
+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 @@
+Fully-Adaptive Algorithms for Long-Lived Renaming
@@ Property / cites work: Fully-Adaptive Algorithms for Long-Lived Renaming / rank @@
+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 @@
+Wait-free implementations in message-passing systems
+Normal rank
@@ Property / cites work @@
+Asynchronous exclusive selection
@@ Property / cites work: Asynchronous exclusive selection / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+On the inherent weakness of conditional primitives
+Normal rank
@@ Property / cites work @@
+The extended BG-simulation and the characterization of t-resiliency
+Normal rank
@@ Property / cites work @@
+Linearizable implementations do not suffice for randomized distributed computation
+Normal rank
@@ Property / cites work @@
+Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
+Normal rank
@@ Property / cites work @@
+Randomized wait-free concurrent objects (extended abstract)
+Normal rank
@@ Property / cites work @@
+The topological structure of asynchronous computability
+Normal rank
@@ Property / cites work @@
+A time complexity lower bound for randomized implementations of some shared objects
+Normal rank
@@ Property / cites work @@
+Time and Space Lower Bounds for Nonblocking Implementations
+Normal rank
@@ Property / cites work @@
+A time complexity lower bound for adaptive mutual exclusion
+Normal rank
@@ Property / cites work @@
+The Las-Vegas Processor Identity Problem (How and When to Be Unique)
+Normal rank
@@ Property / cites work @@
+The processor identity problem
@@ Property / cites work: The processor identity problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3126969
@@ Property / cites work: Q3126969 / rank @@
+Normal rank
@@ Property / cites work @@
+Wait-free algorithms for fast, long-lived renaming
+Normal rank
@@ Property / cites work @@
+Strong order-preserving renaming in the synchronous message passing model
+Normal rank
@@ Property / cites work @@
+Reaching Agreement in the Presence of Faults
@@ Property / cites work: Reaching Agreement in the Presence of Faults / rank @@
+Normal rank