Tight Bounds for Top Tree Compression

DOI10.1007/978-3-319-67428-5_9zbMath1454.68028OpenAlexW2750956025WikidataQ60554336 ScholiaQ60554336MaRDI QIDQ5150922

Inge Li Gørtz, Philip Bille, Finn Fernstrøm

Publication date: 16 February 2021

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-67428-5_9

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (4)

Size-optimal top dag compression ⋮ Top tree compression of tries ⋮ Balancing straight-line programs for strings and trees ⋮ Slowing Down Top Trees for Better Worst-Case Compression

Cites Work

• Unnamed Item
• Tree compression with top trees
• Variations on the Common Subexpression Problem
• Minimizing diameters of dynamic trees

This page was built for publication: Tight Bounds for Top Tree Compression