Self-Organizing Binary Search Trees
From MaRDI portal
Publication:4170254
DOI10.1145/322092.322094zbMath0388.68060WikidataQ56066201 ScholiaQ56066201MaRDI QIDQ4170254
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322092.322094
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
68P20: Information storage and retrieval of data
68R99: Discrete mathematics in relation to computer science
Related Items
The move-to-root rule for self-organizing trees with Markov dependent requests∗, Compact Difference Bound Matrices, Smooth Heaps and a Dual View of Self-Adjusting Data Structures, Unnamed Item, Optimal binary search trees, Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying, On top-down splaying, Optimum multiway search trees, Determining the mode, Optimal algorithms for sensitivity analysis in associative multiplication problems, Randomly balanced binary trees, In Pursuit of the Dynamic Optimality Conjecture, Expected Costs in Some Classes of Binary Search Trees, Self-Adjusting Binary Search Trees: What Makes Them Tick?, Amortized Computational Complexity, Unnamed Item