StringologyTimes

FSTTCS for Stringologist

FSTTCS 2020

1. String Indexing for Top-k Close Consecutive Occurrences.

FSTTCS 2018

1. Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS.

FSTTCS 2016

1. Finger Search in Grammar-Compressed Strings.
2. LZ77 Factorisation of Trees.

FSTTCS 2014

1. Asymptotically Optimal Encodings for Range Selection.

FSTTCS 2011

1. Optimal Packed String Matching.

FSTTCS 2007

1. Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.

FSTTCS 1998

1. Space Efficient Suffix Trees.

FSTTCS 1992

1. Selection from Read-Only Memory and Sorting with Optimum Data Movement.

FSTTCS 1991

1. Fast Sorting In-Place Sorting with O(n) Data.

This site is open source. Improve this page.