39 citations · 241 across the 54 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching
Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
Approximate Pattern Matching is among the most fundamental string-processing tasks. Given a text of length , a pattern of length , and a threshold , the task is to…
cs.DS2024
On the Communication Complexity of Approximate Pattern Matching
Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
The decades-old Pattern Matching with Edits problem, given a length- string (the text), a length- string (the pattern), and a positive integer (the threshold), as…