| The k-mismatch problem revisited R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya SODA 2016: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on …, 2016 | 62 | 2016 |
| Time–space trade-offs for longest common extensions P Bille, IL Gørtz, B Sach, HW Vildhøj Journal of Discrete Algorithms 25, 42-50, 2014 | 44 | 2014 |
| Fingerprints in compressed strings P Bille, PH Cording, IL Gørtz, B Sach, HW Vildhøj, S Vind WADS 2013: Algorithms and Data Structures Symposium, 146-157, 2013 | 42* | 2013 |
| Dictionary matching in a stream R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya ESA 2015: European Symposium on Algorithms, 361-372, 2015 | 39 | 2015 |
| Sparse Text Indexing in Small Space P Bille, J Fischer, IL Gørtz, T Kopelowitz, B Sach, HW Vildhøj ACM Transactions on Algorithms, 2016 | 32* | 2016 |
| The complexity of flood filling games R Clifford, M Jalsenius, A Montanaro, B Sach Theory of Computing Systems 50 (1), 72-92, 2012 | 30 | 2012 |
| The complexity of flood filling games D Arthur, R Clifford, M Jalsenius, A Montanaro, B Sach FUN 2009: Fun with Algorithms, 307-318, 2010 | 25 | 2010 |
| Generalised Matching R Clifford, AW Harrow, A Popa, B Sach String Processing and Information Retrieval: 16th International Symposium …, 2009 | 15* | 2009 |
| SuMoTED: An intuitive edit distance between rooted unordered uniquely-labelled trees M McVicar, B Sach, C Mesnage, J Lijffijt, E Spyropoulou, T De Bie Pattern Recognition Letters 79, 52-59, 2016 | 14 | 2016 |
| Space lower bounds for online pattern matching R Clifford, M Jalsenius, E Porat, B Sach Theoretical Computer Science 483, 68-74, 2013 | 14 | 2013 |
| Pattern matching in pseudo real-time R Clifford, B Sach Journal of Discrete Algorithms 9 (1), 67-81, 2011 | 14* | 2011 |
| Time-space trade-offs for longest common extensions P Bille, IL Gørtz, B Sach, HW Vildhøj Annual Symposium on Combinatorial Pattern Matching, 293-305, 2012 | 13 | 2012 |
| Cell-probe bounds for online edit distance and other pattern matching problems R Clifford, M Jalsenius, B Sach SODA 2015: ACM-SIAM Symposium on Discrete Algorithms, 552-561, 2015 | 12 | 2015 |
| Pattern matching under polynomial transformation A Butman, P Clifford, R Clifford, M Jalsenius, N Lewenstein, B Porat, ... SIAM Journal on Computing 42 (2), 611-633, 2013 | 11 | 2013 |
| Pseudo-realtime Pattern Matching: Closing the Gap R Clifford, B Sach CPM 2010: Combinatorial Pattern Matching, 101, 2010 | 11* | 2010 |
| Pattern Matching in Multiple Streams. R Clifford, M Jalsenius, E Porat, B Sach CPM 2012: Combinatorial Pattern Matching 12, 97-109, 2012 | 8 | 2012 |
| Computing the Longest Unbordered Substring P Gawrychowski, G Kucherov, B Sach, T Starikovskaya SPIRE 2015: String Processing and Information Retrieval, 246-257, 2015 | 7 | 2015 |
| Tight cell-probe bounds for online hamming distance computation R Clifford, M Jalsenius, B Sach SODA 2013, 664-674, 2012 | 7 | 2012 |
| An empirical study of cache-oblivious priority queues and their application to the shortest path problem B Sach, R Clifford Undergraduate Project (arXiv preprint arXiv:0802.1026), 2008 | 4 | 2008 |
| Permuted function matching R Clifford, B Sach Information processing letters 110 (22), 1012-1015, 2010 | 3 | 2010 |
Raphael CliffordUniversity of BristolVerified email at cs.bris.ac.uk
