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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Carstent Lund / rank
Normal rank
 
Property / author
 
Property / author: Carstent Lund / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6585446 / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithms
Property / zbMATH Keywords: online algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
randomized algorithms
Property / zbMATH Keywords: randomized algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
competitive analysis
Property / zbMATH Keywords: competitive analysis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00099-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969406444 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:59, 30 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
    0 references