Abstract / Description of output
A grammar-compressed ranked tree is represented with a linear space overhead so that a single traversal step, i.e., the move to the parent or the ith child, can be carried out in constant time. The data structure is extended so that equality of subtrees can be checked in constant time.
Original language | English |
---|---|
Title of host publication | 2016 Data Compression Conference |
Number of pages | 10 |
Publication status | Published - 2016 |
Event | 2016 Data Compression Conference - Snowbird, United States Duration: 29 Mar 2016 → 1 Apr 2016 https://signalprocessingsociety.org/blog/2016-data-compression-conference-dcc-2016 |
Conference
Conference | 2016 Data Compression Conference |
---|---|
Abbreviated title | DCC 2016 |
Country/Territory | United States |
City | Snowbird |
Period | 29/03/16 → 1/04/16 |
Internet address |