Page usage in a quadtree index
From MaRDI portal
Publication:1198966
DOI10.1007/BF02074876zbMath0752.68019MaRDI QIDQ1198966
Mamoru Hoshi, Philippe Flajolet
Publication date: 16 January 1993
Published in: BIT (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Data structures (68P05)
Related Items
Combinatorial variations on multidimensional quadtrees ⋮ On the distribution of the arity of the root of a \(d\)-dimensional quadtree ⋮ Study of the universal constants for the multidimensional search quadtrees ⋮ Hypergeometrics and the cost structure of quadtrees ⋮ On the size of paged recursive trees ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ Analytic analysis of algorithms ⋮ Toward a Formal Derivation of the Expected Behavior of Prefix B-Trees ⋮ Analytic variations on quadtrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of grid file algorithms
- On random 2-3 trees
- Analytic variations on quadtrees
- Transforming unbalanced multiway trees into a practical external data structure
- Ignoring ignorance and agreeing to disagree
- An Analysis of Randomd-Dimensional Quad Trees
- Singularity Analysis of Generating Functions
- Generalized Digital Trees and Their Difference—Differential Equations
- Dynamic hashing
- Analysis of the space of search trees under the random insertion algorithm
This page was built for publication: Page usage in a quadtree index