Pages that link to "Item:Q287141"
From MaRDI portal
The following pages link to A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141):
Displaying 14 items.
- A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
- R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Optimal algorithms for page migration in dynamic networks (Q1044046) (← links)
- Trackless online algorithms for the server problem (Q1607049) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- A randomized algorithm for two servers on the line. (Q1854341) (← links)
- A general decomposition theorem for the \(k\)-server problem (Q1854527) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- General caching is hard: even with small pages (Q2408914) (← links)
- Randomized Competitive Analysis for Two-Server Problems (Q3541083) (← links)
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces (Q5443387) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- Breaking the 2-competitiveness barrier for two servers in a tree (Q6052700) (← links)
