StringologyTimes

ICALP (1) for Stringologist

ICALP (1) 2015

  1. Optimal Encodings for Range Top- k k , Selection, and Min-Max.
  2. Hollow Heaps.
  3. Replacing Mark Bits with Randomness in Fibonacci Heaps.

ICALP (1) 2014

  1. On Hardness of Jumbled Indexing.
  2. Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM.

ICALP (1) 2013

  1. Tree Compression with Top Trees.
  2. Dynamic Compressed Strings with Random Access.
  3. Sparse Suffix Tree Construction in Small Space.
  4. Combining Binary Search Trees.

ICALP (1) 2012

  1. CRAM: Compressed Random Access Memory.
  2. Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima.
  3. De-amortizing Binary Search Trees.
  4. Faster Fully Compressed Pattern Matching by Recompression.

ICALP (1) 2011

  1. Range Majority in Constant Time and Linear Space.

ICALP (1) 2010

  1. Mergeable Dictionaries.
  2. Interval Sorting.
  3. Optimal Trade-Offs for Succinct String Indexes.

ICALP (1) 2009

  1. Faster Regular Expression Matching.
  2. Dynamic Succinct Ordered Trees.

ICALP (1) 2006

  1. New Algorithms for Regular Expression Matching.
  2. The Myriad Virtues of Wavelet Trees.
This site is open source. Improve this page.