Parallel Longest Increasing Subsequence and van Emde Boas Trees-Reference-Cited by-同舟云学术

Parallel Longest Increasing Subsequence and van Emde Boas Trees

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:

Gu Yan¹^ORCID,Men Ziyang¹^ORCID,Shen Zheqi¹^ORCID,Sun Yihan¹^ORCID,Wan Zijin¹^ORCID

Affiliation:

1. UC Riverside, Riverside, USA

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference80 articles.

1. Peyman Afshani and Zhewei Wei. 2017. Independent range sampling revisited. In esa. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Peyman Afshani and Zhewei Wei. 2017. Independent range sampling revisited. In esa. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

2. Best position algorithms for efficient top-k query processing

3. Yaroslav Akhremtsev and Peter Sanders . 2016 . Fast Parallel Operations on Search Trees. In IEEE International Conference on High Performance Computing (HiPC). Yaroslav Akhremtsev and Peter Sanders. 2016. Fast Parallel Operations on Search Trees. In IEEE International Conference on High Performance Computing (HiPC).

4. A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem

5. Basic local alignment search tool

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel and (Nearly) Work-Efficient Dynamic Programming;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Spruce: a Fast yet Space-saving Structure for Dynamic Graph Storage;Proceedings of the ACM on Management of Data;2024-03-12

3. ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

4. Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17