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:
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
Showing 14 citing articles:
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
Nearly Optimal Communication and Query Complexity of Bipartite Matching
Joakim Blikstad, Jan van den Brand, Yuval Efron, et al.
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (2022)
Open Access | Times Cited: 6
Joakim Blikstad, Jan van den Brand, Yuval Efron, et al.
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (2022)
Open Access | Times Cited: 6
Collaborative Learning in General Graphs With Limited Memorization: Complexity, Learnability, and Reliability
Feng Li, Xuyang Yuan, Lina Wang, et al.
IEEE/ACM Transactions on Networking (2023) Vol. 31, Iss. 6, pp. 3222-3237
Open Access | Times Cited: 2
Feng Li, Xuyang Yuan, Lina Wang, et al.
IEEE/ACM Transactions on Networking (2023) Vol. 31, Iss. 6, pp. 3222-3237
Open Access | Times Cited: 2
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
Computing Replacement Paths in the CONGEST Model
Vignesh Manoharan, Vijaya Ramachandran
Lecture notes in computer science (2024), pp. 420-437
Closed Access
Vignesh Manoharan, Vijaya Ramachandran
Lecture notes in computer science (2024), pp. 420-437
Closed Access
The sparsest additive spanner via multiple weighted BFS trees
Keren Censor-Hillel, Ami Paz, Noam Ravid
Theoretical Computer Science (2020) Vol. 840, pp. 33-44
Open Access | Times Cited: 3
Keren Censor-Hillel, Ami Paz, Noam Ravid
Theoretical Computer Science (2020) Vol. 840, pp. 33-44
Open Access | Times Cited: 3
AORM: Fast Incremental Arbitrary-Order Reachability Matrix Computation for Massive Graphs
Sung-Soo Kim, Young‐Kuk Kim, Young-Min Kang
IEEE Access (2021) Vol. 9, pp. 69539-69558
Open Access | Times Cited: 3
Sung-Soo Kim, Young‐Kuk Kim, Young-Min Kang
IEEE Access (2021) Vol. 9, pp. 69539-69558
Open Access | Times Cited: 3
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
Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
Aaron Bernstein, Danupon Nanongkai
SIAM Journal on Computing (2021) Vol. 52, Iss. 2, pp. STOC19-127
Closed Access
Aaron Bernstein, Danupon Nanongkai
SIAM Journal on Computing (2021) Vol. 52, Iss. 2, pp. STOC19-127
Closed Access
