Multidimensional balanced binary trees
From MaRDI portal
DOI10.1109/12.30849zbMATH Open0682.68018OpenAlexW2084034436MaRDI QIDQ4732091FDOQ4732091
Authors: Vijay K. Vaishnavi
Publication date: 1989
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/367a327bc4916fa3d0d21f630e1ba856efa40f88
Recommendations
algorithmsdata structureinformation storage and retrievaldynamic databasessymmetric binary B-treesk-dimensional balanced binary tree
Cited In (16)
- On the Height of Multidimensional Height-Balanced Trees
- Edge Estimation in the Population of a Binary Tree Using Node-Sampling
- Simple algorithms for the on-line multidimensional dictionary and related problems
- Title not available (Why is that?)
- Height-analysis of k-dimensional leaf and node height-balanced trees: A new approach
- Rank-Balanced Trees
- On \(k\)-dimensional balanced binary trees.
- Title not available (Why is that?)
- Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees
- Balanced ordered trees
- A self-adjusting data structure for multidimensional point sets
- A counter example to a monotonicity property of k-d trees
- Title not available (Why is that?)
- Algorithms for BD trees
- Transforming unbalanced multiway trees into a practical external data structure
- Multidimensional trees
This page was built for publication: Multidimensional balanced binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732091)