Map
Index
Random
Help
th

Quote: compress assembly code by identifying common substrings via suffix trees; 7% compression on average

topics > all references > references e-f > QuoteRef: frasCW6_1984 , p. 118



Topic:
compressed code
Topic:
suffix trie
Topic:
trees

Quotation Skeleton

the code compressor starts by building the suffix … [Knuth, Vol. 3; McCreight, JACM 23.2 1976] for its input program. The suffix tree for a string … [p. 118] Suffix trees identify common substrings. … [p. 119] Once repeated code fragments have been identified, … to justify procedural abstraction [or cross-jumping]. … [p. 121] so far, compression ratios have ranged from …   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: compressed code (17 items)
Topic: suffix trie (18 items)
Topic: trees (21 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.