Dynamic Binary Search

DOI10.1137/0208014zbMath0408.68056OpenAlexW2075117828MaRDI QIDQ4195959

Kurt 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

Information TheoryDynamicComputational ComplexityBinary Search TreesNear-OptimalityTime-Varying Access Probabilities

Mathematics Subject Classification ID

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

Related Items (6)

Alphabet-Dependent String Searching with Wexponential Search Trees ⋮ Optimum multiway search trees ⋮ Effective splaying with restricted rotations ⋮ On demand string sorting over unbounded alphabets ⋮ Unnamed Item ⋮ Optimal binary search trees

This page was built for publication: Dynamic Binary Search