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]
@inproceedings{AzarPV26,
title = {Nearly Tight Bounds for the Online Sorting Problem},
author = {Yossi Azar and Debmalya Panigrahi and Or Vardi},
year = {2026},
doi = {10.1137/1.9781611978971.237},
url = {https://doi.org/10.1137/1.9781611978971.237},
researchr = {https://researchr.org/publication/AzarPV26},
cites = {0},
citedby = {0},
pages = {6642-6658},
booktitle = {Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026, Vancouver, BC, Canada, January 11-14, 2026},
editor = {Kasper Green Larsen and Barna Saha},
publisher = {SIAM},
isbn = {978-1-61197-897-1},
}