Bounding the depth of search trees

DOI10.1093/COMJNL/36.7.668MaRDI QIDQ4591398zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Path Length of Binary Search Trees
• A fast algorithm for optimal length-limited Huffman codes
• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
• Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes

Cited in

(18)

• Depth-first iterative-deepening: An optimal admissible tree search
• Insertion depth in power-weight trees
• Branch-depth: generalizing tree-depth of graphs
• Computing Tree-Depth Faster Than 2 n
• Computationally Optimal Metric-First Code Tree Search Algorithms
• A fast algorithm for optimal length-limited Huffman codes
• scientific article; zbMATH DE number 5373718 (Why is no real title available?)
• Near-Optimal Depth-Constrained Codes
• The average complexity of depth-first search with backtracking and cutoff
• Minimum Delay Codes
• Optimal versus randomized search of fixed length binary words
• On the existence of special depth first search trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Path Length of Binary Search Trees
• On the recursion depth of special tree traversal algorithms
• Optimal binary search trees
• The complexity of bicriteria tree-depth
• Is Huffmann coding dead?

This page was built for publication: Bounding the depth of search trees

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