StringologyTimes

ICALP for Stringologist

ICALP 2022

  1. Galloping in Fast-Growth Natural Merge Sorts.
  2. Fully Functional Parameterized Suffix Trees in Compact Space.
  3. Improved Sublinear-Time Edit Distance for Preprocessed Strings.
  4. Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds.
  5. An Optimal-Time RLBWT Construction in BWT-Runs Bounded Space.
  6. Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding.

ICALP 2021

  1. Faster Algorithms for Bounded Tree Edit Distance.
  2. Sorting Short Integers.
  3. Fine-Grained Hardness for Edit Distance to a Fixed Sequence.
  4. Analysis of Smooth Heaps and Slim Heaps.
  5. An Almost Optimal Edit Distance Oracle.
  6. Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence.
  7. Improved Approximation for Longest Common Subsequence over Small Alphabets.
  8. New Sublinear Algorithms and Lower Bounds for LIS Estimation.
  9. Linear Time Runs Over General Ordered Alphabets.
  10. Optimal-Time Queries on BWT-Runs Compressed Indexes.
  11. LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching.
  12. A Linear-Time n0.4-Approximation for Longest Common Subsequence.

ICALP 2020

  1. Dynamic Longest Common Substring in Polylogarithmic Time.
  2. Space Efficient Construction of Lyndon Arrays in Linear Time.

ICALP 2019

  1. Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication.
  2. Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps.

ICALP 2018

  1. Edit Distance between Unrooted Trees in Cubic Time.

ICALP 2017

  1. String Inference from Longest-Common-Prefix Array.
  2. Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier.

ICALP 2016

  1. Towards Tight Lower Bounds for Range Reporting on the RAM.
  2. Data Structure Lower Bounds for Document Indexing Problems.
  3. Approximate Hamming Distance in a Stream.

ICALP 2007

  1. Succinct Ordinal Trees Based on Tree Covering.

ICALP 2005

  1. The Tree Inclusion Problem: In Optimal Space and Faster.
  2. Towards Optimal Multiple Selection.

ICALP 2004

  1. Succinct Representations of Functions.

ICALP 2003

  1. Succinct Representations of Permutations.

ICALP 1982

  1. Heaps on Heaps.
This site is open source. Improve this page.