Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Parallelism in Randomized Incremental Algorithms
Guy E. Blelloch, Yan Gu, Julian Shun, et al.
Journal of the ACM (2020) Vol. 67, Iss. 5, pp. 1-27
Open Access | Times Cited: 14

Showing 14 citing articles:

Parallel Cover Trees and their Applications
Yan Gu, Zachary Napier, Yihan Sun, et al.
(2022), pp. 259-272
Open Access | Times Cited: 13
A fast parallelized DBSCAN algorithm based on OpenMp for detection of criminals on streaming services
Lesia Mochurad, Andrii Sydor, Oleh Ratinskiy
Frontiers in Big Data (2023) Vol. 6
Open Access | Times Cited: 6
Parallel Longest Increasing Subsequence and van Emde Boas Trees
Yan Gu, Ziyang Men, Zheqi Shen, et al.
(2023), pp. 327-340
Open Access | Times Cited: 5
Parallel Integer Sort: Theory and Practice
Xiaojun Dong, Laxman Dhulipala, Yan Gu, et al.
(2024), pp. 301-315
Open Access | Times Cited: 1
Parallel and (Nearly) Work-Efficient Dynamic Programming
Xiangyun Ding, Yan Gu, Yihan Sun
(2024)
Open Access | Times Cited: 1
Parallel Strong Connectivity Based on Faster Reachability
L. Wang, Xiaojun Dong, Yan Gu, et al.
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 2, pp. 1-29
Open Access | Times Cited: 2
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
Zheqi Shen, Zijin Wan, Yan Gu, et al.
(2022), pp. 273-286
Open Access | Times Cited: 3
Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping
Mohsen Ghaffari, Christoph Grunau
(2024) Vol. 8, pp. 1889-1900
Open Access
Teaching Parallel Algorithms Using the Binary-Forking Model
Guy E. Blelloch, Yan Gu, Yihan Sun
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (2024), pp. 346-351
Closed Access
High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems
Xiaojun Dong, Yunshu Wu, Zhongqi Wang, et al.
(2023), pp. 341-353
Open Access | Times Cited: 1
An evaluation of GPU filters for accelerating the 2D convex hull
R. C. Carrasco, Héctor Ferrada, Cristóbal A. Navarro, et al.
Journal of Parallel and Distributed Computing (2023) Vol. 184, pp. 104793-104793
Open Access | Times Cited: 1
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence
Mohsen Ghaffari, Christoph Grunau, Václav Rozhoň
(2023), pp. 1551-1562
Open Access
Fast and Space-Efficient Parallel Algorithms for Influence Maximization
L. Wang, Xiangyun Ding, Yan Gu, et al.
Proceedings of the VLDB Endowment (2023) Vol. 17, Iss. 3, pp. 400-413
Closed Access
Contour Algorithm for Connectivity
Zhihui Du, Oliver Alvarado Rodriguez, Fuhuan Li, et al.
(2023), pp. 66-75
Open Access
Page 1

Scroll to top