2 papers
cs.DS2019
Re-Pair In Small Space
Dominik Köppl, Tomohiro I, Isamu Furuya +3
Re-Pair is a grammar compression scheme with favorably good compression rates. The computation of Re-Pair comes with the cost of maintaining large frequency tables, which makes it…
cs.DS2018
RePair in Compressed Space and Time
Kensuke Sakai, Tatsuya Ohno, Keisuke Goto +3
Given a string of length , the goal of grammar compression is to construct a small context-free grammar generating only . Among existing grammar compression methods, RePa…