Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence

Nairen Cao, Shang-En Huang, Hsin-Hao Su. Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence. In Kunal Agrawal, Julian Shun, editors, Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, June 17-19, 2023. pages 249-259, ACM, 2023. [doi]

Abstract

Abstract is missing.