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:

Parallel Batch-Dynamic Graph Connectivity
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, et al.
(2019)
Open Access | Times Cited: 24

Showing 24 citing articles:

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
ConnectIt
Laxman Dhulipala, Changwan Hong, Julian Shun
Proceedings of the VLDB Endowment (2020) Vol. 14, Iss. 4, pp. 653-667
Open Access | Times Cited: 25
Practice of Streaming and Dynamic Graphs: Concepts, Models, Systems, and Parallelism.
Maciej Besta, Marc Fischer, Vasiliki Kalavri, et al.
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 23
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
Xiaojun Dong, Yan Gu, Yihan Sun, et al.
(2021)
Open Access | Times Cited: 14
Fully Dynamic c-Edge Connectivity in Subpolynomial Time.
Wenyu Jin, Xiaorui Sun
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 12
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model
Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan
(2020) Vol. 20, pp. 51-61
Open Access | Times Cited: 12
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
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
Maciej Besta, Marc Fischer, Vasiliki Kalavri, et al.
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 11
The Processing-in-Memory Model
Hongbo Kang, Phillip B. Gibbons, Guy E. Blelloch, et al.
(2021), pp. 295-306
Open Access | Times Cited: 8
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
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model
Krzysztof Nowicki, Krzysztof Onak
Society for Industrial and Applied Mathematics eBooks (2021), pp. 2939-2958
Open Access | Times Cited: 5
DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs
Michael Yu, Lu Qin, Ying Zhang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2021), pp. 1332-1343
Closed Access | Times Cited: 5
Recent Advances in Fully Dynamic Graph Algorithms.
Kathrin Hanauer, Monika Henzinger, Christian Schulz
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 4
HyPR: Hybrid Page Ranking on Evolving Graphs
Hemant Kumar Giri, Mridul Haque, Dip Sankar Banerjee
(2020)
Closed Access | Times Cited: 3
Input-Dynamic Distributed Algorithms for Communication Networks
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, et al.
Proceedings of the ACM on Measurement and Analysis of Computing Systems (2021) Vol. 5, Iss. 1, pp. 1-33
Open Access | Times Cited: 3
How fast can you update your MST? (Dynamic algorithms for cluster computing)
Seth Gilbert, Lawrence Li
arXiv (Cornell University) (2020)
Open Access | Times Cited: 2
Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees.
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 2
Parallel Batch-dynamic Trees via Change Propagation
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 2
Input-Dynamic Distributed Algorithms for Communication Networks
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, et al.
(2021), pp. 71-72
Open Access | Times Cited: 2
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
David Durfee, Laxman Dhulipala, Janardhan Kulkarni, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 1
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
HiPC 2023 Student Research Symposium (HiPC SRS 2023)
Arnab K. Paul, Suren Byna
(2023), pp. 65-94
Open Access
A Scalable Concurrent Algorithm for Dynamic Connectivity
Alexander Fedorov, Nikita Koval, Dan Alistarh
arXiv (Cornell University) (2021)
Open Access
Page 1

Scroll to top