Automata, Languages and Programming
From MaRDI portal
Publication:5716814
DOI10.1007/11523468zbMath1085.68742OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716814
Matthias Westermann, Matthias Englert
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (10)
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs ⋮ Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities ⋮ Logarithmic price of buffer downscaling on line metrics ⋮ A note on sorting buffers offline ⋮ NP-hardness of the sorting buffer problem on the uniform metric ⋮ Reordering buffer management with advice ⋮ Exploiting locality: Approximating sorting buffers ⋮ Buffer management for colored packets with deadlines ⋮ Online and offline algorithms for the sorting buffers problem on the line metric ⋮ Almost Tight Bounds for Reordering Buffer Management
This page was built for publication: Automata, Languages and Programming
