On online algorithms with advice for the \(k\)-server problem (Q2344207): Difference between revisions

@@ Property / DOI @@
-.1007/s00224-012-9434-z
@@ Property / DOI: 10.1007/s00224-012-9434-z / rank @@
-Normal rank
@@ Property / cites work @@
+On the Advice Complexity of Online Problems
@@ Property / cites work: On the Advice Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of the k-Server Problem
@@ Property / cites work: On the Advice Complexity of the k-Server Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal on-line algorithm for metrical task system
+Normal rank
@@ Property / cites work @@
+How Much Information about the Future Is Needed?
@@ Property / cites work: How Much Information about the Future Is Needed? / rank @@
+Normal rank
@@ Property / cites work @@
+Online computation with advice
@@ Property / cites work: Online computation with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Information Complexity of Online Problems
@@ Property / cites work: Information Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Advice Complexity and Barely Random Algorithms
@@ Property / cites work: Advice Complexity and Barely Random Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On embedding trees into uniformly convex Banach spaces
+Normal rank
@@ Property / DOI @@
+.1007/S00224-012-9434-Z
@@ Property / DOI: 10.1007/S00224-012-9434-Z / rank @@
+Normal rank