- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j14 |      | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Space lower bounds for online pattern matching. Theor. Comput. Sci. 483: 68-74 (2013) |
| c22 | | Raphaël Clifford, Markus Jalsenius, Benjamin Sach: Tight Cell-Probe Bounds for Online Hamming Distance Computation. SODA 2013: 664-674 |
| 2012 | ||
| j13 | | Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild: Mismatch sampling. Inf. Comput. 214: 112-118 (2012) |
| j12 | | Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach: The Complexity of Flood Filling Games. Theory Comput. Syst. 50(1): 72-92 (2012) |
| c21 | | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Pattern Matching in Multiple Streams. CPM 2012: 97-109 |
| i12 | | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Pattern Matching in Multiple Streams. CoRR abs/1202.3470 (2012) |
| i11 | | Raphaël Clifford, Markus Jalsenius, Benjamin Sach: Tight Cell-Probe Bounds for Online Hamming Distance Computation. CoRR abs/1207.1885 (2012) |
| i10 | | Paul Beame, Raphaël Clifford, Widad Machmouchi: Sliding Windows with Limited Storage. CoRR abs/1212.4372 (2012) |
| i9 | | Paul Beame, Raphaël Clifford, Widad Machmouchi: Sliding Windows With Limited Storage. Electronic Colloquium on Computational Complexity (ECCC) 19: 178 (2012) |
| 2011 | ||
| j11 | | Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat: A black box for online approximate pattern matching. Inf. Comput. 209(4): 731-736 (2011) |
| j10 | | Raphaël Clifford, Alexandru Popa: Maximum subset intersection. Inf. Process. Lett. 111(7): 323-325 (2011) |
| j9 | | Raphaël Clifford, Benjamin Sach: Pattern matching in pseudo real-time. J. Discrete Algorithms 9(1): 67-81 (2011) |
| c20 | | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Space Lower Bounds for Online Pattern Matching. CPM 2011: 184-196 |
| c19 | | Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa: Restricted Common Superstring and Restricted Common Supersequence. CPM 2011: 467-478 |
| c18 | | Raphaël Clifford, Markus Jalsenius: Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model. ICALP (1) 2011: 593-604 |
| i8 | | Raphaël Clifford, Markus Jalsenius: Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model. CoRR abs/1101.0768 (2011) |
| i7 | | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Space Lower Bounds for Online Pattern Matching. CoRR abs/1106.4412 (2011) |
| i6 | | 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) |
| i5 | | Raphaël Clifford, Markus Jalsenius, Benjamin Sach: Streaming Pattern Matching with Relabelling. CoRR abs/1109.5269 (2011) |
| 2010 | ||
| j8 | | Raphaël Clifford, Benjamin Sach: Permuted function matching. Inf. Process. Lett. 110(22): 1012-1015 (2010) |
| j7 | | Raphaël Clifford, Ely Porat: A filtering algorithm for k-mismatch with don't cares. Inf. Process. Lett. 110(22): 1021-1025 (2010) |
| j6 | | 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) |
| c17 | | Raphaël Clifford, Benjamin Sach: Pseudo-realtime Pattern Matching: Closing the Gap. CPM 2010: 101-111 |
| c16 | | David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach: The Complexity of Flood Filling Games. FUN 2010: 307-318 |
| c15 | | Raphaël Clifford, Alexandru Popa: (In)approximability Results for Pattern Matching Problems. Stringology 2010: 52-62 |
| i4 | | David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach: The Complexity of Flood Filling Games. CoRR abs/1001.4420 (2010) |
| i3 | | Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa: Permuted Common Supersequence. CoRR abs/1004.0424 (2010) |
| 2009 | ||
| c14 | | Raphaël Clifford, Benjamin Sach: Online Approximate Matching with Non-local Distances. CPM 2009: 142-153 |
| c13 | | Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: From coding theory to efficient pattern matching. SODA 2009: 778-784 |
| c12 | | Raphaël Clifford, Aram Wettroth Harrow, Alexandru Popa, Benjamin Sach: Generalised Matching. SPIRE 2009: 295-301 |
| 2008 | ||
| j5 | | Michael A. Bender, Raphaël Clifford, Kostas Tsichlas: Scheduling algorithms for procrastinators. J. Scheduling 11(2): 95-104 (2008) |
| c11 | | Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat: A Black Box for Online Approximate Pattern Matching. CPM 2008: 143-151 |
| c10 | | Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild: Mismatch Sampling. SPIRE 2008: 99-108 |
| i2 | | 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) |
| 2007 | ||
| j4 | | Peter Clifford, Raphaël Clifford: Simple deterministic wildcard matching. Inf. Process. Lett. 101(2): 53-54 (2007) |
| c9 | | |
| c8 | | Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: k -Mismatch with Don't Cares. ESA 2007: 151-162 |
| c7 | | Raphaël Clifford, Benjamin Sach: Fast Approximate Point Set Matching for Information Retrieval. SOFSEM (1) 2007: 212-223 |
| c6 | | Raphaël Clifford, Ely Porat: A Filtering Algorithm for k -Mismatch with Don't Cares. SPIRE 2007: 130-136 |
| 2006 | ||
| c5 | | Inbok Lee, Raphaël Clifford, Sung-Ryul Kim: Algorithms on Extended (delta, gamma)-Matching. ICCSA (3) 2006: 1137-1142 |
| c4 |  | 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 |
| i1 | | Michael A. Bender, Raphaël Clifford, Kostas Tsichlas: Scheduling Algorithms for Procrastinators. CoRR abs/cs/0606067 (2006) |
| 2005 | ||
| j3 | | |
| c3 | | Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos: Faster Algorithms for delta, gamma-Matching and Related Problems. CPM 2005: 68-78 |
| c2 | | Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed: Necklace Swap Problem for Rhythmic Similarity Measures. SPIRE 2005: 234-245 |
| 2004 | ||
| j2 | | Raphaël Clifford, Costas S. Iliopoulos: Approximate string matching for music analysis. Soft Comput. 8(9): 597-603 (2004) |
| 2003 | ||
| c1 | | Raphaël Clifford, Marek J. Sergot: Distributed and Paged Suffix Trees for Large Genetic Databases. CPM 2003: 70-82 |
| 2000 | ||
| j1 | | Raphaël Clifford, Aaron J. Mackey: Disperse: a simple and efficient approach to parallel database searching. Bioinformatics 16(6): 564-565 (2000) |
Colors in the list of coauthors
Last update Thu May 23 14:58:23 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page