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 1-25 of 67 citing articles:

Efficient ($$\alpha $$, $$\beta $$)-core computation in bipartite graphs
Boge Liu, Long Yuan, Xuemin Lin, et al.
The VLDB Journal (2020) Vol. 29, Iss. 5, pp. 1075-1099
Closed Access | Times Cited: 62
Optimal Parallel Algorithms in the Binary-Forking Model
Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, et al.
(2020)
Open Access | Times Cited: 43
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems
Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwaśniewski, et al.
(2021)
Open Access | Times Cited: 40
Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
Prashant Pandey, Brian Wheatman, Helen Xu, et al.
Proceedings of the 2022 International Conference on Management of Data (2021)
Open Access | Times Cited: 31
A round-efficient distributed betweenness centrality algorithm
Loc Hoang, Matteo Pontecorvi, Roshan Dathathri, et al.
(2019)
Open Access | Times Cited: 35
Parallel Algorithms for Butterfly Computations
Jessica Shi, Julian Shun
Society for Industrial and Applied Mathematics eBooks (2019), pp. 16-30
Open Access | Times Cited: 33
FlexMiner: A Pattern-Aware Accelerator for Graph Pattern Mining
Xuhao Chen, Tianhao Huang, Shuotao Xu, et al.
(2021), pp. 581-594
Closed Access | Times Cited: 25
LightNE: A Lightweight Graph Processing System for Network Embedding
Jiezhong Qiu, Laxman Dhulipala, Jie Tang, et al.
Proceedings of the 2022 International Conference on Management of Data (2021)
Closed Access | Times Cited: 24
The Graph Based Benchmark Suite (GBBS)
Laxman Dhulipala, Jessica Shi, Tom Tseng, et al.
(2020)
Open Access | Times Cited: 27
Parallel Clique Counting and Peeling Algorithms
Jessica Shi, Laxman Dhulipala, Julian Shun
Society for Industrial and Applied Mathematics eBooks (2021), pp. 135-146
Open Access | Times Cited: 23
Sandslash
Xuhao Chen, Roshan Dathathri, Gurbinder Gill, et al.
(2021)
Open Access | Times Cited: 23
Parallel Batch-Dynamic Graph Connectivity
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, et al.
(2019)
Open Access | Times Cited: 24
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
Scalable, Multi-Constraint, Complex-Objective Graph Partitioning
George M. Slota, Cameron Root, Karen Devine, et al.
IEEE Transactions on Parallel and Distributed Systems (2020) Vol. 31, Iss. 12, pp. 2789-2801
Open Access | Times Cited: 21
A Parallel Packed Memory Array to Store Dynamic Graphs
Brian Wheatman, Helen Xu
Society for Industrial and Applied Mathematics eBooks (2021), pp. 31-45
Open Access | Times Cited: 18
Parallel algorithms for finding connected components using linear algebra
Yongzhe Zhang, Ariful Azad, Aydın Buluç
Journal of Parallel and Distributed Computing (2020) Vol. 144, pp. 14-27
Open Access | Times Cited: 18
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
Maciej Besta, Armon Carigiet, Kacper Janda, et al.
(2020), pp. 1-17
Open Access | Times Cited: 17
Parallel Batch-Dynamic k-Clique Counting
Laxman Dhulipala, Quanquan C. Liu, Julian Shun, et al.
Society for Industrial and Applied Mathematics eBooks (2021), pp. 129-143
Closed Access | Times Cited: 14
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
Xiaojun Dong, Yan Gu, Yihan Sun, et al.
(2021)
Open Access | Times Cited: 14
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
Low-Latency Graph Streaming Using Compressed Purely-Functional Trees.
Laxman Dhulipala, Julian Shun, Guy E. Blelloch
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 12
Cache-Efficient Fork-Processing Patterns on Large Graphs
Shengliang Lu, Shixuan Sun, Johns Paul, et al.
Proceedings of the 2022 International Conference on Management of Data (2021), pp. 1208-1221
Open Access | Times Cited: 11
Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
Changwan Hong, Laxman Dhulipala, Julian Shun
(2020), pp. 55-69
Open Access | Times Cited: 11
GeoGraph
Yiqiu Wang, Shangdi Yu, Laxman Dhulipala, et al.
ACM SIGOPS Operating Systems Review (2021) Vol. 55, Iss. 1, pp. 38-46
Closed Access | Times Cited: 10
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
Maciej Besta, Armon Carigiet, Zur Vonarburg-Shmaria, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 9
Page 1 - Next Page

Scroll to top