Online algorithms with advice: the tape model (Q529045): Difference between revisions

@@ Property / cites work @@
+Online makespan minimization with parallel schedules
+Normal rank
@@ Property / cites work @@
+On the Power of Advice and Randomization for the Disjoint Path Allocation Problem
+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 @@
+Q2954988
@@ Property / cites work: Q2954988 / 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 @@
+On the advice complexity of the \(k\)-server problem
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the job-shop problem with two jobs
+Normal rank
@@ Property / cites work @@
+Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
+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 @@
+Competitive paging algorithms
@@ Property / cites work: Competitive paging algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint Path Allocation with Sublinear Advice
@@ Property / cites work: Disjoint Path Allocation with Sublinear Advice / rank @@
+Normal rank
@@ Property / cites work @@
+On Advice Complexity of the k-server Problem under Sparse Metrics
+Normal rank
@@ Property / cites work @@
+Information Complexity of Online Problems
@@ Property / cites work: Information Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5755525
@@ Property / cites work: Q5755525 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive snoopy caching
@@ Property / cites work: Competitive snoopy caching / rank @@
+Normal rank
@@ Property / cites work @@
+Semi on-line algorithms for the partition problem
@@ Property / cites work: Semi on-line algorithms for the partition problem / 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 @@
+Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation
+Normal rank
@@ Property / cites work @@
+On online algorithms with advice for the \(k\)-server problem
+Normal rank