Pages that link to "Item:Q3166941"
From MaRDI portal
The following pages link to On the Power of Randomness versus Advice in Online Computation (Q3166941):
Displaying 10 items.
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081) (← links)
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere (Q1741849) (← links)
- Online node- and edge-deletion problems with advice (Q1979452) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- On the advice complexity of the \(k\)-server problem (Q2396827) (← links)
- Call admission problems on trees (Q2672603) (← links)
- The secretary problem with reservation costs (Q2695326) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- (Q3300812) (← links)
- Online Minimum Spanning Tree with Advice (Q5895056) (← links)