StringologyTimes

SWAT for Stringologist

SWAT 2022

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

SWAT 2020

  1. Space-Efficient Data Structures for Lattices.

SWAT 2018

  1. Succinct Dynamic One-Dimensional Point Reporting.

SWAT 2016

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

SWAT 2014

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

SWAT 2012

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

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.