A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Competitive analysis of randomized paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to the Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal On-Line Algorithm for <i>K</i> Servers on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138907 / 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: The 2-evader problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly competitive randomized paging algorithm / rank
 
Normal rank

Revision as of 01:07, 12 July 2024

scientific article
Language Label Description Also known as
English
A better lower bound on the competitive ratio of the randomized 2-server problem
scientific article

    Statements

    A better lower bound on the competitive ratio of the randomized 2-server problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2016
    0 references
    online algorithms
    0 references
    randomized algorithms
    0 references
    competitive analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references