Concurrent counting is harder than queuing (Q604464): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2010.07.002
@@ Property / DOI: 10.1016/j.tcs.2010.07.002 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.07.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1978890639
@@ Property / OpenAlex ID: W1978890639 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q60148586
@@ Property / Wikidata QID: Q60148586 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting networks
@@ Property / cites work: Counting networks / rank @@
+Normal rank
@@ Property / cites work @@
+The cost of concurrent, low-contention Read \& Modify \& Write
+Normal rank
@@ Property / cites work @@
+Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
+Normal rank
@@ Property / cites work @@
+Q4436061
@@ Property / cites work: Q4436061 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive concurrent distributed queuing
@@ Property / cites work: Competitive concurrent distributed queuing / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+An inherent bottleneck in distributed counting
@@ Property / cites work: An inherent bottleneck in distributed counting / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2010.07.002
@@ Property / DOI: 10.1016/J.TCS.2010.07.002 / rank @@
+Normal rank