The list update problem and the retrieval of sets (Q1331955): Difference between revisions

@@ Property / cites work @@
+An Optimal On-Line Algorithm for <i>K</i> Servers on Trees
+Normal rank
@@ Property / cites work @@
+The list update problem and the retrieval of sets
@@ Property / cites work: The list update problem and the retrieval of sets / rank @@
+Normal rank
@@ Property / cites work @@
+The weighted list update problem and the lazy adversary
+Normal rank
@@ Property / cites work @@
+Two results on the list update problem
@@ Property / cites work: Two results on the list update problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138960
@@ Property / cites work: Q3138960 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive snoopy caching
@@ Property / cites work: Competitive snoopy caching / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive algorithms for server problems
@@ Property / cites work: Competitive algorithms for server problems / rank @@
+Normal rank
@@ Property / cites work @@
+Off-line algorithms for the list update problem
@@ Property / cites work: Off-line algorithms for the list update problem / rank @@
+Normal rank
@@ Property / cites work @@
+Self-adjusting binary search trees
@@ Property / cites work: Self-adjusting binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Amortized Computational Complexity
@@ Property / cites work: Amortized Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for randomized list update algorithms
+Normal rank