Pages that link to "Item:Q4909530"
From MaRDI portal
The following pages link to On the Advice Complexity of Buffer Management (Q4909530):
Displaying 9 items.
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- Online algorithms with advice for the dual bin packing problem (Q1642809) (← links)
- Reordering buffer management with advice (Q1707821) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- Online Multi-Coloring with Advice (Q3453285) (← links)
