The following pages link to Online Computation with Advice (Q3638053):
Displaying 17 items.
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- Drawing maps with advice (Q433400) (← links)
- Online coloring of bipartite graphs with and without advice (Q486981) (← links)
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081) (← links)
- On the additive constant of the \(k\)-server work function algorithm (Q1675878) (← links)
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere (Q1741849) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Weighted Online Problems with Advice (Q2819501) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- On the Advice Complexity of the k-Server Problem (Q3012806) (← links)
- Advice Complexity and Barely Random Algorithms (Q3075527) (← links)
- On the Additive Constant of the k-Server Work Function Algorithm (Q3558920) (← links)
- Online Matching in Regular Bipartite Graphs (Q5087843) (← links)
- (Q5150974) (← links)
- (Q5875754) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- Fully Online Matching with Advice on General Bipartite Graphs and Paths (Q6163625) (← links)