Pages that link to "Item:Q2396827"
From MaRDI portal
The following pages link to On the advice complexity of the \(k\)-server problem (Q2396827):
Displaying 8 items.
- Online algorithms with advice: the tape model (Q529045) (← links)
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere (Q1741849) (← links)
- Call admission problems on grids with advice (Q2136274) (← links)
- Online two-way trading: randomization and advice (Q2219058) (← links)
- Online Graph Coloring Against a Randomized Adversary (Q3177338) (← links)
- Online Minimum Spanning Tree with Advice (Q5895056) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Online bin covering with advice (Q5925507) (← links)
