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:
Distributed Weighted All Pairs Shortest Paths Through Pipelining
Udit Agarwal, Vijaya Ramachandran
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2019), pp. 23-32
Closed Access | Times Cited: 16
Udit Agarwal, Vijaya Ramachandran
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2019), pp. 23-32
Closed Access | Times Cited: 16
Showing 16 citing articles:
A round-efficient distributed betweenness centrality algorithm
Loc Hoang, Matteo Pontecorvi, Roshan Dathathri, et al.
(2019)
Open Access | Times Cited: 35
Loc Hoang, Matteo Pontecorvi, Roshan Dathathri, et al.
(2019)
Open Access | Times Cited: 35
Single-Source Shortest Paths in the CONGEST Model with Improved Bound
Shiri Chechik, Doron Mukhtar
(2020), pp. 464-473
Closed Access | Times Cited: 16
Shiri Chechik, Doron Mukhtar
(2020), pp. 464-473
Closed Access | Times Cited: 16
Faster Deterministic All Pairs Shortest Paths in Congest Model
Udit Agarwal, Vijaya Ramachandran
(2020), pp. 11-21
Open Access | Times Cited: 14
Udit Agarwal, Vijaya Ramachandran
(2020), pp. 11-21
Open Access | Times Cited: 14
Distributed Exact Shortest Paths in Sublinear Time
Michael Elkin
Journal of the ACM (2020) Vol. 67, Iss. 3, pp. 1-36
Open Access | Times Cited: 12
Michael Elkin
Journal of the ACM (2020) Vol. 67, Iss. 3, pp. 1-36
Open Access | Times Cited: 12
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths
Matteo Pontecorvi, Vijaya Ramachandran
arXiv (Cornell University) (2018)
Open Access | Times Cited: 12
Matteo Pontecorvi, Vijaya Ramachandran
arXiv (Cornell University) (2018)
Open Access | Times Cited: 12
Minor Sparsifiers and the Distributed Laplacian Paradigm
Sebastian Forster, Gramoz Goranci, Yang P. Liu, et al.
(2022), pp. 989-999
Open Access | Times Cited: 7
Sebastian Forster, Gramoz Goranci, Yang P. Liu, et al.
(2022), pp. 989-999
Open Access | Times Cited: 7
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing
Goran Žužić, Gramoz Goranci, Mingquan Ye, et al.
Society for Industrial and Applied Mathematics eBooks (2022), pp. 2549-2579
Open Access | Times Cited: 6
Goran Žužić, Gramoz Goranci, Mingquan Ye, et al.
Society for Industrial and Applied Mathematics eBooks (2022), pp. 2549-2579
Open Access | Times Cited: 6
On Sparsity Awareness in Distributed Computations
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
(2021), pp. 151-161
Open Access | Times Cited: 8
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
(2021), pp. 151-161
Open Access | Times Cited: 8
Single-source shortest paths in the CONGEST model with improved bounds
Shiri Chechik, Doron Mukhtar
Distributed Computing (2021) Vol. 35, Iss. 4, pp. 357-374
Closed Access | Times Cited: 6
Shiri Chechik, Doron Mukhtar
Distributed Computing (2021) Vol. 35, Iss. 4, pp. 357-374
Closed Access | Times Cited: 6
Minor Sparsifiers and the Distributed Laplacian Paradigm
Sebastian Forster, Gramoz Goranci, Yang P. Liu, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 5
Sebastian Forster, Gramoz Goranci, Yang P. Liu, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 5
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing
Goran Žužić, Gramoz Goranci, Mingquan Ye, et al.
arXiv (Cornell University) (2021)
Open Access | Times Cited: 2
Goran Žužić, Gramoz Goranci, Mingquan Ye, et al.
arXiv (Cornell University) (2021)
Open Access | Times Cited: 2
Distance Computations in the Hybrid Network Model via Oracle Simulations
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
arXiv (Cornell University) (2020)
Open Access | Times Cited: 1
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
arXiv (Cornell University) (2020)
Open Access | Times Cited: 1
Distributed Distance Approximation
Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 1
Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 1
On Sparsity Awareness in Distributed Computations
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 1
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 1
Faster Deterministic All Pairs Shortest Paths in Congest Model
Udit Agarwal, Vijaya Ramachandran
arXiv (Cornell University) (2020)
Closed Access
Udit Agarwal, Vijaya Ramachandran
arXiv (Cornell University) (2020)
Closed Access
New Advances in Distributed Optimization and Distance Computation
Yuval Efron, Keren Censor-Hillel
(2020)
Closed Access
Yuval Efron, Keren Censor-Hillel
(2020)
Closed Access
