StringologyTimes

ISAAC (2) for Stringologist

ISAAC (2) 2010

1. Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets.
2. Identifying Approximate Palindromes in Run-Length Encoded Strings.
3. Entropy-Bounded Representation of Point Grids.
4. Alphabet Partitioning for Compressed Rank/Select and Applications.
5. Dynamic Range Reporting in External Memory.

This site is open source. Improve this page.