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:

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
(2018), pp. 393-404
Open Access | Times Cited: 67

Showing 26-50 of 67 citing articles:

Taming the Zoo: The Unified GraphIt Compiler Framework for Novel Architectures
Ajay Brahmakshatriya, Emily Furst, Victor A. Ying, et al.
(2021), pp. 429-442
Closed Access | Times Cited: 9
Single Machine Graph Analytics on Massive Datasets Using Intel Optane DC Persistent Memory.
Gurbinder Gill, Roshan Dathathri, Loc Hoang, et al.
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 9
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
Abdurrahman Yaşar, Sivasankaran Rajamanickam, Jonathan W. Berry, et al.
IEEE Transactions on Parallel and Distributed Systems (2021) Vol. 33, Iss. 2, pp. 444-458
Open Access | Times Cited: 8
Vectorising k-Core Decomposition for GPU Acceleration
Amir Mehrafsa, Sean Chester, Alex Thomo
(2020), pp. 1-4
Closed Access | Times Cited: 7
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms
Laxman Dhulipala, Changwan Hong, Julian Shun
arXiv (Cornell University) (2020)
Open Access | Times Cited: 7
Semi-Asymmetric Parallel Graph Algorithms for NVRAMs
Laxman Dhulipala, Charles McGuffey, Hongbo Kang, et al.
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 6
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers
Dan Alistarh, Giorgi Nadiradze, Nikita Koval
(2019) Vol. 12, pp. 145-154
Open Access | Times Cited: 6
HNGraph: Parallel Graph Processing in Hybrid Memory Based NUMA Systems
Wei Liu, Haikun Liu, Xiaofei Liao, et al.
(2021), pp. 388-397
Closed Access | Times Cited: 6
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra
Maciej Besta, Zur Vonarburg-Shmaria, Yannick Schaffner, et al.
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 5
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems
Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwaśniewski, et al.
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 5
Parallel Index-Based Structural Graph Clustering and Its Approximation
Tom Tseng, Laxman Dhulipala, Julian Shun
Proceedings of the 2022 International Conference on Management of Data (2021), pp. 1851-1864
Open 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
Accelerating Computation of Steiner Trees on GPUs
Rajesh Pandian Muniasamy, Rupesh Nasre, N. S. Narayanaswamy
International Journal of Parallel Programming (2021) Vol. 50, Iss. 1, pp. 152-185
Closed Access | Times Cited: 4
Towards Lightweight and Automated Representation Learning System for Networks
Yuyang Xie, Jiezhong Qiu, Laxman Dhulipala, et al.
IEEE Transactions on Knowledge and Data Engineering (2023) Vol. 35, Iss. 9, pp. 9613-9627
Open Access | Times Cited: 1
Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels
Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik
Society for Industrial and Applied Mathematics eBooks (2022), pp. 72-83
Open Access | Times Cited: 2
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
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
Laxman Dhulipala, Charlie McGuffey, Hongbo Kang, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 2
Fast Spectral Graph Layout on Multicore Platforms
Ashirbad Mishra, Shad Kirmani, Kamesh Madduri
(2020), pp. 1-11
Open Access | Times Cited: 2
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
Abdurrahman Yaşar, Sivasankaran Rajamanickam, Jonathan W. Berry, et al.
(2020)
Open Access | Times Cited: 2
Parallel Batch-Dynamic k-Core Decomposition.
Quanquan C. Liu, Jessica Shi, Shangdi Yu, et al.
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 2
Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!
Ruoming Jin, Zhen Peng, Wendell Wu, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 1
Skeletonization Combined with Deep Neural Networks for Superpixel Temporal Propagation
Ádám Fodor, Áron Fóthi, László Kopácsi, et al.
2022 International Joint Conference on Neural Networks (IJCNN) (2019), pp. 1-7
Closed Access | Times Cited: 1
Relaxed Scheduling for Scalable Belief Propagation.
Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 1
A Study of APIs for Graph Analytics Workloads
Hochan Lee, David Wong, Loc Hoang, et al.
(2020), pp. 228-239
Closed Access | Times Cited: 1
Things to Consider to Enable Dynamic Graphs in Processing-in-Memory
Euna Kim, Hyesoon Kim
(2020), pp. 297-303
Open Access | Times Cited: 1

Scroll to top