Advice Complexity and Barely Random Algorithms (Q3075527): Difference between revisions

@@ Property / OpenAlex ID @@
+W1546040831
@@ Property / OpenAlex ID: W1546040831 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive analysis of randomized paging algorithms
+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 @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the job-shop problem with two jobs
+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 @@
+Q5755525
@@ Property / cites work: Q5755525 / 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 the power of randomization for job shop scheduling with<i>k</i>-units length tasks
+Normal rank
@@ Property / cites work @@
+Randomized competitive algorithms for the list update problem
+Normal rank