Trackless online algorithms for the server problem (Q1607049): Difference between revisions

@@ Property / cites work @@
+Competitive analysis of randomized paging algorithms
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive paging with locality of reference
@@ Property / cites work: Competitive paging with locality of reference / rank @@
+Normal rank
@@ Property / cites work @@
+On fast algorithms for two servers
@@ Property / cites work: On fast algorithms for two servers / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal On-Line Algorithm for <i>K</i> Servers on Trees
+Normal rank
@@ Property / cites work @@
+HARMONIC is 3-competitive for two servers
@@ Property / cites work: HARMONIC is 3-competitive for two servers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4010306
@@ Property / cites work: Q4010306 / rank @@
+Normal rank
@@ Property / cites work @@
+A better lower bound on the competitive ratio of the randomized 2-server problem
+Normal rank
@@ Property / cites work @@
+Competitive paging algorithms
@@ Property / cites work: Competitive paging algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A competitive 2-server algorithm
@@ Property / cites work: A competitive 2-server algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On the             <i>k</i>             -server conjecture
@@ Property / cites work: On the <i>k</i> -server conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+A strongly competitive randomized paging algorithm
+Normal rank