scientific article; zbMATH DE number 3607502

zbMath0391.68035MaRDI QIDQ4172927

Michael L. Fredman

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

ComplexitySortingBalanced Binary Search Trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Permutations, words, matrices (05A05)

Related Items

Optimum multiway search trees, Algorithmic complexity of protein identification: Combinatorics of weighted strings, Unnamed Item, Assembling approximately optimal binary search trees efficiently using arithmetics, The power and limitations of static binary search trees with lazy finger, Extensions of self-improving sorters, Dynamic weighted binary search trees, Fragile complexity of adaptive algorithms, Fragile complexity of adaptive algorithms, Reflections on Optimal and Nearly Optimal Binary Search Trees, Selection in \(X+Y\) and matrices with sorted rows and columns, Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences, A History of Distribution-Sensitive Data Structures, Competitive Online Search Trees on Trees