Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Aldous, A., Diaconis, P.: Longest Increasing Subsequences: From Patience Sorting to the Baik-Deift-Johansson Theorem. BAMS: Bulletin of the American Mathematical Society 36, 413–432 (1999)
2. Bespamyatnikh, S., Segal, M.: Enumerating Longest Increasing Subsequences and Patience Sorting. Information Processing Letters 71(1–2), 7–11 (2000)
3. Bose, P., Chan, A., Dehne, F., Latzel, M.: Coarse grained parallel maximum matching in convex bipartite graph. In: Proc. 13th International Parallel Processing Symposium (IPPS 1999), pp. 125–129 (1999)
4. Cérin, C., Dufourd, C., Myoupo, J.F.: An Efficient Parallel Solution for the Longest Increasing Subsequence Problem. In: Fith International Conference on Computing and Information (ICCI 1993), Sudbury, Ontario, pp. 200–224. IEEE Press, Los Alamitos (1993)
5. Chan, A., Dehne, F.: A note on coarse grained parallel integer sorting. Parallel Processing Letters 9(4), 533–538 (1999)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parallel Longest Increasing Subsequence and van Emde Boas Trees;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
2. Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
3. Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11
4. A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem;Information Processing Letters;2013-07
5. Parallel Longest Increasing Subsequences in Scalable Time and Memory;Parallel Processing and Applied Mathematics;2010