A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141): Difference between revisions

@@ Property / author @@
-Carstent Lund
@@ Property / author: Carstent Lund / rank @@
-Normal rank
@@ Property / author @@
+Carstent Lund
@@ Property / author: Carstent Lund / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive analysis of randomized paging algorithms
+Normal rank
@@ Property / cites work @@
+Q4230341
@@ Property / cites work: Q4230341 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138906
@@ Property / cites work: Q3138906 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Approach to the Server Problem
@@ Property / cites work: A New Approach to the Server Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal On-Line Algorithm for <i>K</i> Servers on Trees
+Normal rank
@@ Property / cites work @@
+Q3138907
@@ Property / cites work: Q3138907 / 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 @@
+The 2-evader problem
@@ Property / cites work: The 2-evader problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128899
@@ Property / cites work: Q3128899 / 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 @@
+A strongly competitive randomized paging algorithm
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(97)00099-9
+Normal rank
@@ Property / OpenAlex ID @@
+W1969406444
@@ Property / OpenAlex ID: W1969406444 / rank @@
+Normal rank