On the Advice Complexity of Online Problems
From MaRDI portal
Recommendations
- Advice complexity for a class of online problems
- The advice complexity of a class of hard online problems
- On the advice complexity of the online dominating set problem
- Advice complexity of the online induced subgraph problem
- On online algorithms with advice for the k-server problem
- On online algorithms with advice for the \(k\)-server problem
- Advice complexity of online non-crossing matching
- Tight bounds for the advice complexity of the online minimum Steiner tree problem
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles
Cited in
(69)- 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
- Call admission problems on grids with advice (extended abstract)
- 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
- Two-way and one-way quantum and classical automata with advice for online minimization problems
- Online two-way trading: randomization and advice
- Online bin packing with advice of small size
- 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
- Modeling time criticality of information
- Online bin packing with advice
- Advice complexity of online non-crossing matching
- Online two-dimensional vector packing with advice
- scientific article; zbMATH DE number 1670523 (Why is no real title available?)
- Weighted Online Problems with Advice
- Advice complexity of the online search problem
- On advice complexity of the k-server problem under sparse metrics
- On the advice complexity of the knapsack problem
- Job shop scheduling with unit length tasks
- Advice complexity: quantitative approach to a-priori information. Extended abstract
- 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
- Advice complexity of disjoint path allocation
- Advice complexity for a class of online problems
- On the advice complexity of the k-server problem
- Advice complexity and barely random algorithms
- On the power of randomness versus advice in online computation
- Online graph coloring against a randomized adversary
- Disjoint path allocation with sublinear advice
- On energy-efficient computations with advice
- Online bin packing with advice of small size
- Online Multi-Coloring with Advice
- Treasure hunt with advice
- On the advice complexity of online bipartite matching and online stable marriage
- Randomization can be as helpful as a glimpse of the future in online computation
- Online coloring of bipartite graphs with and without advice
- On the advice complexity of buffer management
- Online algorithms with advice for bin packing and scheduling problems
- On the advice complexity of the \(k\)-server problem under sparse metrics
- Further results on online node- and edge-deletion problems with advice
- Online matching in regular bipartite graphs
- Semi-online bipartite matching
- Online makespan scheduling with sublinear advice
- Advice complexity and barely random algorithms
- A simple PTAS for the dual bin packing problem and advice complexity of its online version
- Online algorithms with advice: the tape model
- How Much Information about the Future Is Needed?
- Towards using the history in online computation with advice
- Online Minimum Spanning Tree with Advice
- Fully Online Matching with Advice on General Bipartite Graphs and Paths
- Online computation with untrusted advice
- Quantum online algorithms with respect to space and advice complexity
- Tree coloring with predictions
- 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
- Weighted online problems 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
This page was built for publication: On the Advice Complexity of Online Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652221)
