Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence
Journal
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
Part Of
Annual ACM Symposium on Parallelism in Algorithms and Architectures
Start Page
249
End Page
259
ISBN (of the container)
978-145039545-8
Date Issued
2023-06-17
Author(s)
Event(s)
5th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023
Publisher
ACM
Type
conference paper