Towards using the history in online computation with advice
From MaRDI portal
Publication:5501863
DOI10.1051/ita/2015003zbMath1336.68306MaRDI QIDQ5501863
Publication date: 14 August 2015
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2015003
68W27: Online algorithms; streaming algorithms
Cites Work
- Online computation with advice
- On Advice Complexity of the k-server Problem under Sparse Metrics
- On the Advice Complexity of the Knapsack Problem
- On Online Algorithms with Advice for the k-Server Problem
- On the Advice Complexity of the Set Cover Problem
- Online Coloring of Bipartite Graphs with and without Advice
- On the Power of Advice and Randomization for the Disjoint Path Allocation Problem
- On the Advice Complexity of the k-Server Problem
- On the Advice Complexity of Online Problems
- Advice Complexity of the Online Coloring Problem
- The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity
- Matters Computational
- How Much Information about the Future Is Needed?
- Unnamed Item
- Unnamed Item
- Unnamed Item