Pages that link to "Item:Q5448651"
From MaRDI portal
The following pages link to How Much Information about the Future Is Needed? (Q5448651):
Displaying 27 items.
- Online coloring of bipartite graphs with and without advice (Q486981) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- On the list update problem with advice (Q515679) (← links)
- Online algorithms with advice: the tape model (Q529045) (← links)
- Online computation with advice (Q541670) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- Reordering buffer management with advice (Q1707821) (← links)
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere (Q1741849) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- Call admission problems on grids with advice (Q2136274) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Online bin packing with advice of small size (Q2322702) (← links)
- On online algorithms with advice for the \(k\)-server problem (Q2344207) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← links)
- Advice Complexity of the Online Search Problem (Q2819505) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- Advice Complexity of Fine-Grained Job Shop Scheduling (Q2947041) (← links)
- On the Advice Complexity of the k-Server Problem (Q3012806) (← links)
- Advice Complexity and Barely Random Algorithms (Q3075527) (← links)
- On the Power of Randomness versus Advice in Online Computation (Q3166941) (← links)
- Online Matching in Regular Bipartite Graphs (Q5087843) (← links)
- Advice Complexity and Barely Random Algorithms (Q5198936) (← links)
- Towards using the history in online computation with advice (Q5501863) (← links)
- On Usefulness of Information: Framework and NFA Case (Q6163619) (← links)
- Fully Online Matching with Advice on General Bipartite Graphs and Paths (Q6163625) (← links)
- Online knapsack with removal and recourse (Q6182898) (← links)