Biased Search Trees
From MaRDI portal
Publication:3685209
DOI10.1137/0214041zbMath0568.68045MaRDI QIDQ3685209
No author found.
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/761c26cff0a479196283a61389bf58ca4d4f4c8d
05C05: Trees
68P10: Searching and sorting
68R10: Graph theory (including graph drawing) in computer science
68P05: Data structures
Related Items
Dynamic planar point location with optimal query time, Dynamic Planar Point Location in External Memory., Random Access to Grammar-Compressed Strings and Trees, Near-entropy hotlink assignments, Dynamic connectivity in disk graphs, Zip-zip trees: making zip trees more balanced, biased, compact, or persistent, Category-based routing in social networks: membership dimension and the small-world phenomenon, Skip lift: a probabilistic alternative to red-black trees, Efficient authenticated data structures for graph connectivity and geometric search problems, Biased predecessor search, Dynamic planar point location with optimal query time, Efficient algorithms for computing Reeb graphs, Confluently persistent tries for efficient version control, Dynamic expression trees, Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm, A data structure for dynamic trees, Randomized search trees, Top tree compression of tries, 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, Confluently Persistent Tries for Efficient Version Control
