Pages that link to "Item:Q5216437"
From MaRDI portal
The following pages link to Partial match retrieval of multidimensional data (Q5216437):
Displaying 17 items.
- On the cost of fixed partial match queries in \(K\)-d trees (Q308949) (← links)
- Mellin transforms and asymptotics: Harmonic sums (Q672981) (← links)
- On the variance of a class of inductive valuations of data structures for digital search (Q672993) (← links)
- On the cost of searching signature trees (Q845663) (← links)
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees (Q906406) (← links)
- A characterization of digital search trees from the successful search viewpoint (Q1183573) (← links)
- Intersections with random geometric objects (Q1392845) (← links)
- Singularity analysis, Hadamard products, and tree recurrences (Q1765441) (← links)
- Expected worst-case partial match in random quadtries (Q1827855) (← links)
- A limit field for orthogonal range searches in two-dimensional random point search trees (Q2274287) (← links)
- An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
- Sequence positivity through numeric analytic continuation: uniqueness of the Canham model for biomembranes (Q5051360) (← links)
- Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization (Q5056141) (← links)
- Analytic analysis of algorithms (Q5204317) (← links)
- Partial match queries in random quadtrees (Q5743457) (← links)
- On the expected cost of partial match queries in random quad-\(K\)-d trees (Q6130360) (← links)
- Computing error bounds for asymptotic expansions of regular P-recursive sequences (Q6181106) (← links)
