Efficient Construction of Near-Optimal Binary and Multiway Search Trees

DOI10.1007/978-3-642-03367-4_21zbMath1253.68102OpenAlexW122288055MaRDI QIDQ3183458

Prosenjit Bose, Karim Douïeb

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_21

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (1)

Reflections on Optimal and Nearly Optimal Binary Search Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Optimum multiway search trees
• Nearly optimal binary search trees
• New lower bounds on the cost of binary search trees
• On binary search trees
• Organization and maintenance of large ordered indexes
• Top-down syntax nalysis
• Biased Search Trees
• Two New Kinds of Biased Search Trees
• Optimal Multi-Way Search Trees
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• A New Algorithm for Minimum Cost Binary Trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

This page was built for publication: Efficient Construction of Near-Optimal Binary and Multiway Search Trees