scientific article

DOI10.4086/toc.2010.v006a002zbMath1213.68710OpenAlexW2205536044MaRDI QIDQ3002815

Matthias Westermann, Matthias Englert, Harald Räcke

Publication date: 24 May 2011

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2010.v006a002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

online algorithmsreordering buffergeneral metric spacessorting buffer

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27)

Related Items (5)

On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs ⋮ Logarithmic price of buffer downscaling on line metrics ⋮ NP-hardness of the sorting buffer problem on the uniform metric ⋮ Reordering buffer management with advice ⋮ Almost Tight Bounds for Reordering Buffer Management

This page was built for publication: