Generalized Reordering Buffer Management
From MaRDI portal
Publication:2965475
DOI10.4230/LIPICS.STACS.2014.87zbMATH Open1359.68033OpenAlexW2140336969MaRDI QIDQ2965475FDOQ2965475
Authors: Matthias Englert, Iftah Gamzu, Eytan Kidron, Yossi Azar 
Publication date: 3 March 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2014.87
Recommendations
- New Approximations for Reordering Buffer Management
- Almost Tight Bounds for Reordering Buffer Management
- Almost tight bounds for reordering buffer management
- Reordering buffer management with advice
- Reordering buffer management with advice
- An improved competitive algorithm for reordering buffer management
- An improved competitive algorithm for reordering buffer management
- scientific article; zbMATH DE number 7204485
- A Constant Factor Approximation Algorithm for Reordering Buffer Management
- Automata, Languages and Programming
Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (9)
- Almost Tight Bounds for Reordering Buffer Management
- Title not available (Why is that?)
- Almost tight bounds for reordering buffer management
- Title not available (Why is that?)
- Online stochastic reordering buffer scheduling
- On the randomized competitive ratio of reordering buffer management with non-uniform costs
- Reordering buffer management with advice
- New Approximations for Reordering Buffer Management
- Reordering buffer management with advice
This page was built for publication: Generalized Reordering Buffer Management
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965475)
