On the public citation graph

Speed-Up in Dynamic Programming

0 signed · 65 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/j.1538-7305.1959.tb01583.xopenalex-snapshot
Variable-Length Binary Encodings
inferredcites →https://doi.org/10.1007/bf00264289openalex-snapshot
Optimum binary search trees
inferredcites →https://doi.org/10.1137/0211028openalex-snapshot
Computation of Matrix Chain Products. Part I
inferredcites →https://doi.org/10.1137/0213017openalex-snapshot
Computation of Matrix Chain Products. Part II
inferredcites →https://doi.org/10.1145/800070.802202openalex-snapshot
Finding extremal polygons
inferredcites →https://doi.org/10.1145/800141.804691openalex-snapshot
Efficient dynamic programming using quadrangle inequalities

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.6445openalex-snapshot
A fast sequential algorithm for the matrix chain ordering problem
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_30openalex-snapshot
Parallel algorithm for the matrix chain product and the optimal triangulation problems (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_34openalex-snapshot
Algorithms for finding optimal disjoint paths around a rectangle
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_28openalex-snapshot
Advanced Techniques for Dynamic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_5openalex-snapshot
Efficient Algorithms with Applications to Molecular Biology
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_29openalex-snapshot
Efficient Second-Order Shape-Constrained Function Fitting
inferred← citeshttps://doi.org/10.1007/978-3-319-32467-8_57openalex-snapshot
Deriving CGM Based-Parallel Algorithms for the Optimal Binary Search-Tree Problem
inferred← citeshttps://doi.org/10.1007/bf01415751openalex-snapshot
The cone of Monge matrices: Extremal rays and applications
inferred← citeshttps://doi.org/10.1007/bf01840380openalex-snapshot
On heuristics for minimum length rectilinear partitions
inferred← citeshttps://doi.org/10.1007/bfb0026809openalex-snapshot
A generic program for sequential decision processes
inferred← citeshttps://doi.org/10.1007/s10878-025-01290-7openalex-snapshot
On the parenthesisations of matrix chains: All are useful, few are essential
inferred← citeshttps://doi.org/10.1007/s41019-019-0093-9openalex-snapshot
An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90084-bopenalex-snapshot
An optimal algorithm with unknown time complexity for convex matrix searching
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90215-jopenalex-snapshot
A linear-time algorithm for concave one-dimensional dynamic programming
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90104-vopenalex-snapshot
Monotonicity and efficient computation of optimal dichotomous search
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00103-xopenalex-snapshot
Perspectives of Monge properties in optimization
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90003-5openalex-snapshot
On an efficient dynamic programming technique of F. F. Yao
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90101-1openalex-snapshot
Speeding up dynamic programming with applications to molecular biology
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90135-3openalex-snapshot
Dynamic programming with convexity, concavity and sparsity
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90077-9openalex-snapshot
Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
inferred← citeshttps://doi.org/10.1016/0898-1221(94)90123-6openalex-snapshot
Dynamic programming and graph optimization problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.07.031openalex-snapshot
Operations research applications of dichotomous search
inferred← citeshttps://doi.org/10.1016/j.ic.2007.11.001openalex-snapshot
Trees with exponentially growing costs
inferred← citeshttps://doi.org/10.1016/j.ipl.2026.106640openalex-snapshot
Optimal average-case binary search with outcome-dependent costs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.040openalex-snapshot
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00320-9openalex-snapshot
Optimal binary search trees
inferred← citeshttps://doi.org/10.1109/12.475128openalex-snapshot
Efficient partitioning of sequences
inferred← citeshttps://doi.org/10.1109/iccse.2013.6553999openalex-snapshot
Efficient computation of matrix chain
inferred← citeshttps://doi.org/10.1109/ipps.1994.288295openalex-snapshot
Efficient matrix chain ordering in polylog time
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195687openalex-snapshot
Optimal Binary Variable-Length Codes with a Bounded Number of 1's Per Codeword: Design, Analysis, and Applications
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21965openalex-snapshot
Speeding up dynamic programming
inferred← citeshttps://doi.org/10.1109/soac.1990.82144openalex-snapshot
Parallelization of the dynamic programming algorithm for the matrix chain product on a hypercube
inferred← citeshttps://doi.org/10.1137/0403009openalex-snapshot
An Almost Linear Time Algorithm for Generalized Matrix Searching
inferred← citeshttps://doi.org/10.1137/1.9781611973082.129openalex-snapshot
Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition
inferred← citeshttps://doi.org/10.1137/1.9781611973730.121openalex-snapshot
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties
inferred← citeshttps://doi.org/10.1137/18m1195401openalex-snapshot
Revisiting “Computation of Matrix Chain Products''
inferred← citeshttps://doi.org/10.1137/s0097539794267243openalex-snapshot
Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours
inferred← citeshttps://doi.org/10.1137/s0097539794270698openalex-snapshot
Efficient Matrix Chain Ordering in Polylog Time
inferred← citeshttps://doi.org/10.1137/s0097539797322255openalex-snapshot
An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications
inferred← citeshttps://doi.org/10.1145/162754.168684openalex-snapshot
Load balancing techniques for dynamic programming algorithms on hypercube multiprocessors
inferred← citeshttps://doi.org/10.1145/1644015.1644032openalex-snapshot
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
inferred← citeshttps://doi.org/10.1145/1963190.2063517openalex-snapshot
Approximation algorithms for speeding up dynamic programming and denoising aCGH data
inferred← citeshttps://doi.org/10.1145/3039241openalex-snapshot
Property Testing on Product Distributions
inferred← citeshttps://doi.org/10.1145/3626183.3659958openalex-snapshot
Parallel and (Nearly) Work-Efficient Dynamic Programming
inferred← citeshttps://doi.org/10.14288/1.0051343openalex-snapshot
Some new results on constructing optimal alphabetic binary trees
inferred← citeshttps://doi.org/10.1504/ijhpcn.2014.062729openalex-snapshot
Parallel dynamic programming for solving the optimal search binary tree problem on CGM
inferred← citeshttps://doi.org/10.1515/dema-1996-0222openalex-snapshot
A CHARACTERIZATION OF THE MONGE PROPERTY AND ITS CONNECTION TO STATISTICS
inferred← citeshttps://doi.org/10.23952/asvao.4.2022.3.04openalex-snapshot
Universal bounds for fixed point iterations via optimal transport metrics
inferred← citeshttps://doi.org/10.31390/gradschool_theses.3217openalex-snapshot
Optimal binary trees with height restrictions on left and right branches
inferred← citeshttps://doi.org/10.4018/ijghpc.2014040105openalex-snapshot
An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem
inferred← citeshttps://doi.org/10.4018/ijghpc.2016100104openalex-snapshot
High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem
inferred← citeshttps://doi.org/10.48550/arxiv.0804.0940openalex-snapshot
Optimum Binary Search Trees on the Hierarchical Memory Model
inferred← citeshttps://doi.org/10.48550/arxiv.1407.0375openalex-snapshot
Mathematical and Algorithmic Analysis of Network and Biological Data
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0602080openalex-snapshot
Pants Decomposition of the Punctured Plane
inferred← citeshttps://doi.org/10.5555/1109557.1109562openalex-snapshot
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity
inferred← citeshttps://doi.org/10.5555/2722129.2722250openalex-snapshot
Property testing on product distributions: optimal testers for bounded derivative properties
inferred← citeshttps://doi.org/10.5555/313559.313685openalex-snapshot
Upper and lower bounds on constructing alphabetic binary trees
inferred← citeshttps://doi.org/10.5555/314161.314260openalex-snapshot
Shortest path in complete bipartite digraph problem and its applications
inferred← citeshttps://doi.org/10.5555/314464.314480openalex-snapshot
Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours
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.