StringologyTimes

ICALP (1) for Stringologist

ICALP (1) 2015

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

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. Combining Binary Search Trees.
  3. Sparse Suffix Tree Construction in Small Space.
  4. Dynamic Compressed Strings with Random Access.

ICALP (1) 2012

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

ICALP (1) 2011

  1. Range Majority in Constant Time and Linear Space.

ICALP (1) 2010

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

ICALP (1) 2009

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

ICALP (1) 2006

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