52 citations · 133 across the 25 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017★ 1 cited
Longest common substring with approximately mismatches
Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
In the longest common substring problem, we are given two strings of length and must find a substring of maximal length that occurs in both strings. It is well known that the p…
cs.DS2017
Improved bounds for testing Dyck languages
Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya
In this paper we consider the problem of deciding membership in Dyck languages, a fundamental family of context-free languages, comprised of well-balanced strings of parentheses. I…