An optimal, purely functional implementation of the Garsia–Wachs algorithm (Q5110926): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q126317492, #quickstatements; #temporary_batch_1718132803760
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Algorithm Design with Haskell / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Minimum Cost Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Computer Search Trees and Variable-Length Alphabetical Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Zipper / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correctness of constructing optimal alphabetic trees revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the Garsia-Wachs algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank

Revision as of 17:49, 22 July 2024

scientific article; zbMATH DE number 7203391
Language Label Description Also known as
English
An optimal, purely functional implementation of the Garsia–Wachs algorithm
scientific article; zbMATH DE number 7203391

    Statements

    An optimal, purely functional implementation of the Garsia–Wachs algorithm (English)
    0 references
    0 references
    26 May 2020
    0 references

    Identifiers