Pages that link to "Item:Q5198936"
From MaRDI portal
The following pages link to Advice Complexity and Barely Random Algorithms (Q5198936):
Displayed 15 items.
- Online bin packing with advice (Q261387) (← links)
- Online coloring of bipartite graphs with and without advice (Q486981) (← links)
- Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
- On the list update problem with advice (Q515679) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- Advice Complexity of the Online Search Problem (Q2819505) (← links)
- Job shop scheduling with unit length tasks (Q2905324) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- Advice Complexity and Barely Random Algorithms (Q3075527) (← links)
- On the Power of Randomness versus Advice in Online Computation (Q3166941) (← links)
- Disjoint Path Allocation with Sublinear Advice (Q3196403) (← links)
- Online Bin Packing with Advice of Small Size (Q3449804) (← links)
- Online Multi-Coloring with Advice (Q3453285) (← links)