Nearly Tight Bounds for the Online Sorting Problem

Yossi Azar, Debmalya Panigrahi, Or Vardi. Nearly Tight Bounds for the Online Sorting Problem. In Kasper Green Larsen, Barna Saha, editors, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026, Vancouver, BC, Canada, January 11-14, 2026. pages 6642-6658, SIAM, 2026. [doi]

Abstract

Abstract is missing.