Disperse: a simple and efficient approach to parallel database searching. - Raphaël Clifford; Aaron J. Mackey (Bioinform., 2000)

Indexed strings for large scale genomic analysis. - Raphaël Clifford (2002)

Distributed and Paged Suffix Trees for Large Genetic Databases. - Raphaël Clifford; Marek J. Sergot (CPM, 2003)

Approximate string matching for music analysis. - Raphaël Clifford; Costas S. Iliopoulos (Soft Comput., 2004)

Faster Algorithms for delta, gamma-Matching and Related Problems. - Peter Clifford; Raphaël Clifford; Costas S. Iliopoulos (CPM, 2005)

Necklace Swap Problem for Rhythmic Similarity Measures. - Yoan José Pinzón Ardila; Raphaël Clifford; Manal Mohamed 001 (SPIRE, 2005)

Distributed suffix trees. - Raphaël Clifford (J. Discrete Algorithms, 2005)

Algorithms on Extended (delta, gamma)-Matching. - Inbok Lee; Raphaël Clifford; Sung-Ryul Kim (ICCSA (3), 2006)

A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level Music Retrieval. - Raphaël Clifford; Manolis Christodoulakis; Tim Crawford; David Meredith 001; Geraint A. Wiggins (ISMIR, 2006)

Self-normalised Distance with Don't Cares. - Peter Clifford; Raphaël Clifford (CPM, 2007)

k -Mismatch with Don't Cares. - Raphaël Clifford; Klim Efremenko; Ely Porat; Amir Rothschild (ESA, 2007)

Fast Approximate Point Set Matching for Information Retrieval. - Raphaël Clifford; Benjamin Sach (SOFSEM (1), 2007)

A Filtering Algorithm for k -Mismatch with Don't Cares. - Raphaël Clifford; Ely Porat (SPIRE, 2007)

Simple deterministic wildcard matching. - Peter Clifford; Raphaël Clifford (Inf. Process. Lett., 2007)

An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem - Benjamin Sach; Raphaël Clifford (CoRR, 2008)

Scheduling algorithms for procrastinators. - Michael A. Bender; Raphaël Clifford; Kostas Tsichlas (J. Sched., 2008)

Online Approximate Matching with Non-local Distances. - Raphaël Clifford; Benjamin Sach (CPM, 2009)

From coding theory to efficient pattern matching. - Raphaël Clifford; Klim Efremenko; Ely Porat; Amir Rothschild (SODA, 2009)

Generalised Matching. - Raphaël Clifford; Aram W. Harrow; Alexandru Popa 001; Benjamin Sach (SPIRE, 2009)

Pseudo-realtime Pattern Matching: Closing the Gap. - Raphaël Clifford; Benjamin Sach (CPM, 2010)

The Complexity of Flood Filling Games. - David Arthur; Raphaël Clifford; Markus Jalsenius; Ashley Montanaro; Benjamin Sach (FUN, 2010)

(In)approximability Results for Pattern Matching Problems. - Raphaël Clifford; Alexandru Popa 001 (Stringology, 2010)

Permuted Common Supersequence - Raphaël Clifford; Zvi Gotthilf; Moshe Lewenstein; Alexandru Popa 001 (CoRR, 2010)

A filtering algorithm for k-mismatch with don't cares. - Raphaël Clifford; Ely Porat (Inf. Process. Lett., 2010)

Permuted function matching. - Raphaël Clifford; Benjamin Sach (Inf. Process. Lett., 2010)

Pattern matching with don't cares and few errors. - Raphaël Clifford; Klim Efremenko; Ely Porat; Amir Rothschild (J. Comput. Syst. Sci., 2010)

Restricted Common Superstring and Restricted Common Supersequence. - Raphaël Clifford; Zvi Gotthilf; Moshe Lewenstein; Alexandru Popa 001 (CPM, 2011)

Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model. - Raphaël Clifford; Markus Jalsenius (ICALP (1), 2011)

Streaming Pattern Matching with Relabelling - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (CoRR, 2011)

A black box for online approximate pattern matching. - Raphaël Clifford; Klim Efremenko; Benny Porat; Ely Porat (Inf. Comput., 2011)

Maximum subset intersection. - Raphaël Clifford; Alexandru Popa 001 (Inf. Process. Lett., 2011)

Pattern matching in pseudo real-time. - Raphaël Clifford; Benjamin Sach (J. Discrete Algorithms, 2011)

Pattern Matching in Multiple Streams. - Raphaël Clifford; Markus Jalsenius; Ely Porat; Benjamin Sach (CPM, 2012)

Sliding Windows With Limited Storage. - Paul Beame; Raphaël Clifford; Widad Machmouchi (Electron. Colloquium Comput. Complex., 2012)

Mismatch sampling. - Raphaël Clifford; Klim Efremenko; Benny Porat; Ely Porat; Amir Rothschild (Inf. Comput., 2012)

The Complexity of Flood Filling Games. - Raphaël Clifford; Markus Jalsenius; Ashley Montanaro; Benjamin Sach (Theory Comput. Syst., 2012)

Tight Cell-Probe Bounds for Online Hamming Distance Computation. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (SODA, 2013)

Element Distinctness, Frequency Moments, and Sliding Windows. - Paul Beame; Raphaël Clifford; Widad Machmouchi (Electron. Colloquium Comput. Complex., 2013)

Pattern Matching under Polynomial Transformation. - Ayelet Butman; Peter Clifford; Raphaël Clifford; Markus Jalsenius; Noa Lewenstein; Benny Porat; Ely Porat; Benjamin Sach (SIAM J. Comput., 2013)

Space lower bounds for online pattern matching. - Raphaël Clifford; Markus Jalsenius; Ely Porat; Benjamin Sach (Theor. Comput. Sci., 2013)

Dictionary Matching in a Stream. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (ESA, 2015)

New Unconditional Hardness Results for Dynamic and Online Problems. - Raphaël Clifford; Allan Grønlund; Kasper Green Larsen (FOCS, 2015)

Cell-probe bounds for online edit distance and other pattern matching problems. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (SODA, 2015)

The k-mismatch problem revisited. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (CoRR, 2015)

The complexity of computation in bit streams. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (CoRR, 2015)

Cell-Probe Lower Bounds for Bit Stream Computation. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (ESA, 2016)

Approximate Hamming Distance in a Stream. - Raphaël Clifford; Tatiana Starikovskaya (ICALP, 2016)

The k-mismatch problem revisited. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (SODA, 2016)

Dynamic and Approximate Pattern Matching in 2D. - Raphaël Clifford; Allyx Fontaine; Tatiana Starikovskaya; Hjalte Wedel Vildhøj (SPIRE, 2016)

The Classical Complexity of Boson Sampling. - Peter Clifford; Raphaël Clifford (SODA, 2018)

Upper and Lower Bounds for Dynamic Data Structures on Strings. - Raphaël Clifford; Allan Grønlund; Kasper Green Larsen; Tatiana Starikovskaya (STACS, 2018)

RLE Edit Distance in Near Optimal Time. - Raphaël Clifford; Pawel Gawrychowski; Tomasz Kociumaka; Daniel P. Martin 001; Przemyslaw Uznanski (MFCS, 2019)

The streaming k-mismatch problem. - Raphaël Clifford; Tomasz Kociumaka; Ely Porat (SODA, 2019)

Time Bounds for Streaming Problems. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (Theory Comput., 2019)

Quality Characteristics of Artificially Intelligent Systems. - Adam Leon Smith; Raphaël Clifford (IWESQ@APSEC, 2020)

Faster classical Boson Sampling. - Peter Clifford; Raphaël Clifford (CoRR, 2020)

The Dynamic k-Mismatch Problem. - Raphaël Clifford; Pawel Gawrychowski; Tomasz Kociumaka; Daniel P. Martin 001; Przemyslaw Uznanski (CPM, 2022)