On the Advice Complexity of Buffer Management
From MaRDI portal
Publication:4909530
DOI10.1007/978-3-642-35261-4_17zbMath1260.68172OpenAlexW28791922MaRDI QIDQ4909530
Meng He, Norbert Zeh, Reza Dorrigiv
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_17
Analysis of algorithms and problem complexity (68Q25) Online algorithms; streaming algorithms (68W27)
Related Items (9)
Online Multi-Coloring with Advice ⋮ Online algorithms with advice for the dual bin packing problem ⋮ A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey ⋮ On the advice complexity of online bipartite matching and online stable marriage ⋮ Reordering buffer management with advice ⋮ Online algorithms with advice for bin packing and scheduling problems ⋮ On the advice complexity of the online dominating set problem ⋮ The string guessing problem as a method to prove lower bounds on the advice complexity ⋮ Online multi-coloring with advice
This page was built for publication: On the Advice Complexity of Buffer Management
