30 citations · 82 across the 38 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
Online computation of normalized substring complexity
Gregory Kucherov, Yakov Nekrich
The normalized substring complexity of a string is defined as , where is the number of \textit{distinct} substrings of length . This simply defined…
cs.CG2025
Convexity Helps Iterated Search in 3D
Peyman Afshani, Yakov Nekrich, Frank Staals
Inspired by the classical fractional cascading technique, we introduce new techniques to speed up the following type of iterated search in 3D: The input is a graph wit…
cs.DS2025
Incremental Planar Nearest Neighbor Queries with Optimal Query Time
John Iacono, Yakov Nekrich
In this paper we show that two-dimensional nearest neighbor queries can be answered in optimal time while supporting insertions in time. No p…