Slowing down top trees for better worst-case compression

DOI10.1016/J.TCS.2024.114764MaRDI QIDQ6614009

Paweł Gawrychowski, Bartłomiej Dudek

Publication date: 7 October 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

compressiontree grammarstop trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• XML compression via directed acyclic graphs
• Approximation of smallest linear tree grammar
• The complexity of tree automata and XPath on grammar-compressed trees
• Tree compression with top trees
• Size-optimal top dag compression
• Compressing and indexing labeled trees, with applications
• Variations on the Common Subexpression Problem
• Tight Bounds for Top Tree Compression

This page was built for publication: Slowing down top trees for better worst-case compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614009)