18 citations · 54 across the 16 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
Internal Shortest Absent Word Queries in Constant Time and Linear Space
Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov +1
Given a string of length over an alphabet of size , we are to preprocess so that given a range , we can return a representa…
cs.DS2021
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
Dmitry Kosolobov, Nikita Sivukhin
The notions of synchronizing and partitioning sets are recently introduced variants of locally consistent parsings with great potential in problem-solving. In this paper we propose…
cs.DS2021★ 1 cited
Weighted Ancestors in Suffix Trees Revisited
Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi +1
The weighted ancestor problem is a well-known generalization of the predecessor problem to trees. It is known to require time for queries provided $O(n\mathop{\math…