Biased Search Trees

DOI10.1137/0214041MaRDI QIDQ3685209zbMATH OpenOpenAlexFDO

Authors

Publication date 1985

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/761c26cff0a479196283a61389bf58ca4d4f4c8d

zbMATH Keywords

binary search treesdata structuresoptimum search treesupdate algorithms

Mathematics Subject Classification ID

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

Recommendations

• Two New Kinds of Biased Search Trees
• Biased dictionaries with fast insert/deletes
• Binary search trees with binary comparison cost
• Biased skip lists
• Randomized search trees

Cited in

(33)

• Dynamic expression trees
• Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
• Biased skip lists
• A data structure for dynamic trees
• Randomized search trees
• Top tree compression of tries
• Biased range trees
• A history of distribution-sensitive data structures
• Skip lift: a probabilistic alternative to red-black trees
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• Dynamic tree shortcut with constant degree
• Binary search trees with binary comparison cost
• Confluently Persistent Tries for Efficient Version Control
• Two New Kinds of Biased Search Trees
• Category-based routing in social networks: membership dimension and the small-world phenomenon
• scientific article; zbMATH DE number 1979482 (Why is no real title available?)
• Skip lift: a probabilistic alternative to red-black trees
• scientific article; zbMATH DE number 7051217 (Why is no real title available?)
• scientific article; zbMATH DE number 1893574 (Why is no real title available?)
• Dynamic Planar Point Location in External Memory.
• Dynamic planar point location with optimal query time (extended abstract)
• Biased dictionaries with fast insert/deletes
• Random access to grammar-compressed strings and trees
• Skewed Binary Search Trees
• Efficient authenticated data structures for graph connectivity and geometric search problems
• Near-entropy hotlink assignments
• Dynamic connectivity in disk graphs
• Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
• Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
• Lazy B-trees
• Dynamic planar point location with optimal query time
• Efficient algorithms for computing Reeb graphs
• Confluently persistent tries for efficient version control

This page was built for publication: Biased Search Trees

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