Michael Mitzenmacher, Saeed Seddighin. Improved Sublinear Time Algorithm for Longest Increasing Subsequence. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 1934-1947, SIAM, 2022. [doi]
@inproceedings{MitzenmacherS22,
title = {Improved Sublinear Time Algorithm for Longest Increasing Subsequence},
author = {Michael Mitzenmacher and Saeed Seddighin},
year = {2022},
doi = {10.1137/1.9781611976465.115},
url = {https://doi.org/10.1137/1.9781611976465.115},
researchr = {https://researchr.org/publication/MitzenmacherS22},
cites = {0},
citedby = {0},
pages = {1934-1947},
booktitle = {Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022},
editor = {Joseph (Seffi) Naor and Niv Buchbinder},
publisher = {SIAM},
isbn = {978-1-61197-707-3},
}