StringologyTimes

IWOCA for Stringologist

IWOCA 2022

  1. Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings.
  2. Space-Efficient B Trees via Load-Balancing.
  3. Linear Time Construction of Indexable Elastic Founder Graphs.
  4. Practical Space-Efficient Index for Structural Pattern Matching.
  5. Computing Longest (Common) Lyndon Subsequences.

IWOCA 2021

  1. The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets.

IWOCA 2020

  1. Optimal In-place Algorithms for Basic Graph Problems.

IWOCA 2019

  1. Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.
  2. Finding Periods in Cartesian Tree Matching.
  3. Burrows-Wheeler Transform of Words Defined by Morphisms.

IWOCA 2018

  1. An Efficient Representation of Partitions of Integers.
  2. On the Expected Number of Distinct Gapped Palindromic Factors.
  3. LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression.

IWOCA 2017

  1. Shortest Unique Palindromic Substring Queries in Optimal Time.
  2. A Faster Implementation of Online Run-Length Burrows-Wheeler Transform.
  3. Computing Abelian String Regularities Based on RLE.
  4. How to Answer a Small Batch of RMQs or LCA Queries in Practice.

IWOCA 2016

  1. Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.
  2. Finding Gapped Palindromes Online.
  3. Partial Covering Arrays: Algorithms and Asymptotics.

IWOCA 2015

  1. Computing the BWT and the LCP Array in Constant Space.
  2. EERTREE: An Efficient Data Structure for Processing Palindromes in Strings.
  3. Longest Common Extensions in Partial Words.

IWOCA 2014

  1. A Suffix Tree Or Not a Suffix Tree?
  2. Computing Primitively-Rooted Squares and Runs in Partial Words.
  3. Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance.

IWOCA 2013

  1. Motif Matching Using Gapped Patterns.
  2. Suffix Tree of Alignment: An Efficient Index for Similar Data.
  3. Deciding Representability of Sets of Words of Equal Length in Polynomial Time.
  4. Prefix Table Construction and Conversion.
  5. An Optimal Algorithm for Computing All Subtree Repeats in Trees.

IWOCA 2012

  1. Range Extremum Queries.
  2. Indexing Highly Repetitive Collections.
  3. A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching.
  4. Computing a Longest Common Palindromic Subsequence.
  5. Border Array for Structural Strings.

IWOCA 2011

  1. Parameterized Longest Previous Factor.
  2. Two Constant-Factor-Optimal Realizations of Adaptive Heapsort.
  3. A Unifying Property for Distribution-Sensitive Priority Queues.
  4. Periods in Partial Words: An Algorithm.
  5. p-Suffix Sorting as Arithmetic Coding.

IWOCA 2010

  1. Worst Case Efficient Single and Multiple String Matching in the RAM Model.
  2. On the Maximal Sum of Exponents of Runsin a String.
  3. Skip Lift: A Probabilistic Alternative to Red-Black Trees.
  4. Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three.
  5. Dictionary-Symbolwise Flexible Parsing.

IWOCA 2009

  1. LPF Computation Revisited.
  2. Minimax Trees in Linear Time with Applications.
  3. Lightweight Parameterized Suffix Array Construction.
  4. Succinct Representations of Trees.
This site is open source. Improve this page.