Reordering Buffers with Logarithmic Diameter Dependency for Trees

DOI10.1137/1.9781611974782.79zbMath1411.68202OpenAlexW4240895316MaRDI QIDQ4575821

Matthias Englert, Harald Räcke

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.79

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Logarithmic price of buffer downscaling on line metrics ⋮ Almost Tight Bounds for Reordering Buffer Management

This page was built for publication: Reordering Buffers with Logarithmic Diameter Dependency for Trees