On the public citation graph

Minimizing Communication in All-Pairs Shortest Paths

https://doi.org/10.1109/ipdps.2013.111

0 signed · 80 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1096-9128(199704)9:4<255::aid-cpe250>3.0.co;2-2openalex-snapshot

SUMMA: scalable universal matrix multiplication algorithm

inferredcites →https://doi.org/10.1006/jcss.1995.1078openalex-snapshot

On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs

inferredcites →https://doi.org/10.1007/3-540-48224-5_15openalex-snapshot

All-Pairs Shortest Paths Computation in the BSP Model

inferredcites →https://doi.org/10.1007/978-3-540-68552-4_24openalex-snapshot

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks

inferredcites →https://doi.org/10.1007/978-3-642-23397-5_10openalex-snapshot

Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms

inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot

Gaussian elimination is not optimal

inferredcites →https://doi.org/10.1007/s00224-010-9273-8openalex-snapshot

The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation

inferredcites →https://doi.org/10.1016/0047-2352(82)90013-7openalex-snapshot

Urban operations research

inferredcites →https://doi.org/10.1016/0167-8191(89)90091-4openalex-snapshot

Communication efficient matrix multiplication on hypercubes

inferredcites →https://doi.org/10.1016/0167-8191(93)90029-kopenalex-snapshot

Minimizing the communication time for matrix multiplication on multiprocessors

inferredcites →https://doi.org/10.1016/0304-3975(90)90188-nopenalex-snapshot

Communication complexity of PRAMs

inferredcites →https://doi.org/10.1016/0743-7315(91)90083-lopenalex-snapshot

Scalability of parallel algorithms for the all-pairs shortest-path problem

inferredcites →https://doi.org/10.1016/j.jpdc.2004.03.021openalex-snapshot

Communication lower bounds for distributed-memory matrix multiplication

inferredcites →https://doi.org/10.1016/j.parco.2009.12.002openalex-snapshot

Solving path problems on the GPU

inferredcites →https://doi.org/10.1016/s0196-6774(03)00076-2openalex-snapshot

Δ-stepping: a parallelizable shortest path algorithm

inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot

Matrix multiplication via arithmetic progressions

inferredcites →https://doi.org/10.1109/infcom.2012.6195470openalex-snapshot

REWIRE: An optimization-based framework for unstructured data center network design

inferredcites →https://doi.org/10.1109/ipdps.2011.89openalex-snapshot

PHAST: Hardware-Accelerated Shortest Path Trees

inferredcites →https://doi.org/10.1109/tpds.2004.44openalex-snapshot

Optimizing graph algorithms for improved cache performance

inferredcites →https://doi.org/10.1137/0210049openalex-snapshot

Parallel Matrix and Graph Algorithms

inferredcites →https://doi.org/10.1137/0220006openalex-snapshot

High-Probability Parallel Transitive-Closure Algorithms

inferredcites →https://doi.org/10.1137/060653391openalex-snapshot

The Metric Nearness Problem

inferredcites →https://doi.org/10.1137/0716027openalex-snapshot

Generalized Nested Dissection

inferredcites →https://doi.org/10.1137/090769156openalex-snapshot

Minimizing Communication in Numerical Linear Algebra

inferredcites →https://doi.org/10.1137/1.9780898719642openalex-snapshot

ScaLAPACK Users' Guide

inferredcites →https://doi.org/10.1137/s0895479896297744openalex-snapshot

Locality of Reference in LU Decomposition with Partial Pivoting

inferredcites →https://doi.org/10.1145/1248377.1248392openalex-snapshot

The cache-oblivious gaussian elimination paradigm

inferredcites →https://doi.org/10.1145/1989493.1989495openalex-snapshot

Graph expansion and communication costs of fast matrix multiplication

inferredcites →https://doi.org/10.1145/2063384.2063487openalex-snapshot

Improving communication performance in dense linear algebra via topology aware collectives

inferredcites →https://doi.org/10.1145/2312005.2312044openalex-snapshot

Communication-optimal parallel algorithm for strassen's matrix multiplication

inferredcites →https://doi.org/10.1145/2332432.2332504openalex-snapshot

Optimal distributed all pairs shortest paths and applications

inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot

Matrix multiplication via arithmetic progressions

inferredcites →https://doi.org/10.1145/321105.321107openalex-snapshot

A Theorem on Boolean Matrices

inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot

Efficient Algorithms for Shortest Paths in Sparse Networks

inferredcites →https://doi.org/10.1145/358876.358884openalex-snapshot

A more general algorithm for computing closed semiring costs between vertices of a directed graph

inferredcites →https://doi.org/10.1145/367766.368168openalex-snapshot

Algorithm 97: Shortest path

inferredcites →https://doi.org/10.1145/567112.567114openalex-snapshot

All pairs shortest paths using bridging sets and rectangular matrix multiplication

inferredcites →https://doi.org/10.1145/800076.802486openalex-snapshot

I/O complexity

inferredcites →https://doi.org/10.1145/800116.803775openalex-snapshot

Algorithmic aspects of vertex elimination

inferredcites →https://doi.org/10.1147/rd.395.0575openalex-snapshot

A three-dimensional approach to parallel matrix multiplication

inferredcites →https://doi.org/10.1287/trsc.28.4.292openalex-snapshot

A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures

inferredcites →https://doi.org/10.21236/ada580350openalex-snapshot

Minimizing Communication in All-Pairs Shortest Paths

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-20912-4_6openalex-snapshot

On Approximating Metric Nearness Through Deep Learning

inferred← citeshttps://doi.org/10.1007/978-3-031-62245-8_4openalex-snapshot

Enhanced OpenMP Algorithm to Compute All-Pairs Shortest Path on X86 Architectures

inferred← citeshttps://doi.org/10.1007/978-3-319-53982-9_11openalex-snapshot

A Comparison of One-Pass and Bi-directional Approaches Applied to Large-Scale Road Inspection

inferred← citeshttps://doi.org/10.1007/s42514-025-00234-1openalex-snapshot

A parallel all-pairs shortest paths algorithm for dynamic graphs

inferred← citeshttps://doi.org/10.1016/j.procs.2015.05.353openalex-snapshot

Graphs, Matrices, and the GraphBLAS: Seven Good Reasons

inferred← citeshttps://doi.org/10.1017/s0962492914000038openalex-snapshot

Communication lower bounds and optimal algorithms for numerical linear algebra

inferred← citeshttps://doi.org/10.1038/s41598-021-90943-8openalex-snapshot

A route pruning algorithm for an automated geographic location graph construction

inferred← citeshttps://doi.org/10.1109/bigdata.2018.8622617openalex-snapshot

Scalable Manifold Learning for Big Data with Apache Spark

inferred← citeshttps://doi.org/10.1109/cluster49012.2020.00044openalex-snapshot

Efficient Execution of Dynamic Programming Algorithms on Apache Spark

inferred← citeshttps://doi.org/10.1109/hpec.2016.7761646openalex-snapshot

Mathematical foundations of the GraphBLAS

inferred← citeshttps://doi.org/10.1109/icpads.2015.10openalex-snapshot

Fast Execution of Simultaneous Breadth-First Searches on Sparse Graphs

inferred← citeshttps://doi.org/10.1109/ipdps.2014.49openalex-snapshot

How Well Do Graph-Processing Platforms Perform? An Empirical Performance Evaluation and Analysis

inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.221openalex-snapshot

GABB Introduction

inferred← citeshttps://doi.org/10.1109/ipdpsw.2019.00053openalex-snapshot

LAGraph: A Community Effort to Collect Graph Algorithms Built on Top of the GraphBLAS

inferred← citeshttps://doi.org/10.1109/sc41405.2020.00010openalex-snapshot

Scalable Knowledge Graph Analytics at 136 Petaflop/s

inferred← citeshttps://doi.org/10.1109/tcss.2018.2888689openalex-snapshot

A Distributed Spatiotemporal Contingency Analysis for the Lebanese Power Grid

inferred← citeshttps://doi.org/10.1109/tkde.2018.2808495openalex-snapshot

Top-k Critical Vertices Query on Shortest Path

inferred← citeshttps://doi.org/10.1109/tkde.2024.3393936openalex-snapshot

A Survey on Concurrent Processing of Graph Analytical Queries: Systems and Algorithms

inferred← citeshttps://doi.org/10.1145/2568088.2576761openalex-snapshot

Benchmarking graph-processing platforms

inferred← citeshttps://doi.org/10.1145/2612669.2612694openalex-snapshot

On characterizing the data movement complexity of computational DAGs for parallel execution

inferred← citeshttps://doi.org/10.1145/2676726.2677010openalex-snapshot

On Characterizing the Data Access Complexity of Programs

inferred← citeshttps://doi.org/10.1145/2693656openalex-snapshot

On Using the Roofline Model with Lower Bounds on Data Movement

inferred← citeshttps://doi.org/10.1145/2775051.2677010openalex-snapshot

On Characterizing the Data Access Complexity of Programs

inferred← citeshttps://doi.org/10.1145/2882903.2882959openalex-snapshot

iBFS

inferred← citeshttps://doi.org/10.1145/3293883.3299109openalex-snapshot

Toward efficient architecture-independent algorithms for dynamic programs

inferred← citeshttps://doi.org/10.1145/3332466.3374533openalex-snapshot

A supernodal all-pairs shortest path algorithm

inferred← citeshttps://doi.org/10.1145/3337821.3337852openalex-snapshot

Solving All-Pairs Shortest-Paths Problem in Large Graphs Using Apache Spark

inferred← citeshttps://doi.org/10.1145/3368826.3377916openalex-snapshot

Deriving parametric multi-way recursive divide-and-conquer dynamic programming algorithms using polyhedral compilers

inferred← citeshttps://doi.org/10.1145/3431379.3460651openalex-snapshot

Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters

inferred← citeshttps://doi.org/10.1145/3437801.3441609openalex-snapshot

I/O lower bounds for auto-tuning of convolutions in CNNs

inferred← citeshttps://doi.org/10.1145/3472456.3472524openalex-snapshot

Communication Avoiding All-Pairs Shortest Paths Algorithm for Sparse Graphs

inferred← citeshttps://doi.org/10.21122/2309-4923-2017-3-68-75openalex-snapshot

HETEROGENIOUS BLOCKED ALL-PAIRS SHORTEST PATHS ALGORITHM

inferred← citeshttps://doi.org/10.21122/2309-4923-2021-3-40-50openalex-snapshot

Optimization of data allocation in hierarchical memory for blocked shortest paths algorithms

inferred← citeshttps://doi.org/10.21236/ada580350openalex-snapshot

Minimizing Communication in All-Pairs Shortest Paths

inferred← citeshttps://doi.org/10.48550/arxiv.1401.3915openalex-snapshot

Community Detection in Networks using Graph Distance

inferred← citeshttps://doi.org/10.48550/arxiv.1808.10776openalex-snapshot

Scalable Manifold Learning for Big Data with Apache Spark

inferred← citeshttps://doi.org/10.48550/arxiv.1809.09330openalex-snapshot

Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming and Linear Algebra

inferred← citeshttps://doi.org/10.48550/arxiv.2010.12243openalex-snapshot

An analysis of the SIGMOD 2014 Programming Contest: Complex queries on the LDBC social network graph

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.