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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the Power of Advice and Randomization for the Disjoint Path Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online coloring of bipartite graphs with and without advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string guessing problem as a method to prove lower bounds on the advice complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the advice complexity of the \(k\)-server problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The online knapsack problem: advice and randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for On-line Coloring Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Paging Against a Probabilistic Adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Graph Exploration with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the problem-relevant information in input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity of Online Coloring for Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Path Allocation with Sublinear Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity and Barely Random Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of the Set Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Competitive Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line graph coloring algorithm with sublinear performance ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized online graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity of Fine-Grained Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Revision as of 04:18, 16 July 2024

scientific article
Language Label Description Also known as
English
Online Graph Coloring Against a Randomized Adversary
scientific article

    Statements

    Online Graph Coloring Against a Randomized Adversary (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 July 2018
    0 references
    online computation
    0 references
    information
    0 references
    randomization
    0 references
    graph coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references