Optimal search trees and length restricted codes (Q3867198): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Binary Search Trees with Restricted Maximal Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of compact programs and directly executed languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal variable length codes (arbitrary symbol cost and equal code word probability) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal search trees and length restricted codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of the Physical Structure of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142698 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 04:36, 13 June 2024

scientific article
Language Label Description Also known as
English
Optimal search trees and length restricted codes
scientific article

    Statements

    Optimal search trees and length restricted codes (English)
    0 references
    0 references
    1979
    0 references
    algorithm
    0 references
    prefix codes
    0 references
    optimal search trees
    0 references
    variable-length codes
    0 references
    directly executed languages
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references