On energy-efficient computations with advice
From MaRDI portal
Recommendations
Cites work
- Advice complexity of the online coloring problem
- Algorithms for power savings
- scientific article; zbMATH DE number 432777 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- On advice complexity of the k-server problem under sparse metrics
- On online algorithms with advice for the \(k\)-server problem
- On the Advice Complexity of Online Problems
- On the advice complexity of the k-server problem
- On the advice complexity of the knapsack problem
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles
- On the power of advice and randomization for the disjoint path allocation problem
- Online coloring of bipartite graphs with and without advice
- Online computation with advice
- The string guessing problem as a method to prove lower bounds on the advice complexity
Cited in
(3)
This page was built for publication: On energy-efficient computations with advice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196431)
