scientific article; zbMATH DE number 432798

zbMATH Open0785.90094MaRDI QIDQ3138931FDOQ3138931

Authors: David Eppstein, Giuseppe F. Italiano, Zvi Galil, R. Giancarlo 

Publication date: 15 December 1993

Title of this publication is not available (Why is that?)

Recommendations

• Sparse dynamic programming I
• Speeding up dynamic programming with applications to molecular biology
• Sparse dynamic programming II
• Publication:4206397
• Sparse Dynamic Programming for Longest Common Subsequence from Fragments

zbMATH Keywords

sparsity

Mathematics Subject Classification ID

Dynamic programming (90C39)

Cited In (16)

• Text sparsification via local maxima.
• An optimal algorithm with unknown time complexity for convex matrix searching
• An almost quadratic time algorithm for sparse spliced alignment
• Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
• Finding the k smallest spanning trees
• Consecutive interval query and dynamic programming on intervals
• Fast and cache-oblivious dynamic programming with local dependencies
• Dynamic programming with convexity, concavity and sparsity
• Finding least-weight subsequences with fewer processors
• Sparse dynamic programming on DAGs with small width
• Finding the \(k\) smallest spanning trees
• A discipline of dynamic programming over sequence data
• Title not available (Why is that?)
• Cache efficient simple dynamic programming
• A Monge property for the \(d\)-dimensional transportation problem
• Homomorphic hashing for sparse coefficient extraction

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138931)