Biased Search Trees
From MaRDI portal
Publication:3685209
DOI10.1137/0214041zbMath0568.68045OpenAlexW1964669678MaRDI 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
Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items
Dynamic expression trees, Efficient Construction of Near-Optimal Binary and Multiway Search Trees, Dynamic Tree Shortcut with Constant Degree, Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm, Randomized search trees, Category-based routing in social networks: membership dimension and the small-world phenomenon, Dynamic connectivity in disk graphs, Confluently Persistent Tries for Efficient Version Control, Zip-zip trees: making zip trees more balanced, biased, compact, or persistent, Dynamic planar point location with optimal query time, Skip lift: a probabilistic alternative to red-black trees, Efficient algorithms for computing Reeb graphs, Skip Lift: A Probabilistic Alternative to Red-Black Trees, Confluently persistent tries for efficient version control, Efficient authenticated data structures for graph connectivity and geometric search problems, Biased predecessor search, Near-entropy hotlink assignments, Dynamic planar point location with optimal query time, Dynamic Planar Point Location in External Memory., Top tree compression of tries, A data structure for dynamic trees, A History of Distribution-Sensitive Data Structures, Random Access to Grammar-Compressed Strings and Trees
