Nearly tight bounds for the online sorting problem

DOI10.1137/1.9781611978971.237MaRDI QIDQ7294783zbMATH OpenFDO

Authors Yossi Azar, Debmalya Panigrahi, Or Vardi

Publication date 13 July 2026

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Nearly tight bounds for the online sorting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294783)