A unifying look at data structures
From MaRDI portal
Cited in
(78)- A complexity calculus for recursive tree algorithms
- On random cartesian trees
- Shape rectangularization problems in intensity-modulated radiation therapy
- An application of m-ary trees to the design of data structures for geometric searching problems
- Deletions in random binary search trees: a story of errors
- Succinct indices for path minimum, with applications
- Linear-time construction of treaps and Cartesian trees
- Encoding range minima and range top-2 queries
- Computing maximal palindromes in non-standard matching models
- Computing on a free tree via complexity-preserving mappings
- Dualities in tree representations
- Faster algorithms for largest empty rectangles and boxes
- Building Cartesian trees from free trees with \(k\) leaves
- Randomized search trees
- On the range maximum-sum segment query problem
- Dynamic orthogonal range queries in OLAP.
- The summed start-up costs in a unit commitment problem
- Two dimensional range minimum queries and Fibonacci lattices
- Algorithms for sequential generation of combinatorial structures
- Space-efficient data structure for next/previous larger/smaller value queries
- Lyndon words, permutations and trees.
- Average number of messages for distributed leader finding in rings of processors
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
- Computing maximal palindromes in non-standard matching models
- The weak-heap data structure: variants and applications
- Optimal algorithms for running max and min filters on random inputs
- Fast algorithms for single and multiple pattern Cartesian tree matching
- On space efficient two dimensional range minimum data structures
- Parallel range minima on coarse grained multicomputers
- Approximate Cartesian tree pattern matching
- Range minimum query indexes in higher dimensions
- Reductions in binary search trees
- Optimally sorting evolving data
- A new framework for addressing temporal range queries and some preliminary results
- Parallel construction of succinct trees
- Finding patterns and periods in Cartesian tree matching
- Efficiently testing Simon's congruence
- The ceBWT index: an index for circular Cartesian tree matching on multiple texts
- Minimum cut in \(O(m \log^2 n)\) time
- Secure authenticated comparisons
- Encodings for range minimum queries over bounded alphabets
- Minimum cut in O(m^2 n time
- Permutation inversions and multidimensional cumulative distribution functions
- On the complexity of indeterminate strings matching
- New algorithms for the LCA problem and the binary tree reconstruction problem
- Verified analysis of random binary tree structures
- Orthogonal range searching for text indexing
- Quantum data structure for range minimum query
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Fully functional static and dynamic succinct trees
- Exact average message complexity values for distributed election on bidirectional rings of processors
- Interweaving real-time jobs with energy harvesting to maximize throughput
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
- Space-efficient data structure for next/previous larger/smaller value queries
- Finding range minima in the middle: approximations and applications
- Arboral satisfaction: recognition and LP approximation
- Faster algorithms for largest empty rectangles and boxes
- Faster Fréchet distance approximation through truncated smoothing
- Succinct data structures for Baxter permutation and related families
- Succinct permutation graphs
- Linear-time heuristics for minimum weight rectangulation
- The ``runs theorem
- Approximate Cartesian tree pattern matching
- On succinct representations of binary trees
- Approximate Cartesian tree matching with one difference
- Stacks, queues, and deques with order-statistic operations
- scientific article; zbMATH DE number 3909754 (Why is no real title available?)
- An efficient parallel algorithm for building the separating tree
- Cartesian and Lyndon trees
- Fast Cartesian tree matching
- Inducing the Lyndon array
- Improved range minimum queries
- Smooth heaps and a dual view of self-adjusting data structures
- Average number of messages for distributed leader-fitting in rings of processors
- Automatic average-case analysis of algorithms
- Approximate Cartesian tree matching: an approach using swaps
- Optimal encodings for range top-\(k\), selection, and min-max
- Efficient maximum matching algorithms for trapezoid graphs
This page was built for publication: A unifying look at data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3873557)
