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:

Optimal Parallel Algorithms in the Binary-Forking Model
Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, et al.
(2020)
Open Access | Times Cited: 43

Showing 1-25 of 43 citing articles:

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
ACM Transactions on Parallel Computing (2021) Vol. 8, Iss. 1, pp. 1-70
Open Access | Times Cited: 43

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms
M. Manohar, Zheqi Shen, Guy E. Blelloch, et al.
(2024), pp. 270-285
Open Access | Times Cited: 5

Parallel kd-tree with Batch Updates
Ziyang Men, Zheqi Shen, Yan Gu, et al.
Proceedings of the ACM on Management of Data (2025) Vol. 3, Iss. 1, pp. 1-26
Open Access

Randomized Incremental Convex Hull is Highly Parallel
Guy E. Blelloch, Yan Gu, Julian Shun, et al.
(2020), pp. 103-115
Open Access | Times Cited: 22

Sage
Laxman Dhulipala, Charles McGuffey, Hongbo Kang, et al.
Proceedings of the VLDB Endowment (2020) Vol. 13, Iss. 9, pp. 1598-1613
Open Access | Times Cited: 21

Parallel Cover Trees and their Applications
Yan Gu, Zachary Napier, Yihan Sun, et al.
(2022), pp. 259-272
Open Access | Times Cited: 13

Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
Xiaojun Dong, Yan Gu, Yihan Sun, et al.
(2021)
Open Access | Times Cited: 14

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 In-Place Algorithms: Theory and Practice
Yan Gu, Omar Obeya, Julian Shun
Society for Industrial and Applied Mathematics eBooks (2021), pp. 114-128
Open Access | Times Cited: 10

Fast Stencil Computations using Fast Fourier Transforms
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, et al.
(2021), pp. 8-21
Open Access | Times Cited: 10

Joinable Parallel Balanced Binary Trees
Guy E. Blelloch, Daniel Ferizovic, Yihan Sun
ACM Transactions on Parallel Computing (2022) Vol. 9, Iss. 2, pp. 1-41
Open Access | Times Cited: 6

The Processing-in-Memory Model
Hongbo Kang, Phillip B. Gibbons, Guy E. Blelloch, et al.
(2021), pp. 295-306
Open Access | Times Cited: 8

Provably Fast and Space-Efficient Parallel Biconnectivity
Xiaojun Dong, L. Wang, Yan Gu, et al.
(2023), pp. 52-65
Open Access | Times Cited: 2

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

The Read-Only Semi-External Model
Guy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, et al.
Society for Industrial and Applied Mathematics eBooks (2021), pp. 70-84
Closed Access | Times Cited: 4

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

Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees
Daniel Anderson, Guy E. Blelloch
(2024)
Closed 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

Towards Scalable and Practical Batch-Dynamic Connectivity
Quinten De Man, Laxman Dhulipala, Adam Karczmarz, et al.
Proceedings of the VLDB Endowment (2024) Vol. 18, Iss. 3, pp. 889-901
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

Optimal Parallel Sorting with Comparison Errors
Michael T. Goodrich, Riko Jacob
(2023), pp. 355-365
Open Access | Times Cited: 1

A Fast Algorithm for Aperiodic Linear Stencil Computation using Fast Fourier Transforms
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, et al.
ACM Transactions on Parallel Computing (2023) Vol. 10, Iss. 4, pp. 1-34
Closed Access | Times Cited: 1

Page 1 - Next Page

Scroll to top