An Almost Linear Time Algorithm for Generalized Matrix Searching
From MaRDI portal
Recommendations
- Geometric applications of a matrix-searching algorithm
- Superlinear bounds for matrix searching problems
- Speeding up dynamic programming with applications to molecular biology
- Applications of generalized matrix searching to geometric algorithms
- More Efficient Parallel Totally Monotone Matrix Searching
Cited in
(30)- Sparse LCS common substring alignment
- Geometric applications of a matrix-searching algorithm
- Finding a minimum-weight k-link path in graphs with the concave Monge property and applications
- Consecutive interval query and dynamic programming on intervals
- Guarding in a simple polygon
- Approximate regular expression pattern matching with concave gap penalties
- Perspectives of Monge properties in optimization
- An almost linear time algorithm for field splitting in radiation therapy
- Finding least-weight subsequences with fewer processors
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
- An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays
- Submatrix maximum queries in Monge matrices are equivalent to predecessor search
- Superlinear bounds for matrix searching problems
- An efficient parallel algorithm for the row minima of a totally monotone matrix
- More Efficient Parallel Totally Monotone Matrix Searching
- Matrix Searching with the Shortest-Path Metric
- scientific article; zbMATH DE number 1880331 (Why is no real title available?)
- Near-optimal distance emulator for planar graphs
- A divide-and-conquer algorithm for two-point L₁ shortest path queries in polygonal domains
- Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
- Faster min-plus product for monotone instances
- Faster algorithms for largest empty rectangles and boxes
- Finding the largest separating rectangle among two point sets
- Finding the largest area axis-parallel rectangle in a polygon
- Tensor ranks and the fine-grained complexity of dynamic programming
- Faster algorithms for largest empty rectangles and boxes
- A linear-time algorithm for concave one-dimensional dynamic programming
- Applications of generalized matrix searching to geometric algorithms
- An optimal algorithm with unknown time complexity for convex matrix searching
- Minimum \(L_k\) path partitioning-an illustration of the Monge property
This page was built for publication: An Almost Linear Time Algorithm for Generalized Matrix Searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3031930)
