Pages that link to "Item:Q5198936"
From MaRDI portal
The following pages link to Advice Complexity and Barely Random Algorithms (Q5198936):
Displaying 7 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)
- Online algorithms with advice: the tape model (Q529045) (← 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)