On the cost of optimal alphabetic code trees with unequal letter costs

DOI10.1016/J.EJC.2007.02.014zbMATH Open1130.68064OpenAlexW2030964753MaRDI QIDQ2472833FDOQ2472833

Authors: Dieter Rautenbach, Christian Szegedy, Jürgen Werber 

Publication date: 25 February 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.02.014

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Code and parse trees for lossless source encoding
• The delay of circuits whose inputs have specified arrival times
• Delay optimization of linear depth Boolean circuits with prescribed input arrival times
• Recurrence relations based on minimization
• Optimal Alphabetic Trees
• Binary Trees Optimum Under Various Criteria
• An asymptotic theory for recurrence relations based on minimization and maximization.
• Optimum lopsided binary trees
• Recurrence relations based on minimization and maximization
• A DICHOTOMOUS SEARCH WITH TRAVEL COST
• On dichotomous search with direction-dependent costs for a uniformly hidden object

Cited In (1)

• Fast prefix adders for non-uniform input arrival times

This page was built for publication: On the cost of optimal alphabetic code trees with unequal letter costs

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