On the public citation graph
Distributed algorithms for updating shortest paths
0 signed · 26 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.1016/0196-6774(91)90036-xopenalex-snapshot
Incremental algorithms for minimal length paths
inferredcites →https://doi.org/10.1109/fscs.1990.89570openalex-snapshot
Communication-optimal maintenance of replicated information
inferredcites →https://doi.org/10.1109/sfcs.1987.7openalex-snapshot
Applying static network protocols to dynamic networks
inferredcites →https://doi.org/10.1109/sfcs.1988.21938openalex-snapshot
Dynamic networks are as fast as static networks
inferredcites →https://doi.org/10.1109/sfcs.1988.21940openalex-snapshot
On the effects of feedback in dynamic network protocols
inferredcites →https://doi.org/10.1109/tcom.1977.1093711openalex-snapshot
A Minimum Delay Routing Algorithm Using Distributed Computation
inferredcites →https://doi.org/10.1109/tcom.1982.1095632openalex-snapshot
A Responsive Distributed Routing Algorithm for Computer Networks
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/73007.73054openalex-snapshot
Randomized distributed shortest paths algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10719839_25openalex-snapshot
A Fully Dynamic Algorithm for Distributed Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-319-77510-4_4openalex-snapshot
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_6openalex-snapshot
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-21887-3_44openalex-snapshot
A Speed-Up Technique for Distributed Shortest Paths Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_53openalex-snapshot
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks
inferred← citeshttps://doi.org/10.1007/s00224-015-9608-6openalex-snapshot
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios
inferred← citeshttps://doi.org/10.1007/s00453-012-9623-9openalex-snapshot
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.11.008openalex-snapshot
Partially dynamic efficient algorithms for distributed shortest paths
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.001openalex-snapshot
A loop-free shortest-path routing algorithm for dynamic networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00619-9openalex-snapshot
A fully dynamic algorithm for distributed shortest paths
inferred← citeshttps://doi.org/10.1109/iccta.2007.101openalex-snapshot
Partially Dynamic Concurrent Update of Distributed Shortest Paths
inferred← citeshttps://doi.org/10.1109/tc.2012.36openalex-snapshot
Least-Latency Routing over Time-Dependent Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1145/1281100.1281128openalex-snapshot
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
inferred← citeshttps://doi.org/10.1145/1391289.1391292openalex-snapshot
Optimal maintenance of a spanning tree
inferred← citeshttps://doi.org/10.1145/3146550openalex-snapshot
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks
inferred← citeshttps://doi.org/10.1145/3447384openalex-snapshot
Input-Dynamic Distributed Algorithms for Communication Networks
inferred← citeshttps://doi.org/10.4304/jcp.2.9.16-26openalex-snapshot
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation
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.