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