A Randomized Algorithm for Two Servers in Cross Polytope Spaces (Q5443387): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
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: Equitable Revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4223058 / 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: A better lower bound on the competitive ratio of the randomized 2-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: Q3128899 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Competitive algorithms for server problems / rank | |||
Normal rank |
Latest revision as of 16:25, 27 June 2024
scientific article; zbMATH DE number 5237498
Language | Label | Description | Also known as |
---|---|---|---|
English | A Randomized Algorithm for Two Servers in Cross Polytope Spaces |
scientific article; zbMATH DE number 5237498 |
Statements
A Randomized Algorithm for Two Servers in Cross Polytope Spaces (English)
0 references
20 February 2008
0 references