Space-efficient and fast algorithms for multidimensional dominance reporting and counting
From MaRDI portal
Recommendations
Cited in
(41)- Semi-local longest common subsequences in subquadratic time
- The range 1 query (R1Q) problem
- Path queries on functions
- Color-spanning localized query
- Data structures for categorical path counting queries
- The fine-grained complexity of multi-dimensional ordering properties
- The heaviest induced ancestors problem: better data structures and applications
- Linear-space data structures for range mode query in arrays
- Low space data structures for geometric range mode query
- Biased range trees
- Wavelet trees for all
- Algorithms for three-dimensional dominance searching in linear space.
- Counting subgraphs in relational event graphs
- Succinct and Implicit Data Structures for Computational Geometry
- Monte-Carlo valuation of American options: facts and new algorithms to improve existing methods
- Sparse dominance queries for many points in optimal time and space
- Efficient range searching for categorical and plain data
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
- Connectivity oracles for graphs subject to vertex failures
- On Dominance Reporting in 3D
- Space efficient data structures for dynamic orthogonal range counting
- Entropy-bounded representation of point grids
- Monge properties of sequence alignment
- An improved algorithm for static 3D dominance reporting in the pointer machine
- Near-optimal distance emulator for planar graphs
- Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
- The heaviest induced ancestors problem revisited
- Substring range reporting
- Partial enclosure range searching
- Towards optimal range medians
- scientific article; zbMATH DE number 7651193 (Why is no real title available?)
- Four-dimensional dominance range reporting in linear space
- scientific article; zbMATH DE number 7765381 (Why is no real title available?)
- Absent Subsequences in Words
- Adaptive data structures for 2D dominance colored range counting
- Hierarchical categories in colored searching
- Path and ancestor queries over trees with multidimensional weight vectors
- The edit distance to k-subsequence universality
- Finding maximum edge bicliques in tree convex graphs
- Succinct data structures for segments
- Counting permutation patterns with multidimensional trees
This page was built for publication: Space-efficient and fast algorithms for multidimensional dominance reporting and counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712144)