A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem / rank
 
Normal rank
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: On the Advice Complexity of the Online L(2,1)-Coloring Problem on Paths and Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic-Competitive Algorithm for the k-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Randomness versus Advice in Online Computation / 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: On the Advice Complexity of the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2965482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the list update problem with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of Buffer Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set with Advice: The Impact of Graph Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Graph Exploration with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Much Information about the Future Is Needed? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Makespan Scheduling with Sublinear Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Computation with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal codeword sets and representations of the integers / 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: On Advice Complexity of the k-server Problem under Sparse Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5755525 / 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: On the <i>k</i> -server conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Online Algorithms with Advice for the k-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms with advice for bin packing and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity of the Online Coloring Problem / rank
 
Normal rank

Latest revision as of 18:21, 10 July 2024

scientific article
Language Label Description Also known as
English
A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey
scientific article

    Statements

    A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (English)
    0 references
    0 references
    0 references
    8 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers