scientific article; zbMATH DE number 3607502

MaRDI QIDQ4172927zbMATH OpenFDO

Authors Michael L. Fredman

Publication date 1975

zbMATH Keywords

Balanced Binary Search TreesComplexitySorting

Mathematics Subject Classification ID

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

Cited in

(14)

• Optimum multiway search trees
• Dynamic weighted binary search trees
• Algorithmic complexity of protein identification: Combinatorics of weighted strings
• Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
• Extensions of self-improving sorters
• A history of distribution-sensitive data structures
• Reflections on Optimal and Nearly Optimal Binary Search Trees
• Extensions of self-improving sorters
• Fragile complexity of adaptive algorithms
• Fragile complexity of adaptive algorithms
• Competitive Online Search Trees on Trees
• Old and new results on alphabetic codes
• Selection in \(X+Y\) and matrices with sorted rows and columns
• Assembling approximately optimal binary search trees efficiently using arithmetics

This page was built for publication:

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