| Classical boson sampling algorithms with superior performance to near-term experiments A Neville, C Sparrow, R Clifford, E Johnston, PM Birchall, A Montanaro, ... Nature Physics 13 (12), 1153-1157, 2017 | 135 | 2017 |
| Simple deterministic wildcard matching P Clifford, R Clifford Information Processing Letters 101 (2), 53-54, 2007 | 84 | 2007 |
| The classical complexity of boson sampling P Clifford, R Clifford Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 67 | 2018 |
| Short-term safety outcomes of mastectomy and immediate implant-based breast reconstruction with and without mesh (iBRA): a multicentre, prospective cohort study S Potter, EJ Conroy, RI Cutress, PR Williamson, L Whisker, S Thrush, ... The Lancet Oncology 20 (2), 254-266, 2019 | 52 | 2019 |
| Faster algorithms for δ, γ-matching and related problems P Clifford, R Clifford, C Iliopoulos Annual Symposium on Combinatorial Pattern Matching, 68-78, 2005 | 47 | 2005 |
| The k-mismatch problem revisited R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 46 | 2016 |
| From coding theory to efficient pattern matching R Clifford, K Efremenko, E Porat, A Rothschild Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009 | 41 | 2009 |
| Pattern matching with don't cares and few errors R Clifford, K Efremenko, E Porat, A Rothschild Journal of Computer and System Sciences 76 (2), 115-124, 2010 | 39 | 2010 |
| A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level Music Retrieval. R Clifford, M Christodoulakis, T Crawford, D Meredith, GA Wiggins ISMIR, 150-155, 2006 | 38 | 2006 |
| Approximate string matching for music analysis R Clifford, C Iliopoulos Soft Computing 8 (9), 597-603, 2004 | 38 | 2004 |
| Distributed and paged suffix trees for large genetic databases R Clifford, M Sergot Annual Symposium on Combinatorial Pattern Matching, 70-82, 2003 | 36 | 2003 |
| k-mismatch with don’t cares R Clifford, K Efremenko, E Porat, A Rothschild European Symposium on Algorithms, 151-162, 2007 | 35 | 2007 |
| Dictionary matching in a stream R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya Algorithms-ESA 2015, 361-372, 2015 | 32 | 2015 |
| The complexity of flood filling games R Clifford, M Jalsenius, A Montanaro, B Sach Theory of Computing Systems 50 (1), 72-92, 2012 | 27 | 2012 |
| Approximate Hamming distance in a stream R Clifford, T Starikovskaya arXiv preprint arXiv:1602.07241, 2016 | 25 | 2016 |
| New unconditional hardness results for dynamic and online problems RCA Gronlund, A Grønlund, KG Larsen 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1089-1107, 2015 | 24 | 2015 |
| The complexity of flood filling games D Arthur, R Clifford, M Jalsenius, A Montanaro, B Sach International Conference on Fun with Algorithms, 307-318, 2010 | 24 | 2010 |
| Element distinctness, frequency moments, and sliding windows P Beame, R Clifford, W Machmouchi 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 290-299, 2013 | 22 | 2013 |
| Disperse: a simple and efficient approach to parallel database searching R Clifford, AJ Mackey Bioinformatics 16 (6), 564-565, 2000 | 22 | 2000 |
| Distributed suffix trees R Clifford Journal of discrete algorithms 3 (2-4), 176-197, 2005 | 21 | 2005 |
Tatiana StarikovskayaEcole Normale SupérieureVerified email at ens.fr
Tatiana StarikovskayaEcole Normale SupérieureVerified email at ens.fr