Lower Bounds for Restricted-Use Objects (Q2812146): Difference between revisions

@@ 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 @@
+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 @@
+Lower Bounds for Restricted-Use Objects
@@ Property / cites work: Lower Bounds for Restricted-Use Objects / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate shared-memory counting despite a strong adversary
+Normal rank
@@ Property / cites work @@
+The complexity of obstruction-free implementations
+Normal rank
@@ Property / cites work @@
+Distributed Computing
@@ Property / cites work: Distributed Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Mutual Exclusion with O(log^2 Log n) Amortized Work
+Normal rank
@@ Property / cites work @@
+Contention in shared memory algorithms
@@ Property / cites work: Contention in shared memory algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538132
@@ Property / cites work: Q5538132 / rank @@
+Normal rank
@@ Property / cites work @@
+On the space complexity of randomized synchronization
+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 @@
+Probability and Computing
@@ Property / cites work: Probability and Computing / rank @@
+Normal rank