The following pages link to (Q3128899):
Displaying 14 items.
- A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
- A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
- Unfair problems and randomized algorithms for metrical task systems (Q1283826) (← links)
- Competitive analysis of randomized paging algorithms (Q1575677) (← links)
- A tight lower bound for online convex optimization with switching costs (Q1644937) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- A randomized algorithm for two servers on the line. (Q1854341) (← links)
- Linear programming with online learning (Q2465950) (← links)
- Randomized approximation and online algorithms for assignment problems (Q2789264) (← links)
- A randomized polynomial-time simplex algorithm for linear programming (Q2931369) (← links)
- Randomized Competitive Analysis for Two-Server Problems (Q3541083) (← links)
- Linear programming — Randomization and abstract frameworks (Q4593969) (← links)
- Online Semidefinite Programming. (Q4598178) (← links)
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces (Q5443387) (← links)