Pages that link to "Item:Q4925265"
From MaRDI portal
The following pages link to The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity (Q4925265):
Displaying 10 items.
- Online bin packing with advice (Q261387) (← links)
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- On the list update problem with advice (Q515679) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- Towards using the history in online computation with advice (Q5501863) (← links)
- Fully Online Matching with Advice on General Bipartite Graphs and Paths (Q6163625) (← links)