StringologyTimes

WADS for Stringologist

WADS 2019

  1. Dynamic Dictionary Matching in the Online Model.
  2. Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles.

WADS 2017

  1. Optimal Query Time for Encoding Range Majority.

WADS 2015

  1. Universal Reconstruction of a String.

WADS 2013

  1. Compressed Persistent Index for Efficient Rank/Select Queries.
  2. Fingerprints in Compressed Strings.
  3. On (Dynamic) Range Minimum Queries in External Memory.
  4. Better Space Bounds for Parameterized Range Majority and Minority.

WADS 2011

  1. Space Efficient Data Structures for Dynamic Orthogonal Range Counting.

WADS 2009

  1. Worst-Case Optimal Adaptive Prefix Coding.

WADS 1999

  1. Resizable Arrays in Optimal Time and Space.
  2. Representing Trees of Higer Degree.

WADS 1997

  1. Multiple Approximate String Matching.
  2. Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds.

WADS 1991

  1. A Case Study in Comparison Based Complexity: Finding the Nearest Value(s).
  2. Sorting Multisets and Vectors In-Place.
This site is open source. Improve this page.