On the public citation graph

Subquadratic Algorithm for Dynamic Shortest Distances

0 signed · 58 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.1006/jagm.1995.0807openalex-snapshot
On Dynamic Algorithms for Algebraic Problems
inferredcites →https://doi.org/10.1006/jcom.1997.0438openalex-snapshot
Rectangular Matrix Multiplication Revisited
inferredcites →https://doi.org/10.1006/jcom.1998.0476openalex-snapshot
Fast Rectangular Matrix Multiplication and Applications
inferredcites →https://doi.org/10.1007/3-540-09519-5openalex-snapshot
Symbolic and Algebraic Computation
inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-45465-9_54openalex-snapshot
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
inferredcites →https://doi.org/10.1007/3-540-49116-3_34openalex-snapshot
Lower Bounds for Dynamic Algebraic Problems
inferredcites →https://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
inferredcites →https://doi.org/10.1016/j.jcss.2005.05.005openalex-snapshot
Fully dynamic all pairs shortest paths with real edge weights
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0331751-8openalex-snapshot
Triangular factorization and inversion by fast matrix multiplication
inferredcites →https://doi.org/10.1109/focs.2004.25openalex-snapshot
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)
inferredcites →https://doi.org/10.1109/sfcs.1995.492668openalex-snapshot
Fully dynamic biconnectivity and transitive closure
inferredcites →https://doi.org/10.1109/sfcs.1998.743464openalex-snapshot
All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms
inferredcites →https://doi.org/10.1109/sfcs.2001.959900openalex-snapshot
Fully dynamic all pairs shortest paths with real edge weights
inferredcites →https://doi.org/10.1109/sffcs.1999.814580openalex-snapshot
Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs
inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1145/322063.322068openalex-snapshot
All Algebraic Functions Can Be Computed Fast
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/780542.780567openalex-snapshot
A new approach to dynamic all pairs shortest paths
inferredcites →https://doi.org/10.1145/97444.97686openalex-snapshot
High-probability parallel transitive closure algorithms
inferredcites →https://doi.org/10.1515/crll.1973.264.184openalex-snapshot
Vermeidung von Divisionen.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11561071_68openalex-snapshot
Shortest Paths in Matrix Multiplication Time
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_425openalex-snapshot
Trade-Offs for Dynamic Graph Problems
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_425openalex-snapshot
Trade-Offs for Dynamic Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_5openalex-snapshot
Algebraic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_14openalex-snapshot
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
inferred← citeshttps://doi.org/10.1007/s00453-007-9051-4openalex-snapshot
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure
inferred← citeshttps://doi.org/10.1109/focs.2018.00025openalex-snapshot
Near-Optimal Approximate Decremental All Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1109/focs.2019.00034openalex-snapshot
Sensitive Distance and Reachability Oracles for Large Batch Updates
inferred← citeshttps://doi.org/10.1109/focs.2019.00035openalex-snapshot
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time
inferred← citeshttps://doi.org/10.1109/focs.2019.00036openalex-snapshot
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00109openalex-snapshot
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00100openalex-snapshot
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00099openalex-snapshot
Fast Deterministic Fully Dynamic Distance Approximation
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00036openalex-snapshot
Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00106openalex-snapshot
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00142openalex-snapshot
Deterministic Fully Dynamic SSSP and More
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00121openalex-snapshot
Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time
inferred← citeshttps://doi.org/10.1137/1.9781611974782.28openalex-snapshot
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
inferred← citeshttps://doi.org/10.1137/1.9781611976465.110openalex-snapshot
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
inferred← citeshttps://doi.org/10.1137/1.9781611976465.147openalex-snapshot
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition
inferred← citeshttps://doi.org/10.1137/1.9781611976465.148openalex-snapshot
Approximate Distance Oracles Subject to Multiple Vertex Failures
inferred← citeshttps://doi.org/10.1137/1.9781611976496.1openalex-snapshot
Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/2488608.2488701openalex-snapshot
Maintaining shortest paths under deletions in weighted directed graphs
inferred← citeshttps://doi.org/10.1145/2746539.2746609openalex-snapshot
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
inferred← citeshttps://doi.org/10.1145/2897518.2897638openalex-snapshot
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
inferred← citeshttps://doi.org/10.1145/3313276.3316320openalex-snapshot
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems
inferred← citeshttps://doi.org/10.1145/3519935.3520058openalex-snapshot
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary
inferred← citeshttps://doi.org/10.1145/3555806openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
inferred← citeshttps://doi.org/10.1145/3564246.3585213openalex-snapshot
Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch
inferred← citeshttps://doi.org/10.1201/b16132-52openalex-snapshot
Triangulations
inferred← citeshttps://doi.org/10.1201/b16132-72openalex-snapshot
Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.76openalex-snapshot
Constructing a Distance Sensitivity Oracle in $O(n^{2.5794}M)$ Time
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06413openalex-snapshot
Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections
inferred← citeshttps://doi.org/10.48550/arxiv.2011.13702openalex-snapshot
Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2102.11169openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.7916/d8qf8t2wopenalex-snapshot
Dynamic Algorithms for Shortest Paths and Matching
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.