A Functional Approach to Data Structures and Its Use in Multidimensional Searching
From MaRDI portal
Publication:4729345
Recommendations
- Multidimensional digital searching—alternative data structures
- Directed and optimizing search methods in complex data structures.
- scientific article; zbMATH DE number 4078826
- Searching rigid data structures
- Foundations of multidimensional and metric data structures.
- Data structures for range minimum queries in multidimensional arrays
- scientific article; zbMATH DE number 54254
- Compact and succinct data structures for multidimensional orthogonal range searching
Cited in
(only showing first 100 items - show all)- On the minimum total length of interval systems expressing all intervals, and range-restricted queries
- Orthogonal range searching in linear and almost-linear space
- The Level-Ancestor problem on pure pointer machines
- Approximate colored range and point enclosure queries
- Fractional cascading. II: Applications
- On estimating the complexity of logarithmic decomposition
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Discriminant analysis and density estimation on the finite d-dimensional grid
- Orthogonal queries in segments
- Dynamic orthogonal range queries in OLAP.
- Finding pairwise intersections inside a query range
- A new framework for addressing temporal range queries and some preliminary results
- Extending range queries and nearest neighbors
- A new bound for map labeling with uniform circle pairs
- An algorithm for handling many relational calculus queries efficiently.
- Hamiltonian orthogeodesic alternating paths
- The fine-grained complexity of multi-dimensional ordering properties
- Fast and longest rollercoasters
- A data structure for substring-substring LCS length queries
- Longest common rollercoasters
- Shortest paths among transient obstacles
- A faster reduction of the dynamic time warping distance to the longest increasing subsequence length
- Biased range trees
- Stronger Lempel-Ziv based compressed text indexing
- Near-linear approximation algorithms for geometric hitting sets
- Wavelet trees for all
- Space efficient dynamic orthogonal range reporting
- Rank and select revisited and extended
- On the difficulty of range searching.
- Foundations of multidimensional and metric data structures.
- Clustering, classification and image segmentation on the grid
- Chaining algorithms for multiple genome comparison
- Document listing on repetitive collections with guaranteed performance
- scientific article; zbMATH DE number 1670652 (Why is no real title available?)
- Succinct and Implicit Data Structures for Computational Geometry
- Orthogonal range searching for text indexing
- Array range queries
- Features of solving the range searching problems for d-dimensional case
- Robust nonparametric simplification of polygonal chains
- Efficient algorithms for the temporal precedence problem
- Efficient range searching for categorical and plain data
- Fast construction of wavelet trees
- Aggregate-\textsc{Max} top-\(k\) nearest neighbor searching in the \(L_{1}\) plane
- Time-optimal top-k document retrieval
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
- Dynamic range majority data structures
- Efficient top-k queries for orthogonal ranges
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Space-efficient frameworks for top-k string retrieval
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- Resolving SINR Queries in a Dynamic Setting
- Submatrix maximum queries in Monge matrices are equivalent to predecessor search
- Finding pairwise intersections inside a query range
- External memory orthogonal range reporting with fast updates
- On Dominance Reporting in 3D
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
- Compressed property suffix trees
- Space efficient data structures for dynamic orthogonal range counting
- Space-efficient data-analysis queries on grids
- New algorithms on wavelet trees and applications to information retrieval
- Simplex Range Searching and Its Variants: A Review
- New upper bounds for generalized intersection searching problems
- OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS
- scientific article; zbMATH DE number 194610 (Why is no real title available?)
- An application of m-ary trees to the design of data structures for geometric searching problems
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
- On the functional complexity of a two-dimensional interval search problem
- Resolving SINR queries in a dynamic setting
- On the difficulty of range searching
- Fast and longest rollercoasters
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3
- Space Efficient Multi-dimensional Range Reporting
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Top-\(k\) document retrieval in optimal time and linear space
- scientific article; zbMATH DE number 7651193 (Why is no real title available?)
- Generalizing geometric graphs
- A linear-space data structure for range-LCP queries in poly-logarithmic time
- scientific article; zbMATH DE number 7765381 (Why is no real title available?)
- Searching rigid data structures
- Elastic-degenerate string matching with 1 error
- Graph problems arising from parameter identification of discrete dynamical systems
- Space-efficient conversions from SLPs
- Hierarchical categories in colored searching
- Elastic-degenerate string matching with 1 error or mismatch
- Filling gaps in the boundary of a polyhedron
- Sequential and parallel algorithms for finding a maximum convex polygon
- Quantum data structure for range minimum query
- Searching 2D-strings for matching frames
- Substring complexity in sublinear space
- Conjunctive queries with comparisons
- Algorithms and hardness for multidimensional range updates and queries
- Height-bounded Lempel-Ziv encodings
- String 2-covers with no length restrictions
- Counting on general run-length grammars
- Succinct data structures for segments
- Sublinear data structures for nearest neighbor in ultra high dimensions
- Counting permutation patterns with multidimensional trees
- Selection from read-only memory with limited workspace
- An algorithm for string matching with a sequence of don't cares
- The design of dynamic data structures
This page was built for publication: A Functional Approach to Data Structures and Its Use in Multidimensional Searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729345)
