Trees with exponentially growing costs

DOI10.1016/j.ic.2007.11.001zbMath1146.68486OpenAlexW1989243322MaRDI QIDQ924721

Frank Schulz

Publication date: 19 May 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2007.11.001

zbMATH Keywords

dynamic programminganalysis of algorithmssearch treesrandom treesRényi entropy

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Dynamic programming (90C39)

Related Items (1)

Operations research applications of dichotomous search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• A fast algorithm for optimal length-limited Huffman codes
• Search in an Ordered Array Having Variable Probe Cost
• Codes: Unequal Probabilities, Unequal Letter Cost
• Speed-Up in Dynamic Programming
• On a coding theorem connected with Rényi's entropy
• A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
• A Method for the Construction of Minimum-Redundancy Codes
• A coding theorem and Rényi's entropy

This page was built for publication: Trees with exponentially growing costs