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 6 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)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
