9 citations · 29 across the 10 of their papers we have counts for
4 papers · 1 filter
Faster Privacy-Preserving Computation of Edit Distance with Moves
Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake +3
We consider an efficient two-party protocol for securely computing the similarity of strings w.r.t. an extended edit distance measure. Here, two parties possessing strings and…
Practical Random Access to SLP-Compressed Texts
Travis Gagie, Tomohiro I, Giovanni Manzini +4
Grammar-based compression is a popular and powerful approach to compressing repetitive texts but until recently its relatively poor time-space trade-offs during real-life construct…
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…
Rpair: Rescaling RePair with Rsync
Travis Gagie, Tomohiro I, Giovanni Manzini +3
Data compression is a powerful tool for managing massive but repetitive datasets, especially schemes such as grammar-based compression that support computation over the data withou…