Information complexity of online problems
From MaRDI portal
Recommendations
Cited in
(54)- The advice complexity of a class of hard online problems
- Reordering buffer management with advice
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
- Online node- and edge-deletion problems with advice
- On the advice complexity of the online dominating set problem
- Exploring sparse graphs with advice
- Call admission problems on grids with advice
- On online algorithms with advice for the k-server problem
- Advice complexity of maximum independent set in sparse and bipartite graphs
- Online multi-coloring with advice
- On the advice complexity of the \(k\)-server problem
- Improved analysis of the online set cover problem with advice
- The online knapsack problem: advice and randomization
- Online bin packing with advice
- Call admission problems on trees
- Can entropy characterize performance of online algorithms?
- Advice complexity of the online search problem
- On advice complexity of the k-server problem under sparse metrics
- A technique to obtain hardness results for randomized online algorithms -- a survey
- Optimal online edge coloring of planar graphs with advice
- Advice complexity of fine-grained job shop scheduling
- On the advice complexity of the k-server problem
- On the power of randomness versus advice in online computation
- Online graph coloring against a randomized adversary
- Disjoint path allocation with sublinear advice
- Online Multi-Coloring with Advice
- Treasure hunt with advice
- On the advice complexity of online bipartite matching and online stable marriage
- Online coloring of bipartite graphs with and without advice
- On the advice complexity of the \(k\)-server problem under sparse metrics
- Further results on online node- and edge-deletion problems with advice
- Advice complexity and barely random algorithms
- Towards analysis of information structure of computations
- Online algorithms with advice: the tape model
- Online Minimum Spanning Tree with Advice
- Online bin covering with advice
- On Usefulness of Information: Framework and NFA Case
- Fully Online Matching with Advice on General Bipartite Graphs and Paths
- Relative Worst-Order Analysis: A Survey
- Length-Weighted Disjoint Path Allocation
- Second Thoughts on the Second Law
- Online minimum spanning trees with weight predictions
- Advice complexity of adaptive priority algorithms
- Advice complexity bounds for online delayed \(\mathcal{F} \)-node-, \(H\)-node- and \(H\)-edge-deletion problems
- Online knapsack with removal and recourse
- Priority algorithms with advice for disjoint path allocation problems
- Complexity classes for online problems with and without predictions
- Removable online knapsack and advice
- A survey of online knapsack problems
- Online knapsack with removal and recourse
- Online unbounded knapsack
- Online simple knapsack with reservation costs
- 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
This page was built for publication: Information complexity of online problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586068)
