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
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
(2018), pp. 393-404
Open Access | Times Cited: 67
Showing 51-75 of 67 citing articles:
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
Xiaojun Dong, Yan Gu, Yihan Sun, et al.
arXiv (Cornell University) (2021)
Open Access | Times Cited: 1
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time
Laxman Dhulipala, David Eisenstat, Jakub Łącki, et al.
(2021)
Closed Access | Times Cited: 1
Laxman Dhulipala, David Eisenstat, Jakub Łącki, et al.
(2021)
Closed Access | Times Cited: 1
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
Brian Wheatman, Randal Burns, Aydın Buluç, et al.
arXiv (Cornell University) (2023)
Open Access
Brian Wheatman, Randal Burns, Aydın Buluç, et al.
arXiv (Cornell University) (2023)
Open Access
Optimization of algebraic MST algorithm based on GraphBLAS
Ying Zhao, Zhiwei Zhang
(2023), pp. 110-115
Closed Access
Ying Zhao, Zhiwei Zhang
(2023), pp. 110-115
Closed Access
Parallelism in Randomized Incremental Algorithms
Guy E. Blelloch, Yan Gu, Julian Shun, et al.
arXiv (Cornell University) (2018)
Open Access
Guy E. Blelloch, Yan Gu, Julian Shun, et al.
arXiv (Cornell University) (2018)
Open Access
Common Fate Based Episodic Segmentation by Combining Supervoxels with Deep Neural Networks
László Kopácsi, Áron Fóthi, Ádám Fodor, et al.
2022 International Joint Conference on Neural Networks (IJCNN) (2019), pp. 1-7
Closed Access
László Kopácsi, Áron Fóthi, Ádám Fodor, et al.
2022 International Joint Conference on Neural Networks (IJCNN) (2019), pp. 1-7
Closed Access
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, et al.
arXiv (Cornell University) (2020)
Open Access
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, et al.
arXiv (Cornell University) (2020)
Open Access
Conceptual and Technical Challenges for High Performance Computing
Claude Tadonki
arXiv (Cornell University) (2020)
Open Access
Claude Tadonki
arXiv (Cornell University) (2020)
Open Access
Sandslash: A Two-Level Framework for Efficient Graph Pattern Mining
Xuhao Chen, Roshan Dathathri, Gurbinder Gill, et al.
arXiv (Cornell University) (2020)
Open Access
Xuhao Chen, Roshan Dathathri, Gurbinder Gill, et al.
arXiv (Cornell University) (2020)
Open Access
Multi-Queues Can Be State-of-the-Art Priority Schedulers
Anastasiia Postnikova, Nikita Koval, Giorgi Nadiradze, et al.
Zenodo (CERN European Organization for Nuclear Research) (2022)
Open Access
Anastasiia Postnikova, Nikita Koval, Giorgi Nadiradze, et al.
Zenodo (CERN European Organization for Nuclear Research) (2022)
Open Access
DAWN: An Improved BFS Algorithm for Solving Shortest Path Problems on Unweighted Graph
Yelai Feng, Huaixi Wang, Yining Zhu, et al.
arXiv (Cornell University) (2022)
Open Access
Yelai Feng, Huaixi Wang, Yining Zhu, et al.
arXiv (Cornell University) (2022)
Open Access
ButterFly BFS - An Efficient Communication Pattern for Multi Node Traversals.
Oded Green
arXiv (Cornell University) (2021)
Closed Access
Oded Green
arXiv (Cornell University) (2021)
Closed Access
NetMF+: Network Embedding Based on Fast and Effective Single-Pass Randomized Matrix Factorization
Yuyang Xie, Jiezhong Qiu, Wenjian Yu, et al.
arXiv (Cornell University) (2021)
Open Access
Yuyang Xie, Jiezhong Qiu, Wenjian Yu, et al.
arXiv (Cornell University) (2021)
Open Access
Analysis of Work-Stealing and Parallel Cache Complexity
Yan Gu, Zachary Napier, Yihan Sun
arXiv (Cornell University) (2021)
Open Access
Yan Gu, Zachary Napier, Yihan Sun
arXiv (Cornell University) (2021)
Open Access
Theoretically and Practically Efficient Parallel Nucleus Decomposition
Jessica Shi, Laxman Dhulipala, Julian Shun
arXiv (Cornell University) (2021)
Open Access
Jessica Shi, Laxman Dhulipala, Julian Shun
arXiv (Cornell University) (2021)
Open Access
