The Smallest Grammar Problem Revisited | 0 | 0.34 | 2021 |
Entropy Bounds for Grammar-Based Tree Compressors | 0 | 0.34 | 2021 |
Derandomization for Sliding Window Algorithms with Strict Correctness∗ | 0 | 0.34 | 2021 |
A Comparison of Empirical Tree Entropies | 0 | 0.34 | 2020 |
Entropy Bounds For Grammar-Based Tree Compressors | 0 | 0.34 | 2019 |
Sliding Window Property Testing for Regular Languages. | 0 | 0.34 | 2019 |
Universal Tree Source Coding Using Grammar-Based Compression | 0 | 0.34 | 2019 |
Circuits and Expressions over Finite Semirings. | 0 | 0.34 | 2018 |
Automata Theory on Sliding Windows. | 2 | 0.41 | 2018 |
Sliding Window Algorithms for Regular Languages. | 0 | 0.34 | 2018 |
Randomized sliding window algorithms for regular languages. | 0 | 0.34 | 2018 |
Approximation ratio of RePair. | 2 | 0.42 | 2017 |
Circuit Evaluation for Finite Semirings. | 0 | 0.34 | 2017 |
Constructing small tree grammars and small circuits for formulas. | 5 | 0.52 | 2017 |
Querying Regular Languages over Sliding Windows. | 0 | 0.34 | 2016 |
The Smallest Grammar Problem Revisited. | 9 | 0.56 | 2016 |
Tree compression using string grammars. | 1 | 0.35 | 2015 |