Вы здесь

Главная

Hamilton

Связанные издания:

1-2 Brother Trees or AVL Trees Revisited
An Optimal Worst-Case Algorithm for Reporting Intersections of Rectangles
Colorings and Interpretations: A Connection Between Graphs and Grammar Forms
Data Structures for the Rectangle Containment and Enclosure Problems
Dense Multiway Trees
Minimal-cost brother trees
New Results in balanced search trees
On the correspondes between AVL trees and brother trees
Optimal Multiway Search Trees
Optimal Worst-Case Algorithms for Rectangle Intersection and Batched Range Searching Problems
The Construction of Optimal Multiway Search Trees and the Monotonicity Principle
The optimal encoding of search trees in single-forward-reference lists
Two Papers on AVL and Brother Trees: One-sided k-height balanced trees
Two papers on AVL and brother trees: On the Correspondes between AVL Trees and Brother Trees