research
∙
02/18/2021
Range Minimum Queries in Minimal Space
We consider the problem of computing a sequence of range minimum queries...
share
research
∙
06/24/2020
Small Longest Tandem Scattered Subsequences
We consider the problem of identifying tandem scattered subsequences wit...
research
∙
05/21/2020
Hardness of Modern Games
We consider the complexity properties of modern puzzle games, Hexiom, Cu...
research
∙
05/08/2020
Sparsifying Parity-Check Matrices
Parity check matrices (PCMs) are used to define linear error correcting ...
research
∙
05/06/2020
Incremental Multiple Longest Common Sub-Sequences
We consider the problem of updating the information about multiple longe...
research
∙
03/04/2020
Approximating Optimal Bidirectional Macro Schemes
Lempel-Ziv is an easy-to-compute member of a wide family of so-called ma...
research
∙
11/08/2019
On dynamic succinct graph representations
We address the problem of representing dynamic graphs using k^2-trees. T...
research
∙
05/07/2019
Order-Preserving Pattern Matching Indeterminate Strings
Given an indeterminate string pattern p and an indeterminate string text...
research
∙
01/21/2018
Linking and Cutting Spanning Trees
We consider the problem of uniformly generating a spanning tree, of a co...
research
∙
12/23/2017
Cartesian trees and Lyndon trees
The article describes the structural and algorithmic relations between C...
research
∙
07/19/2012
