StringologyTimes
ICALP (1) for Stringologist
ICALP (1) 2015
Replacing Mark Bits with Randomness in Fibonacci Heaps.
Hollow Heaps.
Optimal Encodings for Range Top- k k , Selection, and Min-Max.
ICALP (1) 2014
On Hardness of Jumbled Indexing.
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM.
ICALP (1) 2013
Tree Compression with Top Trees.
Combining Binary Search Trees.
Sparse Suffix Tree Construction in Small Space.
Dynamic Compressed Strings with Random Access.
ICALP (1) 2012
CRAM: Compressed Random Access Memory.
De-amortizing Binary Search Trees.
Faster Fully Compressed Pattern Matching by Recompression.
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima.
ICALP (1) 2011
Range Majority in Constant Time and Linear Space.
ICALP (1) 2010
Interval Sorting.
Optimal Trade-Offs for Succinct String Indexes.
Mergeable Dictionaries.
ICALP (1) 2009
Dynamic Succinct Ordered Trees.
Faster Regular Expression Matching.
ICALP (1) 2006
The Myriad Virtues of Wavelet Trees.
New Algorithms for Regular Expression Matching.