Search filters

List of works by Tomasz Kociumaka

21st International Symposium on String Processing and Information Retrieval

Proceedings

A Fast Branching Algorithm for Cluster Vertex Deletion

A note on efficient computation of all Abelian periods in a string

scholarly article by Maxime Crochemore et al published February 2013 in Information Processing Letters

A note on the longest common compatible prefix problem for partial words

An Improved Algorithm for The <i>k</i> -Dyck Edit Distance Problem

scientific article published on 19 October 2023

Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC

scientific article published on 04 June 2024

Covering Problems for Partial Words and for Indeterminate Strings

Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet

Efficient enumeration of non-equivalent squares in partial words with few holes

Fast Algorithm for Partial Covers in Words

Hardness of Approximation for Strip Packing

Linear Search by a Pair of Distinct-Speed Robots

scientific article published on 07 May 2018

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries

On the Communication Complexity of Approximate Pattern Matching

scientific article published on 11 June 2024

Order-preserving indexing

Resolution of the burrows-wheeler transform conjecture

scientific article published in 2022

Sparse Suffix Tree Construction in Optimal Time and Space

String Powers in Trees

Paulina is supported by:

About Paulina

Help