Improved Sublinear Time Algorithm for Longest Increasing Subsequence

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]

Abstract

Abstract is missing.