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:

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

Showing 22 citing articles:

Optimal Parallel Algorithms in the Binary-Forking Model
Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, et al.
(2020)
Open Access | Times Cited: 43
Parallel Cover Trees and their Applications
Yan Gu, Zachary Napier, Yihan Sun, et al.
(2022), pp. 259-272
Open Access | Times Cited: 13
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
Laxman Dhulipala, Xiaojun Dong, Kishen N. Gowda, et al.
(2024)
Open Access | Times Cited: 2
Algorithmic Efficiency in Convex Hull Computation: Insights from 2D and 3D Implementations
Hyun Kwon, Se‐Hong Oh, Jang-Woon Baek
Symmetry (2024) Vol. 16, Iss. 12, pp. 1590-1590
Open Access | Times Cited: 2
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
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
ParGeo
Yiqiu Wang, Shangdi Yu, Laxman Dhulipala, et al.
(2022)
Closed Access | Times Cited: 5
Distributed and incremental travelling salesman algorithm on time-evolving graphs
Shalini Sharma, Jerry Chou
The Journal of Supercomputing (2021) Vol. 77, Iss. 10, pp. 10896-10920
Closed Access | Times Cited: 6
Provably Fast and Space-Efficient Parallel Biconnectivity
Xiaojun Dong, L. Wang, Yan Gu, et al.
(2023), pp. 52-65
Open Access | Times Cited: 2
Convex Envelope Method for determining liquid multi-phase equilibria in systems with arbitrary number of components
Quirin Göttl, Jonathan Pirnay, Dominik G. Grimm, et al.
Computers & Chemical Engineering (2023) Vol. 177, pp. 108321-108321
Open Access | Times Cited: 2
ConcurrentHull: A Fast Parallel Computing Approach to the Convex Hull Problem
Sina Masnadi, Joseph J. LaViola
Lecture notes in computer science (2020), pp. 593-605
Closed Access | Times Cited: 4
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
Outlier Detection for Customs Post Clearance Audit Using Convex Space Representation
Omar Alqaryouti, Nur Siyam, Khaled Shaalan
Studies in computational intelligence (2022), pp. 345-360
Closed Access | Times Cited: 3
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
Analysis of Work-Stealing and Parallel Cache Complexity
Yan Gu, Zachary Napier, Yihan Sun
Society for Industrial and Applied Mathematics eBooks (2022), pp. 46-60
Open Access | Times Cited: 2
Accelerate Incremental TSP Algorithms on Time Evolving Graphs with Partitioning Methods
Shalini Sharma, Jerry Chou
Algorithms (2022) Vol. 15, Iss. 2, pp. 64-64
Open Access | Times Cited: 2
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
Xiaojun Dong, Yan Gu, Yihan Sun, et al.
arXiv (Cornell University) (2021)
Open Access | Times Cited: 1
Polytope shaping while preserving invariance
Νικόλαος Αθανασόπουλος
2022 IEEE 61st Conference on Decision and Control (CDC) (2022), pp. 4996-5001
Open Access
Analysis of Work-Stealing and Parallel Cache Complexity
Yan Gu, Zachary Napier, Yihan Sun
arXiv (Cornell University) (2021)
Open Access
Page 1

Scroll to top