| RLE edit distance in near optimal time. | 0 | 0.34 | 2019 |
| The streaming k-mismatch problem. | 3 | 0.38 | 2019 |
| Upper and Lower Bounds for Dynamic Data Structures on Strings. | 0 | 0.34 | 2018 |
| The Classical Complexity of Boson Sampling. | 2 | 0.66 | 2018 |
| Dynamic and Approximate Pattern Matching in 2D. | 0 | 0.34 | 2016 |
| Cell-Probe Lower Bounds for Bit Stream Computation. | 0 | 0.34 | 2016 |
| Approximate Hamming distance in a stream. | 5 | 0.45 | 2016 |
| Dictionary matching in a stream. | 9 | 0.53 | 2015 |
| The k-mismatch problem revisited | 10 | 0.54 | 2015 |
| The complexity of computation in bit streams. | 0 | 0.34 | 2015 |
| New Unconditional Hardness Results for Dynamic and Online Problems | 0 | 0.34 | 2015 |
| Cell-probe bounds for online edit distance and other pattern matching problems | 4 | 0.41 | 2014 |
| Time Bounds for Streaming Problems. | 0 | 0.34 | 2014 |
| Tight cell-probe bounds for online Hamming distance computation | 3 | 0.40 | 2013 |
| Element Distinctness, Frequency Moments, and Sliding Windows | 8 | 0.49 | 2013 |
| Pattern Matching under Polynomial Transformation | 1 | 0.35 | 2013 |
| Mismatch sampling | 2 | 0.37 | 2012 |
| Pattern matching in multiple streams | 3 | 0.41 | 2012 |
| The Complexity of Flood Filling Games | 14 | 1.12 | 2012 |
| Sliding Windows with Limited Storage | 0 | 0.34 | 2012 |
| A black box for online approximate pattern matching | 15 | 0.84 | 2011 |
| Maximum subset intersection | 8 | 0.63 | 2011 |
| Streaming Pattern Matching with Relabelling | 0 | 0.34 | 2011 |
| Restricted common superstring and restricted common supersequence | 7 | 0.49 | 2011 |
| Space lower bounds for online pattern matching | 3 | 0.38 | 2011 |
| Pattern matching in pseudo real-time | 8 | 0.60 | 2011 |
| Lower bounds for online integer multiplication and convolution in the cell-probe model | 5 | 0.47 | 2011 |
| (In)Approximability Results For Pattern Matching Problems | 1 | 0.36 | 2010 |
| Permuted Common Supersequence | 0 | 0.34 | 2010 |
| Permuted function matching | 1 | 0.36 | 2010 |
| A filtering algorithm for k-mismatch with don't cares | 4 | 0.43 | 2010 |
| Pseudo-realtime pattern matching: closing the gap | 7 | 0.51 | 2010 |
| Pattern matching with don't cares and few errors. | 7 | 0.60 | 2010 |
| From coding theory to efficient pattern matching | 19 | 0.75 | 2009 |
| Online Approximate Matching with Non-local Distances | 1 | 0.38 | 2009 |
| An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem | 3 | 0.37 | 2008 |
| K-mismatch with don't cares | 20 | 1.04 | 2007 |
| Simple deterministic wildcard matching | 31 | 1.30 | 2007 |
| Self-normalised distance with don't cares | 6 | 0.52 | 2007 |
| Fast Approximate Point Set Matching for Information Retrieval | 1 | 0.41 | 2007 |
| A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level Music Retrieval | 20 | 1.22 | 2006 |
| Scheduling algorithms for procrastinators | 5 | 0.44 | 2006 |
| Necklace swap problem for rhythmic similarity measures | 1 | 0.34 | 2005 |
| Distributed suffix trees | 5 | 0.55 | 2005 |
| Distributed and paged suffix trees for large genetic databases | 16 | 0.95 | 2003 |
| Disperse: a simple and efficient approach to parallel database searching. | 10 | 5.14 | 2000 |
