Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Information retrieval: information storage and retrieval using AVL trees
ACM '65 Proceedings of the 1965 20th national conference
Binary search trees and file organization
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Dichotomic Search Protocols for Constrained Optimization
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Bounds for weight balanced trees
IBM Journal of Research and Development
Data Structures for Range Median Queries
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Fast algorithms for bin packing
Journal of Computer and System Sciences
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Theoretical Computer Science
Scalable address spaces using RCU balanced trees
ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
Adams' trees revisited: correctness proof and efficient implementation
TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming
Dynamic matchings in convex bipartite graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
CBTree: a practical concurrent self-adjusting search tree
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
A new class of binary search trees, called trees of bounded balance, is introduced. These trees are easy to maintain in their form despite insertions and deletions of nodes, and the search time is only moderately longer than in completely balanced trees. Trees of bounded balance differ from other classes of binary search trees in that they contain a parameter which can be varied so the compromise between short search time and infrequent restructuring can be chosen arbitrarily.