On the advice complexity of the \(k\)-server problem (Q2396827): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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 Online Problems / 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: 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: On the Length of Programs for Computing Finite Binary Sequences / 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: Disjoint Path Allocation with Sublinear Advice / 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: Design and analysis of randomized algorithms. Introduction to design paradigms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity and Barely Random Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-server 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: Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On online algorithms with advice for the \(k\)-server problem / rank
 
Normal rank

Latest revision as of 21:53, 13 July 2024

scientific article
Language Label Description Also known as
English
On the advice complexity of the \(k\)-server problem
scientific article

    Statements

    On the advice complexity of the \(k\)-server problem (English)
    0 references
    0 references
    0 references
    0 references
    26 May 2017
    0 references
    0 references
    online algorithms
    0 references
    advice complexity
    0 references
    competitive analysis
    0 references
    \(k\)-server problem
    0 references
    0 references