Pages that link to "Item:Q4291558"
From MaRDI portal
The following pages link to Lower Bounds for Randomized <i>k</i>-Server and Motion-Planning Algorithms (Q4291558):
Displayed 8 items.
- Low-distortion embeddings of infinite metric spaces into the real line (Q1006611) (← links)
- Competitive randomized algorithms for nonuniform problems (Q1329146) (← links)
- Constructing competitive tours from local information (Q1331954) (← links)
- Competitive algorithms for the weighted server problem (Q1331957) (← links)
- A general decomposition theorem for the \(k\)-server problem (Q1854527) (← links)
- Competitive distributed decision-making (Q1920425) (← links)
- Ramsey-type theorems for metric spaces with applications to online problems (Q2496321) (← links)
- Competitive Algorithms for Layered Graph Traversal (Q4210157) (← links)