A general decomposition theorem for the \(k\)-server problem (Q1854527): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/inco.2002.3144 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013255427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for two servers on the line. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of randomization in on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal on-line algorithm for metrical task system / 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: Q4010306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better lower bound on the competitive ratio of the randomized 2-server problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better algorithms for unfair metrical task systems and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized weighted caching with two page weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive randomized algorithms for nonuniform problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Randomized <i>k</i>-Server and Motion-Planning Algorithms / 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: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly competitive randomized paging algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfair problems and randomized algorithms for metrical task systems / rank
 
Normal rank

Revision as of 10:14, 5 June 2024

scientific article
Language Label Description Also known as
English
A general decomposition theorem for the \(k\)-server problem
scientific article

    Statements

    A general decomposition theorem for the \(k\)-server problem (English)
    0 references
    0 references
    14 January 2003
    0 references

    Identifiers