Raphaël Clifford

According to our database, Raphaël Clifford authored at least 57 papers between 2000 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

The Dynamic k-Mismatch Problem.

Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2020

Faster classical Boson Sampling.

Peter Clifford, Raphaël Clifford

CoRR, 2020

Quality Characteristics of Artificially Intelligent Systems.

Adam Leon Smith, Raphaël Clifford

Proceedings of the 2nd International Workshop on Experience with SQuaRE Series and Its Future Direction (IWESQ 2020) co-located with 27th Asia-Pacific Software Engineering Conference (APSEC 2020), 2020

2019

Time Bounds for Streaming Problems.

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

Theory Comput., 2019

The streaming k-mismatch problem.

Raphaël Clifford, Tomasz Kociumaka, Ely Porat

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

RLE Edit Distance in Near Optimal Time.

Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Upper and Lower Bounds for Dynamic Data Structures on Strings.

Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

The Classical Complexity of Boson Sampling.

Peter Clifford, Raphaël Clifford

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2016

Dynamic and Approximate Pattern Matching in 2D.

Raphaël Clifford, Allyx Fontaine, Tatiana Starikovskaya, Hjalte Wedel Vildhøj

Proceedings of the String Processing and Information Retrieval, 2016

The <i>k</i>-mismatch problem revisited.

Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Approximate Hamming Distance in a Stream.

Raphaël Clifford, Tatiana Starikovskaya

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Cell-Probe Lower Bounds for Bit Stream Computation.

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

The complexity of computation in bit streams.

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

CoRR, 2015

The k-mismatch problem revisited.

Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya

CoRR, 2015

Cell-probe bounds for online edit distance and other pattern matching problems.

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

New Unconditional Hardness Results for Dynamic and Online Problems.

Raphaël Clifford, Allan Grønlund, Kasper Green Larsen

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Dictionary Matching in a Stream.

Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya

Proceedings of the Algorithms - ESA 2015, 2015

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

Tight Cell-Probe Bounds for Online Hamming Distance Computation.

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Element Distinctness, Frequency Moments, and Sliding Windows.

Paul Beame, Raphaël Clifford, Widad Machmouchi

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

The Complexity of Flood Filling Games.

Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach

Theory Comput. Syst., 2012

Sliding Windows With Limited Storage.

Paul Beame, Raphaël Clifford, Widad Machmouchi

Electron. Colloquium Comput. Complex., 2012

Pattern Matching in Multiple Streams.

Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Pattern matching in pseudo real-time.

Raphaël Clifford, Benjamin Sach

J. Discrete Algorithms, 2011

Maximum subset intersection.

Raphaël Clifford, Alexandru Popa

Inf. Process. Lett., 2011

Streaming Pattern Matching with Relabelling

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

CoRR, 2011

Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model.

Raphaël Clifford, Markus Jalsenius

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Space Lower Bounds for Online Pattern Matching.

Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Restricted Common Superstring and Restricted Common Supersequence.

Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

Permuted function matching.

Raphaël Clifford, Benjamin Sach

Inf. Process. Lett., 2010

A filtering algorithm for k-mismatch with don't cares.

Raphaël Clifford, Ely Porat

Inf. Process. Lett., 2010

Permuted Common Supersequence

Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa

CoRR, 2010

(In)approximability Results for Pattern Matching Problems.

Raphaël Clifford, Alexandru Popa

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

The Complexity of Flood Filling Games.

David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Pseudo-realtime Pattern Matching: Closing the Gap.

Raphaël Clifford, Benjamin Sach

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

Generalised Matching.

Raphaël Clifford, Aram W. Harrow, Alexandru Popa, Benjamin Sach

Proceedings of the String Processing and Information Retrieval, 2009

From coding theory to efficient pattern matching.

Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Pattern matching with don't cares and few errors.

Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild

Proceedings of the Search Methodologies, 05.07. - 10.07.2009, 2009

Online Approximate Matching with Non-local Distances.

Raphaël Clifford, Benjamin Sach

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008

Scheduling algorithms for procrastinators.

Michael A. Bender, Raphaël Clifford, Kostas Tsichlas

J. Sched., 2008

An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem

Benjamin Sach, Raphaël Clifford

CoRR, 2008

Mismatch Sampling.

Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild

Proceedings of the String Processing and Information Retrieval, 2008

A Black Box for Online Approximate Pattern Matching.

Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

Simple deterministic wildcard matching.

Peter Clifford, Raphaël Clifford

Inf. Process. Lett., 2007

A Filtering Algorithm for <i>k</i> -Mismatch with Don't Cares.

Raphaël Clifford, Ely Porat

Proceedings of the String Processing and Information Retrieval, 2007

Fast Approximate Point Set Matching for Information Retrieval.

Raphaël Clifford, Benjamin Sach

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

<i>k</i> -Mismatch with Don't Cares.

Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild

Proceedings of the Algorithms, 2007

Self-normalised Distance with Don't Cares.

Peter Clifford, Raphaël Clifford

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level Music Retrieval.

Raphaël Clifford, Manolis Christodoulakis, Tim Crawford, David Meredith, Geraint A. Wiggins

Proceedings of the ISMIR 2006, 2006

Algorithms on Extended (<i>delta</i>, <i>gamma</i>)-Matching.

Inbok Lee, Raphaël Clifford, Sung-Ryul Kim

Proceedings of the Computational Science and Its Applications, 2006

2005

Distributed suffix trees.

Raphaël Clifford

J. Discrete Algorithms, 2005

Necklace Swap Problem for Rhythmic Similarity Measures.

Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed

Proceedings of the String Processing and Information Retrieval, 2005

Faster Algorithms for delta, gamma-Matching and Related Problems.

Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004

Approximate string matching for music analysis.

Raphaël Clifford, Costas S. Iliopoulos

Soft Comput., 2004

2003

Distributed and Paged Suffix Trees for Large Genetic Databases.

Raphaël Clifford, Marek J. Sergot

Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002

Indexed strings for large scale genomic analysis.

Raphaël Clifford

PhD thesis, 2002

2000

Disperse: a simple and efficient approach to parallel database searching.

Raphaël Clifford, Aaron J. Mackey

Bioinform., 2000