Two New Kinds of Biased Search Trees

DOI10.1002/J.1538-7305.1983.TB03469.XMaRDI QIDQ3704898zbMATH OpenOpenAlexFDO

Authors

Publication date 1983

Published in Bell System Technical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/j.1538-7305.1983.tb03469.x

zbMATH Keywords

data structurepseudo-weight-balanced trees

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Biased Search Trees
• Binary search trees with binary comparison cost
• A new weight balanced binary search tree
• scientific article; zbMATH DE number 3852445
• Randomized search trees

Cited in

(15)

• Two new bidirectional search algorithms
• The CB tree: a practical concurrent self-adjusting search tree
• Biased range trees
• Skip lift: a probabilistic alternative to red-black trees
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• Biased Search Trees
• Skip lift: a probabilistic alternative to red-black trees
• scientific article; zbMATH DE number 7051217 (Why is no real title available?)
• Dynamic Planar Point Location in External Memory.
• Biased dictionaries with fast insert/deletes
• Skewed Binary Search Trees
• Power balance and apportionment algorithms for the United States Congress
• Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
• Weight biased leftist trees and modified skip lists
• Lazy B-trees

This page was built for publication: Two New Kinds of Biased Search Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3704898)