| Publication | Date of Publication | Type |
|---|
The dynamic \(k\)-mismatch problem
| 2024-05-06 | Paper |
scientific article; zbMATH DE number 7561710 (Why is no real title available?)
| 2022-07-21 | Paper |
Upper and lower bounds for dynamic data structures on strings
| 2020-08-05 | Paper |
Time bounds for streaming problems
Theory of Computing | 2019-12-05 | Paper |
The streaming \(k\)-mismatch problem
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Tight Cell-Probe Bounds for Online Hamming Distance Computation
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
From coding theory to efficient pattern matching
| 2019-05-06 | Paper |
Dynamic and approximate pattern matching in 2D
| 2018-10-17 | Paper |
The \(k\)-mismatch problem revisited
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The classical complexity of boson sampling
| 2018-03-15 | Paper |
Cell-probe lower bounds for bit stream computation
| 2018-03-02 | Paper |
Approximate Hamming distance in a stream
| 2017-12-19 | Paper |
A filtering algorithm for \(k\)-mismatch with don't cares
Information Processing Letters | 2017-11-03 | Paper |
Permuted function matching
Information Processing Letters | 2017-11-03 | Paper |
Cell-probe bounds for online edit distance and other pattern matching problems
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
The classical complexity of boson sampling
| 2017-06-05 | Paper |
Dictionary matching in a stream
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Space lower bounds for online pattern matching
Theoretical Computer Science | 2014-01-09 | Paper |
Pattern matching under polynomial transformation
SIAM Journal on Computing | 2013-07-24 | Paper |
Maximum subset intersection
Information Processing Letters | 2013-03-28 | Paper |
NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES
International Journal of Computational Methods | 2013-02-21 | Paper |
The complexity of flood filling games
Theory of Computing Systems | 2012-12-06 | Paper |
Pattern matching in multiple streams
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Mismatch sampling
Information and Computation | 2012-05-24 | Paper |
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
Automata, Languages and Programming | 2011-07-06 | Paper |
Space Lower Bounds for Online Pattern Matching
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Restricted common superstring and restricted common supersequence
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Pattern matching in pseudo real-time
Journal of Discrete Algorithms | 2011-05-03 | Paper |
A black box for online approximate pattern matching
Information and Computation | 2011-04-28 | Paper |
Pseudo-realtime pattern matching: closing the gap
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Distributed and paged suffix trees for large genetic databases
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Pattern matching with don't cares and few errors
Journal of Computer and System Sciences | 2010-02-12 | Paper |
Simple deterministic wildcard matching
Information Processing Letters | 2010-01-29 | Paper |
Scheduling algorithms for procrastinators
Journal of Scheduling | 2009-08-28 | Paper |
Algorithms on Extended (δ, γ)-Matching
Computational Science and Its Applications - ICCSA 2006 | 2009-02-10 | Paper |
k-Mismatch with Don’t Cares
Algorithms – ESA 2007 | 2008-09-25 | Paper |
A Black Box for Online Approximate Pattern Matching
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Self-normalised Distance with Don’t Cares
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Fast Approximate Point Set Matching for Information Retrieval
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Distributed suffix trees
Journal of Discrete Algorithms | 2005-10-27 | Paper |
Approximate string matching for music analysis
Soft Computing | 2005-04-04 | Paper |
