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:

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

Showing 25 citing articles:

A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability
Prasad Jayanti, Siddhartha Jayanti, Uğur Yavuz, et al.
Proceedings of the ACM on Programming Languages (2024) Vol. 8, Iss. POPL, pp. 2456-2484
Open Access | Times Cited: 3

Meerkat: A Framework for Dynamic Graph Algorithms on GPUs
Kevin Jude Concessao, Unnikrishnan Cheramangalath, Ricky Dev, et al.
International Journal of Parallel Programming (2024)
Closed Access | Times Cited: 2

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

Concurrent disjoint set union
Siddhartha Jayanti, Robert E. Tarjan
Distributed Computing (2021) Vol. 34, Iss. 6, pp. 413-436
Open Access | Times Cited: 9

Thrifty Label Propagation: Fast Connected Components for Skewed-Degree Graphs
Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck
(2021) Vol. abs 2008 3909, pp. 226-237
Open Access | Times Cited: 9

ParChain
Shangdi Yu, Yiqiu Wang, Yan Gu, et al.
Proceedings of the VLDB Endowment (2021) Vol. 15, Iss. 2, pp. 285-298
Open Access | Times Cited: 7

Provably Fast and Space-Efficient Parallel Biconnectivity
Xiaojun Dong, L. Wang, Yan Gu, et al.
(2023), pp. 52-65
Open Access | Times Cited: 2

Incremental Connected Component Detection for Graph Streams on GPU
Kyoungsoo Bok, Nam‐Young Kim, Dojin Choi, et al.
Electronics (2023) Vol. 12, Iss. 6, pp. 1465-1465
Open Access | Times Cited: 2

Parallel Strong Connectivity Based on Faster Reachability
L. Wang, Xiaojun Dong, Yan Gu, et al.
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 2, pp. 1-29
Open Access | Times Cited: 2

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

Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis
Tony Liu, Andrew Lumsdaine, Mahantesh Halappanavar, et al.
ACM Journal of Experimental Algorithmics (2022) Vol. 27, pp. 1-31
Open Access | Times Cited: 3

Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads
Quanquan C. Liu, Julian Shun, Igor Zablotchi
(2024), pp. 286-300
Open Access

BTS: Load-Balanced Distributed Union-Find for Finding Connected Components with Balanced Tree Structures
Chaeeun Kim, Changhun Han, Ha-Myung Park
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 1090-1102
Closed Access

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

Meta-Configuration Tracking for Machine-Certified Correctness of Concurrent Data Structures (Abstract)
Prasad Jayanti, Siddhartha Jayanti, Uğur Yavuz, et al.
(2024), pp. 21-22
Closed Access

ALZI: An Improved Parallel Algorithm for Finding Connected Components in Large Graphs
S Boddu, Maleq Khan
Lecture notes in computer science (2024), pp. 134-147
Closed Access

Towards Scalable and Practical Batch-Dynamic Connectivity
Quinten De Man, Laxman Dhulipala, Adam Karczmarz, et al.
Proceedings of the VLDB Endowment (2024) Vol. 18, Iss. 3, pp. 889-901
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

Provably-Efficient and Internally-Deterministic Parallel Union-Find
Alexander Fedorov, Diba Hashemi, Giorgi Nadiradze, et al.
(2023), pp. 261-271
Open Access | Times Cited: 1

Graph Connectivity in Log Steps Using Label Propagation
Paul Burkhardt
Parallel Processing Letters (2021) Vol. 31, Iss. 04
Open Access | Times Cited: 1

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
L. Wang, Xiangyun Ding, Yan Gu, et al.
Proceedings of the VLDB Endowment (2023) Vol. 17, Iss. 3, pp. 400-413
Closed Access

Contour Algorithm for Connectivity
Zhihui Du, Oliver Alvarado Rodriguez, Fuhuan Li, et al.
(2023), pp. 66-75
Open Access

Page 1

Scroll to top