On Energy-Efficient Computations With Advice
From MaRDI portal
Publication:3196431
DOI10.1007/978-3-319-21398-9_58zbMath1465.68312OpenAlexW2296021101MaRDI QIDQ3196431
Richard Dobson, Sacha Krug, K. Steinhöfel, Hans-Joachim Böckenhauer
Publication date: 29 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/211180
Analysis of algorithms and problem complexity (68Q25) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Online computation with advice
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles
- The string guessing problem as a method to prove lower bounds on the advice complexity
- 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
- 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
- Algorithms for power savings
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Energy-Efficient Computations With Advice