Online Computation with Advice

DOI10.1007/978-3-642-02927-1_36zbMath1248.68571OpenAlexW1603057269MaRDI QIDQ3638053

Pierre Fraigniaud, Adi Rosén, Amos Korman, Yuval Emek

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_36

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (14)

Two-way and one-way quantum and classical automata with advice for online minimization problems ⋮ Online Matching in Regular Bipartite Graphs ⋮ On the additive constant of the \(k\)-server work function algorithm ⋮ A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey ⋮ On the advice complexity of online bipartite matching and online stable marriage ⋮ Fully Online Matching with Advice on General Bipartite Graphs and Paths ⋮ Drawing maps with advice ⋮ Online coloring of bipartite graphs with and without advice ⋮ The \(k\)-server problem with advice in \(d\) dimensions and on the sphere ⋮ On the Additive Constant of the k-Server Work Function Algorithm ⋮ On the Advice Complexity of the k-Server Problem ⋮ Approximating \(k\)-forest with resource augmentation: a primal-dual approach ⋮ Advice Complexity and Barely Random Algorithms ⋮ On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles

This page was built for publication: Online Computation with Advice