Pages that link to "Item:Q3988823"
From MaRDI portal
The following pages link to On fast algorithms for two servers (Q3988823):
Displaying 12 items.
- The \(k\)-server problem (Q458484) (← links)
- Geometric two-server algorithms (Q673915) (← links)
- R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
- A competitive 2-server algorithm (Q1182124) (← links)
- Randomized competitive algorithms for the list update problem (Q1312185) (← links)
- Competitive \(k\)-server algorithms (Q1329151) (← links)
- A lower bound for two-server balancing algorithms (Q1336749) (← links)
- Trackless online algorithms for the server problem (Q1607049) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- Sequencing two servers on a sphere (Q3217405) (← links)
- Breaking the 2-competitiveness barrier for two servers in a tree (Q6052700) (← links)