On the public citation graph
Distributed Exact Shortest Paths in Sublinear Time
0 signed · 64 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.1997.0888openalex-snapshot
A Randomized Parallel Algorithm for Single-Source Shortest Paths
inferredcites →https://doi.org/10.1006/jagm.1998.0929openalex-snapshot
Fast Distributed Construction of Smallk-Dominating Sets and Applications
inferredcites →https://doi.org/10.1006/jagm.1998.0968openalex-snapshot
Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
inferredcites →https://doi.org/10.1007/11841036_10openalex-snapshot
Dynamic Algorithms for Graph Spanners
inferredcites →https://doi.org/10.1007/3-540-52846-6_75openalex-snapshot
Generating sparse spanners for weighted graphs
inferredcites →https://doi.org/10.1007/978-3-540-73420-8_62openalex-snapshot
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners
inferredcites →https://doi.org/10.1007/978-3-642-41527-2_1openalex-snapshot
Distributed Minimum Cut Approximation
inferredcites →https://doi.org/10.1007/978-3-662-45174-8_30openalex-snapshot
Almost-Tight Distributed Minimum Cut Algorithms
inferredcites →https://doi.org/10.1007/bfb0024003openalex-snapshot
A single source shortest path algorithm for a planar distributed network
inferredcites →https://doi.org/10.1007/s00446-005-0127-6openalex-snapshot
Distributed MST for constant diameter graphs
inferredcites →https://doi.org/10.1007/s00446-005-0147-2openalex-snapshot
Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models
inferredcites →https://doi.org/10.1007/s00446-016-0270-2openalex-snapshot
Algebraic methods in the congested clique
inferredcites →https://doi.org/10.1007/s00453-016-0138-7openalex-snapshot
Superlinear Lower Bounds for Multipass Graph Processing
inferredcites →https://doi.org/10.1016/0743-7315(90)90074-yopenalex-snapshot
Time-optimal leader election in general networks
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.013openalex-snapshot
On graph problems in a semi-streaming model
inferredcites →https://doi.org/10.1109/focs.2016.22openalex-snapshot
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths
inferredcites →https://doi.org/10.1109/focs.2018.00071openalex-snapshot
A Faster Distributed Single-Source Shortest Paths Algorithm
inferredcites →https://doi.org/10.1109/ipdps.2019.00014openalex-snapshot
Distributed Weighted All Pairs Shortest Paths Through Pipelining
inferredcites →https://doi.org/10.1109/sffcs.1999.814597openalex-snapshot
A near-tight lower bound on the time complexity of distributed MST construction
inferredcites →https://doi.org/10.1137/0214062openalex-snapshot
Distributed Multi-Destination Routing: The Constraints of Local Information
inferredcites →https://doi.org/10.1137/0220006openalex-snapshot
High-Probability Parallel Transitive-Closure Algorithms
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1137/1.9781611974782.41openalex-snapshot
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
inferredcites →https://doi.org/10.1137/11085178xopenalex-snapshot
Distributed Verification and Hardness of Distributed Approximation
inferredcites →https://doi.org/10.1137/s0097539794261118openalex-snapshot
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1137/s0097539796303421openalex-snapshot
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
inferredcites →https://doi.org/10.1145/1007352.1007407openalex-snapshot
Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
inferredcites →https://doi.org/10.1145/1921659.1921666openalex-snapshot
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
inferredcites →https://doi.org/10.1145/2332432.2332504openalex-snapshot
Optimal distributed all pairs shortest paths and applications
inferredcites →https://doi.org/10.1145/2488608.2488656openalex-snapshot
Fast routing table construction using small messages
inferredcites →https://doi.org/10.1145/2591796.2591850openalex-snapshot
Distributed approximation algorithms for weighted shortest paths
inferredcites →https://doi.org/10.1145/2767386.2767414openalex-snapshot
Algebraic Methods in the Congested Clique
inferredcites →https://doi.org/10.1145/3188745.3188948openalex-snapshot
Improved distributed algorithms for exact shortest paths
inferredcites →https://doi.org/10.1145/3212734.3212773openalex-snapshot
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds
inferredcites →https://doi.org/10.1145/331605.331610openalex-snapshot
Polylog-time and near-linear work approximation scheme for undirected shortest paths
inferredcites →https://doi.org/10.21236/ada117808openalex-snapshot
Distributed Minimum Hop Algorithms
inferredcites →https://doi.org/10.4230/lipics.opodis.2015.6openalex-snapshot
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique
inferredcites →https://doi.org/10.48550/arxiv.1305.5520openalex-snapshot
Distributed Minimum Cut Approximation
inferredcites →https://doi.org/10.48550/arxiv.1403.5171openalex-snapshot
Distributed Approximation Algorithms for Weighted Shortest Paths
inferredcites →https://doi.org/10.5555/1070432.1070537openalex-snapshot
Graph distances in the streaming model: the value of space
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00453-024-01246-zopenalex-snapshot
Parameterized Complexity of Streaming Diameter and Connectivity Problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.11.006openalex-snapshot
Latency, capacity, and distributed minimum spanning trees
inferred← citeshttps://doi.org/10.1109/bigcomp68355.2026.00034openalex-snapshot
Distributed Processing of kNN Queries over Moving Objects on Dynamic Road Networks
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00099openalex-snapshot
Minor Sparsifiers and the Distributed Laplacian Paradigm
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00113openalex-snapshot
Nearly Optimal Communication and Query Complexity of Bipartite Matching
inferred← citeshttps://doi.org/10.1109/iscas56072.2025.11043988openalex-snapshot
A Digital Neuromorphic Architecture for Unsupervised Shortest Path Computation on Real-World Graphs
inferred← citeshttps://doi.org/10.1109/jiot.2024.3367361openalex-snapshot
Carbon-Aware Peer-to-Peer Joint Energy and Reserve Trading Market for Prosumers in Distribution Networks
inferred← citeshttps://doi.org/10.1137/1.9781611975482.51openalex-snapshot
Distributed Triangle Detection via Expander Decomposition
inferred← citeshttps://doi.org/10.1137/19m1286955openalex-snapshot
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
inferred← citeshttps://doi.org/10.1145/3212734.3212776openalex-snapshot
Minor Excluded Network Families Admit Fast Distributed Algorithms
inferred← citeshttps://doi.org/10.1145/3382734.3405701openalex-snapshot
Distributed Construction of Light Networks
inferred← citeshttps://doi.org/10.1145/3564246.3585201openalex-snapshot
Finding a Small Vertex Cut on Distributed Networks
inferred← citeshttps://doi.org/10.1145/3694966openalex-snapshot
A Survey of Distributed Graph Algorithms on Massive Graphs
inferred← citeshttps://doi.org/10.1145/3732772.3733506openalex-snapshot
Message Optimality and Message-Time Trade-offs for APSP and Beyond
inferred← citeshttps://doi.org/10.1145/3732772.3733513openalex-snapshot
Optimal Distributed Replacement Paths
inferred← citeshttps://doi.org/10.3390/electronics11091498openalex-snapshot
Modeling Distributed MQTT Systems Using Multicommodity Flow Analysis
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2021.21openalex-snapshot
Distance Computations in the Hybrid Network Model via Oracle Simulations
inferred← citeshttps://doi.org/10.48550/arxiv.1804.05441openalex-snapshot
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds
inferred← citeshttps://doi.org/10.48550/arxiv.1805.04071openalex-snapshot
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1805.08124openalex-snapshot
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths
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.