StringologyTimes

SWAT for Stringologist

SWAT 2022

  1. Unit-Disk Range Searching and Applications.
  2. Predecessor on the Ultra-Wide Word RAM.

SWAT 2020

  1. Space-Efficient Data Structures for Lattices.

SWAT 2018

  1. Succinct Dynamic One-Dimensional Point Reporting.

SWAT 2016

  1. A Framework for Dynamic Parameterized Dictionary Matching.
  2. A Simple Mergeable Dictionary.
  3. Lower Bounds for Approximation Schemes for Closest String.
  4. Cuckoo Filter: Simplification and Analysis.

SWAT 2014

  1. Colored Range Searching in Linear Space.
  2. Expected Linear Time Sorting for Word Size Ω(log2 n loglogn).
  3. B-slack Trees: Space Efficient B-Trees.
  4. Ranked Document Selection.

SWAT 2012

  1. A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs.
  2. Sorted Range Reporting.
  3. Linear-Space Data Structures for Range Minority Query in Arrays.
  4. String Indexing for Patterns with Wildcards.

SWAT 2010

  1. An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.

SWAT 2008

  1. A Uniform Approach Towards Succinct Representation of Trees.

SWAT 1990

  1. Analysis of the Expected Search Cost in Skip Lists.

SWAT 1988

  1. An Implicit Binomial Queue with Constant Insertion Time.
This site is open source. Improve this page.