Raphaël Clifford Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1David Arthur [26] [27]
2Michael A. Bender [7] [15]
3Ayelet Butman [32]
4Manolis Christodoulakis [8]
5Peter Clifford [6] [10] [14] [32]
6Tim Crawford [8]
7Klim Efremenko [13] [17] [18] [20] [22] [39]
8Zvi Gotthilf [25] [36]
9Aram Wettroth Harrow [19]
10Costas S. Iliopoulos [3] [6]
11Markus Jalsenius [26] [27] [31] [32] [33] [34] [35] [37] [38] [40]
12Sung-Ryul Kim [9]
13Inbok Lee [9]
14Moshe Lewenstein [25] [36]
15Noa Lewenstein [32]
16Aaron J. Mackey [1]
17David Meredith [8]
18Manal Mohamed [5]
19Ashley Montanaro [26] [27] [38]
20Yoan J. Pinzon (Yoan José Pinzón Ardila) [5]
21Alexandru Popa [19] [25] [30] [36]
22Benny Porat [17] [18] [32] [39]
23Ely Porat [11] [13] [17] [18] [20] [22] [23] [32] [33] [37] [39] [40]
24Amir Rothschild [13] [17] [20] [22] [39]
25Benjamin Sach [12] [16] [19] [21] [24] [26] [27] [28] [29] [31] [32] [33] [37] [38] [40]
26Marek J. Sergot [2]
27Kostas Tsichlas [7] [15]
28Geraint A. Wiggins [8]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page