Dynamic Binary Search

DOI10.1137/0208014MaRDI QIDQ4195959zbMATH OpenOpenAlexFDO

Authors K. Mehlhorn

Publication date 1979

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0208014

zbMATH Keywords

Binary Search TreesComputational ComplexityDynamicInformation TheoryNear-OptimalityTime-Varying Access Probabilities

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Information theory (general) (94A15)

Cited in

(7)

• Optimum multiway search trees
• Alphabet-dependent string searching with wexponential search trees
• Effective splaying with restricted rotations
• scientific article; zbMATH DE number 3733237 (Why is no real title available?)
• On demand string sorting over unbounded alphabets
• Optimal binary search trees
• Zip-zip trees: making zip trees more balanced, biased, compact, or persistent

This page was built for publication: Dynamic Binary Search

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