Deterministic finite automata (DFA) are a classic tool for high throughp...
Given a string S over an alphabet Σ, the 'string indexing problem'
is to...
In Gapped String Indexing, the goal is to compactly represent a string S...
Relative Lempel-Ziv (RLZ) parsing is a dictionary compression method in ...
Let S be a string of length n over an alphabet Σ and let Q be a
subset o...
We consider the predecessor problem on the ultra-wide word RAM model of
...
Given two strings S and P, the Episode Matching problem is to compute th...
The classic string indexing problem is to preprocess a string S into a
c...
The classic string indexing problem is to preprocess a string S into a
c...
We consider compact representations of collections of similar strings th...
We present the first linear time algorithm to construct the 2n-bit versi...
Given a string S of length n, the classic string indexing problem is to
...
We consider the classic partial sums problem on the ultra-wide word RAM ...
We present the first algorithm for regular expression matching that can ...
We present a compressed representation of tries based on top tree compre...
We revisit the mergeable dictionaries with shift problem, where the goal...
We consider the communication complexity of fundamental longest common p...
Given a regular expression R and a string Q the regular expression
match...
We consider the problem of decompressing the Lempel-Ziv 77 representatio...
In this paper we give an infinite family of strings for which the length...
We present a highly optimized implementation of tiered vectors, a data
s...