Weighted online problems with advice (Q726104): Difference between revisions

@@ Property / cites work @@
+Online makespan minimization with parallel schedules
+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 Online Problems
@@ Property / cites work: On the Advice Complexity of Online Problems / 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 @@
+Online Bounded Analysis
@@ Property / cites work: Online Bounded Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+The advice complexity of a class of hard online problems
+Normal rank
@@ Property / cites work @@
+Q2954988
@@ Property / cites work: Q2954988 / rank @@
+Normal rank
@@ Property / cites work @@
+LRU is better than FIFO
@@ Property / cites work: LRU is better than FIFO / rank @@
+Normal rank
@@ Property / cites work @@
+Measuring the problem-relevant information in input
+Normal rank
@@ Property / cites work @@
+Online computation with advice
@@ Property / cites work: Online computation with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive snoopy caching
@@ Property / cites work: Competitive snoopy caching / rank @@
+Normal rank
@@ Property / cites work @@
+Advice Complexity of the Online Induced Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation
+Normal rank
@@ Property / cites work @@
+Online algorithms with advice for bin packing and scheduling problems
+Normal rank