Pages that link to "Item:Q3873557"
From MaRDI portal
The following pages link to A unifying look at data structures (Q3873557):
Displaying 50 items.
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- Exact average message complexity values for distributed election on bidirectional rings of processors (Q910221) (← links)
- Deletions in random binary search trees: a story of errors (Q972839) (← links)
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) (← links)
- Computing on a free tree via complexity-preserving mappings (Q1098314) (← links)
- Average number of messages for distributed leader-fitting in rings of processors (Q1117694) (← links)
- Permutation inversions and multidimensional cumulative distribution functions (Q1163866) (← links)
- Automatic average-case analysis of algorithms (Q1174718) (← links)
- Stacks, queues, and deques with order-statistic operations (Q1203596) (← links)
- New algorithms for the LCA problem and the binary tree reconstruction problem (Q1328757) (← links)
- Linear-time construction of treaps and Cartesian trees (Q1339378) (← links)
- Dynamic orthogonal range queries in OLAP. (Q1401285) (← links)
- Lyndon words, permutations and trees. (Q1426043) (← links)
- A new framework for addressing temporal range queries and some preliminary results (Q1770382) (← links)
- Algorithms for sequential generation of combinatorial structures (Q1822996) (← links)
- Randomized search trees (Q1923861) (← links)
- The weak-heap data structure: variants and applications (Q1932363) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968) (← links)
- Cartesian and Lyndon trees (Q2285120) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- Reductions in binary search trees (Q2369002) (← links)
- On the range maximum-sum segment query problem (Q2384388) (← links)
- Improved range minimum queries (Q2397152) (← links)
- The summed start-up costs in a unit commitment problem (Q2397765) (← links)
- Arboral satisfaction: recognition and LP approximation (Q2398493) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Building Cartesian trees from free trees with \(k\) leaves (Q2450934) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Range Minimum Query Indexes in Higher Dimensions (Q2942253) (← links)
- Encoding range minima and range top-2 queries (Q2955625) (← links)
- Secure Authenticated Comparisons (Q3011317) (← links)
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING (Q3022028) (← links)
- Optimal Algorithms for Running Max and Min Filters on Random Inputs (Q3196410) (← links)
- Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max (Q3448818) (← links)
- (Q3686051) (← links)
- A complexity calculus for recursive tree algorithms (Q3806812) (← links)
- On random cartesian trees (Q4286297) (← links)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)
- (Q5002760) (← links)
- Efficient maximum matching algorithms for trapezoid graphs (Q5006595) (← links)
