The estimated cost of a search tree on binary words

DOI10.1109/18.904530zbMATH Open0998.68040OpenAlexW2135212710MaRDI QIDQ4544473

Alexey Fedotov, B. Ya. Ryabko

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.904530

zbMATH Keywords

binary search tree

Mathematics Subject Classification ID

Data structures (68P05) Coding theorems (Shannon theory) (94A24)

Related Items (1)

The cost of offline binary search tree algorithms and the complexity of the request sequence

This page was built for publication: The estimated cost of a search tree on binary words

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