Skip to search formSkip to main contentSkip to account menu

Faster deterministic Feedback Vertex Set

View PDF on arXiv (opens in a new tab)

Optimal-Time Dictionary-Compressed Indexes

The first self-indexes able to count and locate pattern occurrences in optimal time within a space bounded by the size of the most popular dictionary compressors are described, combining several recent findings including string attractors and grammars based on locally consistent parsing.
View on ACM (opens in a new tab)

Towards a Definitive Measure of Repetitiveness

A smaller measure, $\delta$, is studied, which can be computed in linear time and captures better the concept of compressibility in repetitive strings, and it is proved that, for some string families, it holds $\gamma = \Omega(\delta \log n)$.
View PDF on arXiv (opens in a new tab)

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes

An O(nloglogn) time construction of an index that enables order-preserving pattern matching queries in time proportional to pattern length and an O(\frac{n\log{n}}{\log\log-n}}) time algorithm constructing complete order- Preserving suffix trees.
View via Publisher (opens in a new tab)

Sparse Suffix Tree Construction in Optimal Time and Space

A linear-time Monte Carlo algorithm is designed for sparse suffix tree construction, and this algorithm is complemented with a deterministic verification procedure that improves upon the bound of O(n log b) obtained by I et al.
View PDF on arXiv (opens in a new tab)

String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure

This paper proposes the first algorithm that breaks the O(n)-time barrier for BWT construction, based on a novel concept of string synchronizing sets, which is of independent interest and shows that this technique lets us design a data structure of the optimal size O(N/logn) that answers Longest Common Extension queries (LCE queries) in O(1) time and, furthermore, can be deterministically constructed in the optimal O( n/ logn) time.
View on ACM (opens in a new tab)

Enhanced string covering

View via Publisher (opens in a new tab)

Fast Algorithm for Partial Covers in Words

A new notion of \alpha $$α-partial cover is introduced, which can be viewed as a relaxed variant of cover, that is, a factor covering at least $$\alpha $$ α positions in $$w$$w.
View on Springer (opens in a new tab)

Efficient data structures for internal queries in texts

This dissertation provides the first optimal data structure for smaller alphabets of size σ n, which handles queries in O(1) time, takes O(n/ logσ n) space, and admits an O-time construction of T from the packed representation of T with Θ(logσn) characters in each machine word.

Constant Factor Approximation for Capacitated k-Center with Outliers

The first constant factor approximation algorithm with approximation ratio of 25 even for the case of non-uniform hard capacities is presented.
View PDF on arXiv (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)