Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence-Reference-Cited by-同舟云学术

Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence

Published:2023-06-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Cao Nairen¹^ORCID,Huang Shang-En¹^ORCID,Su Hsin-Hao¹^ORCID

Affiliation:

1. Boston College, Boston, USA

Funder

NSF

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3558481.3591078

Reference39 articles.

1. Bounds on the Complexity of the Longest Common Subsequence Problem

2. An 0(n log n) sorting network

3. Sorting in linear time?

4. On the distribution of the length of the longest increasing subsequence of random permutations

5. Laura Baxter , Aleksey Jironkin , Richard Hickman , Jonathan Moore , Christopher Barrington , Peter Krusche , Nigel Dyer , Vicky Buchanan-Wollaston , Alexander Tiskin , Jim Beynon , Katherine Denby , and Sascha Ott . 2012. Conserved Noncoding Sequences Highlight Shared Components of Regulatory Networks in Dicotyledonous Plants. The Plant cell , Vol. 24 (10 2012 ). https://doi.org/10.1105/tpc.112.103010 10.1105/tpc.112.103010 Laura Baxter, Aleksey Jironkin, Richard Hickman, Jonathan Moore, Christopher Barrington, Peter Krusche, Nigel Dyer, Vicky Buchanan-Wollaston, Alexander Tiskin, Jim Beynon, Katherine Denby, and Sascha Ott. 2012. Conserved Noncoding Sequences Highlight Shared Components of Regulatory Networks in Dicotyledonous Plants. The Plant cell, Vol. 24 (10 2012). https://doi.org/10.1105/tpc.112.103010

Cited by 1 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