Pages that link to "Item:Q2868631"
From MaRDI portal
The following pages link to On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631):
Displaying 14 items.
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- On the list update problem with advice (Q515679) (← links)
- Online algorithms with advice: the tape model (Q529045) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- On the advice complexity of the \(k\)-server problem (Q2396827) (← links)
- Advice Complexity of the Online Search Problem (Q2819505) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- Disjoint Path Allocation with Sublinear Advice (Q3196403) (← links)
- On Energy-Efficient Computations With Advice (Q3196431) (← links)
- Treasure Hunt with Advice (Q3460725) (← links)
- Towards using the history in online computation with advice (Q5501863) (← links)
