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:

Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
Xiaojun Dong, Yan Gu, Yihan Sun, et al.
(2021)
Open Access | Times Cited: 14

Showing 14 citing articles:

Parallel Filtered Graphs for Hierarchical Clustering
Shangdi Yu, Julian Shun
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023), pp. 1967-1980
Open Access | Times Cited: 2

Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
Zheqi Shen, Zijin Wan, Yan Gu, et al.
(2022), pp. 273-286
Open Access | Times Cited: 3

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

Neuromorphic Computing for Graph Analytics
Anup Das
(2024), pp. 1-7
Closed Access

Communication-Efficient ∆-Stepping for Distributed Computing Systems
Haomeng Zhang, Junfei Xie, Xinyu Zhang
(2023), pp. 369-374
Closed Access | Times Cited: 1

Fast Parallel Bellman-Ford-Moore Algorithm Implementation for Small Graphs
Alexei Vezolainen, A. Salnikov, Artem Klyuchikov, et al.
Lecture notes in computer science (2022), pp. 436-449
Closed Access | Times Cited: 1

VDS: A Variant of Δ-stepping Algorithm for Parallel SSSP Problem
Praveen Kumar, Anil Kumar Singh
2022 IEEE International Conference on Data Science and Information System (ICDSIS) (2022), pp. 1-7
Closed Access | Times Cited: 1

A Bucket-aware Asynchronous Single-Source Shortest Path Algorithm on GPU
Yuan Zhang, Huawei Cao, J. P. Zhang, et al.
(2023), pp. 50-60
Open Access

A Case Study of an Adaptive Delta-Stepping Algorithm in OpenMP
Mandeep Khadka, Rachata Ausavarungnirun, Christian Terboven
(2023), pp. 112-119
Closed Access

Brief Announcement: A Parallel (Δ, Γ)-Stepping Algorithm for the Constrained Shortest Path Problem
Tayebeh Bahreini, Nathan Fisher, Daniel Grosu
(2022), pp. 287-289
Closed Access

Parallel-Friendly and Work-Efficient Single Source Shortest Path Algorithm on Single-Node System
Jie Zhang, Yuan Zhang, Yiming Sun, et al.
(2022), pp. 1115-1122
Closed Access

Page 1

Scroll to top