StringologyTimes

ITCS for Stringologist

ITCS 2023

1. An Algorithmic Bridge Between Hamming and Levenshtein Distances.

ITCS 2020

1. Unexpected Power of Random Strings.

ITCS 2019

1. Testing Local Properties of Arrays.

ITCS 2018

1. Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds.

ITCS 2016

1. Is There an Oblivious RAM Lower Bound?

This site is open source. Improve this page.