StringologyTimes

ESA (1) for Stringologist

ESA (1) 2010

1. On the Huffman and Alphabetic Tree Problem with General Cost Functions.
2. Fast Prefix Search in Little Space, with Applications.
3. Medium-Space Algorithms for Inverse BWT.
4. A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings.

This site is open source. Improve this page.