Towards using the history in online computation with advice (Q5501863): Difference between revisions

@@ Property / cites work @@
+Matters Computational
@@ Property / cites work: Matters Computational / rank @@
+Normal rank
@@ Property / cites work @@
+On the Power of Advice and Randomization for the Disjoint Path Allocation Problem
+Normal rank
@@ Property / cites work @@
+Online Coloring of Bipartite Graphs with and without Advice
+Normal rank
@@ Property / cites work @@
+The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity
+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 @@
+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 Knapsack Problem
@@ Property / cites work: On the Advice Complexity of the Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4342497
@@ Property / cites work: Q4342497 / rank @@
+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 @@
+On Advice Complexity of the k-server Problem under Sparse Metrics
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of the Set Cover Problem
@@ Property / cites work: On the Advice Complexity of the Set Cover Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+On Online Algorithms with Advice for the k-Server Problem
+Normal rank
@@ Property / cites work @@
+Advice Complexity of the Online Coloring Problem
@@ Property / cites work: Advice Complexity of the Online Coloring Problem / rank @@
+Normal rank