Untangled monotonic chains and adaptive range search
From MaRDI portal
Publication:553358
Recommendations
Cites work
- scientific article; zbMATH DE number 3882232 (Why is no real title available?)
- scientific article; zbMATH DE number 1445373 (Why is no real title available?)
- A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences
- An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains
- Approximating minimum cocolorings.
- Decomposing a set of points into chains, with applications to permutation and circle graphs
- Fractional cascading. I: A data structuring technique
- Implicit data structures for fast search and update
- Multidimensional binary search trees used for associative searching
- On minimum \(k\)-modal partitions of permutations
- Orthogonal range searching in linear and almost-linear space
- Partitioning a sequence into few monotone subsequences
- The priority R-tree: a practically efficient and worst-case optimal R-tree
- Untangled monotonic chains and adaptive range search
Cited in
(4)
This page was built for publication: Untangled monotonic chains and adaptive range search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553358)