Online Graph Coloring Against a Randomized Adversary (Q3177338): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / 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
+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 @@
+The online knapsack problem: advice and randomization
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for On-line Coloring Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Paging Against a Probabilistic Adversary
+Normal rank
@@ Property / cites work @@
+Online Graph Exploration with Advice
@@ Property / cites work: Online Graph Exploration with Advice / 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 @@
+Advice Complexity of Online Coloring for Paths
@@ Property / cites work: Advice Complexity of Online Coloring for Paths / 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-line and first fit colorings of graphs
@@ Property / cites work: On-line and first fit colorings of graphs / 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 @@
+Q4010310
@@ Property / cites work: Q4010310 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249728
@@ Property / cites work: Q4249728 / 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 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 @@
+Beyond Competitive Analysis
@@ Property / cites work: Beyond Competitive Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+An on-line graph coloring algorithm with sublinear performance ratio
+Normal rank
@@ Property / cites work @@
+Q4010309
@@ Property / cites work: Q4010309 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized online graph coloring
@@ Property / cites work: Randomized online graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Advice Complexity of Fine-Grained Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0129054118410058
+Normal rank
@@ Property / OpenAlex ID @@
+W2809805937
@@ Property / OpenAlex ID: W2809805937 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3177338