Assembling approximately optimal binary search trees efficiently using arithmetics
From MaRDI portal
Publication:989540
DOI10.1016/j.ipl.2008.08.012zbMath1202.68118OpenAlexW1967146916MaRDI QIDQ989540
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.08.012
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly optimal binary search trees
- Cache-Oblivious Algorithms
- Cache-oblivious string dictionaries
- A Best Possible Bound for The Weighted Path Length of Binary Search Trees
- Arithmetic Coding
- A lower bound on the expected length of one-to-one codes
- New bounds on the expected length of one-to-one codes