 | 2012 |
| 40 |  | Raphaël Clifford,
Markus Jalsenius,
Ely Porat,
Benjamin Sach:
Pattern Matching in Multiple Streams
CoRR abs/1202.3470: (2012) |
| 39 |  | Raphaël Clifford,
Klim Efremenko,
Benny Porat,
Ely Porat,
Amir Rothschild:
Mismatch sampling.
Inf. Comput. 214: 112-118 (2012) |
| 38 |  | Raphaël Clifford,
Markus Jalsenius,
Ashley Montanaro,
Benjamin Sach:
The Complexity of Flood Filling Games.
Theory Comput. Syst. 50(1): 72-92 (2012) |
| 2011 |
| 37 |  | Raphaël Clifford,
Markus Jalsenius,
Ely Porat,
Benjamin Sach:
Space Lower Bounds for Online Pattern Matching.
CPM 2011: 184-196 |
| 36 |  | Raphaël Clifford,
Zvi Gotthilf,
Moshe Lewenstein,
Alexandru Popa:
Restricted Common Superstring and Restricted Common Supersequence.
CPM 2011: 467-478 |
| 35 |  | Raphaël Clifford,
Markus Jalsenius:
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model.
ICALP (1) 2011: 593-604 |
| 34 |  | Raphaël Clifford,
Markus Jalsenius:
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
CoRR abs/1101.0768: (2011) |
| 33 |  | Raphaël Clifford,
Markus Jalsenius,
Ely Porat,
Benjamin Sach:
Space Lower Bounds for Online Pattern Matching
CoRR abs/1106.4412: (2011) |
| 32 |  | Ayelet Butman,
Peter Clifford,
Raphaël Clifford,
Markus Jalsenius,
Noa Lewenstein,
Benny Porat,
Ely Porat,
Benjamin Sach:
Pattern Matching under Polynomial Transformation
CoRR abs/1109.1494: (2011) |
| 31 |  | Raphaël Clifford,
Markus Jalsenius,
Benjamin Sach:
Streaming Pattern Matching with Relabelling
CoRR abs/1109.5269: (2011) |
| 30 |  | Raphaël Clifford,
Alexandru Popa:
Maximum subset intersection.
Inf. Process. Lett. 111(7): 323-325 (2011) |
| 29 |  | Raphaël Clifford,
Benjamin Sach:
Pattern matching in pseudo real-time.
J. Discrete Algorithms 9(1): 67-81 (2011) |
| 2010 |
| 28 |  | Raphaël Clifford,
Benjamin Sach:
Pseudo-realtime Pattern Matching: Closing the Gap.
CPM 2010: 101-111 |
| 27 |  | David Arthur,
Raphaël Clifford,
Markus Jalsenius,
Ashley Montanaro,
Benjamin Sach:
The Complexity of Flood Filling Games.
FUN 2010: 307-318 |
| 26 |  | David Arthur,
Raphaël Clifford,
Markus Jalsenius,
Ashley Montanaro,
Benjamin Sach:
The Complexity of Flood Filling Games
CoRR abs/1001.4420: (2010) |
| 25 |  | Raphaël Clifford,
Zvi Gotthilf,
Moshe Lewenstein,
Alexandru Popa:
Permuted Common Supersequence
CoRR abs/1004.0424: (2010) |
| 24 |  | Raphaël Clifford,
Benjamin Sach:
Permuted function matching.
Inf. Process. Lett. 110(22): 1012-1015 (2010) |
| 23 |  | Raphaël Clifford,
Ely Porat:
A filtering algorithm for k-mismatch with don't cares.
Inf. Process. Lett. 110(22): 1021-1025 (2010) |
| 22 |  | Raphaël Clifford,
Klim Efremenko,
Ely Porat,
Amir Rothschild:
Pattern matching with don't cares and few errors.
J. Comput. Syst. Sci. 76(2): 115-124 (2010) |
| 2009 |
| 21 |  | Raphaël Clifford,
Benjamin Sach:
Online Approximate Matching with Non-local Distances.
CPM 2009: 142-153 |
| 20 |  | Raphaël Clifford,
Klim Efremenko,
Ely Porat,
Amir Rothschild:
From coding theory to efficient pattern matching.
SODA 2009: 778-784 |
| 19 |  | Raphaël Clifford,
Aram Wettroth Harrow,
Alexandru Popa,
Benjamin Sach:
Generalised Matching.
SPIRE 2009: 295-301 |
| 2008 |
| 18 |  | Raphaël Clifford,
Klim Efremenko,
Benny Porat,
Ely Porat:
A Black Box for Online Approximate Pattern Matching.
CPM 2008: 143-151 |
| 17 |  | Raphaël Clifford,
Klim Efremenko,
Benny Porat,
Ely Porat,
Amir Rothschild:
Mismatch Sampling.
SPIRE 2008: 99-108 |
| 16 |  | Benjamin Sach,
Raphaël Clifford:
An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem
CoRR abs/0802.1026: (2008) |
| 15 |  | Michael A. Bender,
Raphaël Clifford,
Kostas Tsichlas:
Scheduling algorithms for procrastinators.
J. Scheduling 11(2): 95-104 (2008) |
| 2007 |
| 14 |  | Peter Clifford,
Raphaël Clifford:
Self-normalised Distance with Don't Cares.
CPM 2007: 63-70 |
| 13 |  | Raphaël Clifford,
Klim Efremenko,
Ely Porat,
Amir Rothschild:
k -Mismatch with Don't Cares.
ESA 2007: 151-162 |
| 12 |  | Raphaël Clifford,
Benjamin Sach:
Fast Approximate Point Set Matching for Information Retrieval.
SOFSEM (1) 2007: 212-223 |
| 11 |  | Raphaël Clifford,
Ely Porat:
A Filtering Algorithm for k -Mismatch with Don't Cares.
SPIRE 2007: 130-136 |
| 10 |  | Peter Clifford,
Raphaël Clifford:
Simple deterministic wildcard matching.
Inf. Process. Lett. 101(2): 53-54 (2007) |
| 2006 |
| 9 |  | Inbok Lee,
Raphaël Clifford,
Sung-Ryul Kim:
Algorithms on Extended (delta, gamma)-Matching.
ICCSA (3) 2006: 1137-1142 |
| 8 |  | Raphaël Clifford,
Manolis Christodoulakis,
Tim Crawford,
David Meredith,
Geraint A. Wiggins:
A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level Music Retrieval.
ISMIR 2006: 150-155 |
| 7 |  | Michael A. Bender,
Raphaël Clifford,
Kostas Tsichlas:
Scheduling Algorithms for Procrastinators
CoRR abs/cs/0606067: (2006) |
| 2005 |
| 6 |  | Peter Clifford,
Raphaël Clifford,
Costas S. Iliopoulos:
Faster Algorithms for delta, gamma-Matching and Related Problems.
CPM 2005: 68-78 |
| 5 |  | Yoan José Pinzón Ardila,
Raphaël Clifford,
Manal Mohamed:
Necklace Swap Problem for Rhythmic Similarity Measures.
SPIRE 2005: 234-245 |
| 4 |  | Raphaël Clifford:
Distributed suffix trees.
J. Discrete Algorithms 3(2-4): 176-197 (2005) |
| 2004 |
| 3 |  | Raphaël Clifford,
Costas S. Iliopoulos:
Approximate string matching for music analysis.
Soft Comput. 8(9): 597-603 (2004) |
| 2003 |
| 2 |  | Raphaël Clifford,
Marek J. Sergot:
Distributed and Paged Suffix Trees for Large Genetic Databases.
CPM 2003: 70-82 |
| 2000 |
| 1 |  | Raphaël Clifford,
Aaron J. Mackey:
Disperse: a simple and efficient approach to parallel database searching.
Bioinformatics 16(6): 564-565 (2000) |