Pages that link to "Item:Q4799528"
From MaRDI portal
The following pages link to On the average performance of orthogonal range search in multidimensional data structures (Q4799528):
Displaying 18 items.
- On the cost of fixed partial match queries in \(K\)-d trees (Q308949) (← links)
- A limit process for partial match queries in random quadtrees and 2-d trees (Q389077) (← links)
- Compact and succinct data structures for multidimensional orthogonal range searching (Q776842) (← links)
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees (Q906406) (← links)
- Weighted height of random trees (Q934911) (← links)
- Some properties of optimal cartesian product files for orthogonal range queries (Q1369170) (← links)
- A limit field for orthogonal range searches in two-dimensional random point search trees (Q2274287) (← links)
- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching (Q2287830) (← links)
- Time complexity of multidimensional range queries in multiple storage units. (Q2772355) (← links)
- Selection by rank in K-dimensional binary search trees (Q2877767) (← links)
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (Q3183444) (← links)
- Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back (Q4580101) (← links)
- Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions (Q5232525) (← links)
- Cache-oblivious data structures for orthogonal range searching (Q5361629) (← links)
- Orthogonal range searching on the RAM, revisited (Q5404401) (← links)
- Partial match queries in random quadtrees (Q5743457) (← links)
- Analysis of range search for random \(k-d\) trees (Q5925823) (← links)
- On the expected cost of partial match queries in random quad-\(K\)-d trees (Q6130360) (← links)
