On the cost of optimal alphabetic code trees with unequal letter costs (Q2472833): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Code and parse trees for lossless source encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations based on minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dichotomous search with direction-dependent costs for a uniformly hidden object / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Trees Optimum Under Various Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic theory for recurrence relations based on minimization and maximization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Alphabetic Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations based on minimization and maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum lopsided binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DICHOTOMOUS SEARCH WITH TRAVEL COST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delay optimization of linear depth Boolean circuits with prescribed input arrival times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The delay of circuits whose inputs have specified arrival times / rank
 
Normal rank

Latest revision as of 17:48, 27 June 2024

scientific article
Language Label Description Also known as
English
On the cost of optimal alphabetic code trees with unequal letter costs
scientific article

    Statements

    Identifiers