Improved Sublinear Time Algorithm for Longest Increasing Subsequence - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Michael Mitzenmacher' in GoogleThis author has not been identified. Look up 'Saeed Seddighin' in Google

runs on WebDSL