Competitive \(k\)-server algorithms (Q1329151): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3138905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Ressults on Server Problems / 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: On fast algorithms for two servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive 2-server algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly competitive randomized paging algorithm / rank
 
Normal rank

Latest revision as of 16:41, 22 May 2024

scientific article
Language Label Description Also known as
English
Competitive \(k\)-server algorithms
scientific article

    Statements

    Competitive \(k\)-server algorithms (English)
    0 references
    0 references
    0 references
    0 references
    29 June 1994
    0 references
    0 references
    \(k\)-server algorithms
    0 references
    competitive algorithm
    0 references