StringologyTimes

ISAAC (2) for Stringologist

ISAAC (2) 2010

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

This site is open source. Improve this page.