Bounding the Depth of Search Trees

DOI10.1093/comjnl/36.7.668zbMath1373.94951OpenAlexW4245459073MaRDI QIDQ4591398

Aviezri S. Fraenkel, Shmuel T. Klein

Publication date: 14 November 2017

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/36.7.668

Mathematics Subject Classification ID

Searching and sorting (68P10) Other types of codes (94B60)

Related Items (2)

Is Huffmann coding dead? ⋮ Optimal binary search trees

This page was built for publication: Bounding the Depth of Search Trees