52 citations · 133 across the 25 of their papers we have counts for
Showing 2020 · cs.DSShow all
3 papers · 2 filters
cs.DS2020★ 1 cited
Approximating longest common substring with mismatches: Theory and practice
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski +1
In the problem of the longest common substring with mismatches we are given two strings and must find the maximal length such that there is a length- substr…
cs.DS2020
Generalised Pattern Matching Revisited
Bartłomiej Dudek, Paweł Gawrychowski, Tatiana Starikovskaya
In the problem of [STOC'94, Muthukrishnan and Palem], we are given a text of length over an alphabet , a patter…
cs.DS2020★ 6 cited
Equivalences between Non-trivial Variants of 3LDT and Conv3LDT
Bartłomiej Dudek, Paweł Gawrychowski, Tatiana Starikovskaya
The popular 3SUM conjecture states that there is no strongly subquadratic time algorithm for checking if a given set of integers contains three distinct elements su…