default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaphaël Clifford
Person information
- affiliation: University of Bristol, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c36]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
The Dynamic k-Mismatch Problem. CPM 2022: 18:1-18:15- 2021
- [i28]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
The Dynamic k-Mismatch Problem. CoRR abs/2105.06166 (2021) - 2020
- [c35]Adam Leon Smith, Raphaël Clifford:
Quality Characteristics of Artificially Intelligent Systems. IWESQ@APSEC 2020: 1-6 - [i27]Peter Clifford, Raphaël Clifford:
Faster classical Boson Sampling. CoRR abs/2005.04214 (2020)
2010 – 2019
- 2019
- [j16]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Time Bounds for Streaming Problems. Theory Comput. 15: 1-31 (2019) - [c34]Raphaël Clifford
, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
RLE Edit Distance in Near Optimal Time. MFCS 2019: 66:1-66:13 - [c33]Raphaël Clifford, Tomasz Kociumaka, Ely Porat:
The streaming k-mismatch problem. SODA 2019: 1106-1125 - [i26]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
RLE edit distance in near optimal time. CoRR abs/1905.01254 (2019) - 2018
- [c32]Peter Clifford, Raphaël Clifford:
The Classical Complexity of Boson Sampling. SODA 2018: 146-155 - [c31]Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya:
Upper and Lower Bounds for Dynamic Data Structures on Strings. STACS 2018: 22:1-22:14 - [i25]Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya:
Upper and lower bounds for dynamic data structures on strings. CoRR abs/1802.06545 (2018) - 2017
- [i24]Peter Clifford, Raphaël Clifford:
The Classical Complexity of Boson Sampling. CoRR abs/1706.01260 (2017) - [i23]Raphaël Clifford, Tomasz Kociumaka, Ely Porat:
The streaming k-mismatch problem. CoRR abs/1708.05223 (2017) - 2016
- [c30]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Cell-Probe Lower Bounds for Bit Stream Computation. ESA 2016: 31:1-31:15 - [c29]Raphaël Clifford, Tatiana Starikovskaya:
Approximate Hamming Distance in a Stream. ICALP 2016: 20:1-20:14 - [c28]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
The k-mismatch problem revisited. SODA 2016: 2039-2052 - [c27]Raphaël Clifford, Allyx Fontaine, Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Dynamic and Approximate Pattern Matching in 2D. SPIRE 2016: 133-144 - [i22]Raphaël Clifford, Tatiana Starikovskaya:
Approximate Hamming distance in a stream. CoRR abs/1602.07241 (2016) - 2015
- [c26]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
Dictionary Matching in a Stream. ESA 2015: 361-372 - [c25]Raphaël Clifford, Allan Grønlund, Kasper Green Larsen:
New Unconditional Hardness Results for Dynamic and Online Problems. FOCS 2015: 1089-1107 - [c24]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Cell-probe bounds for online edit distance and other pattern matching problems. SODA 2015: 552-561 - [i21]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
The complexity of computation in bit streams. CoRR abs/1504.00834 (2015) - [i20]Raphaël Clifford, Allan Grønlund Jørgensen, Kasper Green Larsen:
New Unconditional Hardness Results for Dynamic and Online Problems. CoRR abs/1504.01836 (2015) - [i19]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
Dictionary matching in a stream. CoRR abs/1504.06242 (2015) - [i18]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
The k-mismatch problem revisited. CoRR abs/1508.00731 (2015) - 2014
- [i17]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems. CoRR abs/1407.6559 (2014) - [i16]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Time Bounds for Streaming Problems. CoRR abs/1412.6935 (2014) - 2013
- [j15]Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach:
Pattern Matching under Polynomial Transformation. SIAM J. Comput. 42(2): 611-633 (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) - [c23]Paul Beame, Raphaël Clifford, Widad Machmouchi:
Element Distinctness, Frequency Moments, and Sliding Windows. FOCS 2013: 290-299 - [c22]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Tight Cell-Probe Bounds for Online Hamming Distance Computation. SODA 2013: 664-674 - [i15]Paul Beame, Raphaël Clifford, Widad Machmouchi:
Element Distinctness, Frequency Moments, and Sliding Windows. CoRR abs/1309.3690 (2013) - [i14]Paul Beame, Raphaël Clifford, Widad Machmouchi:
Element Distinctness, Frequency Moments, and Sliding Windows. Electron. Colloquium Comput. Complex. TR13 (2013) - 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 - [i13]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Pattern Matching in Multiple Streams. CoRR abs/1202.3470 (2012) - [i12]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Tight Cell-Probe Bounds for Online Hamming Distance Computation. CoRR abs/1207.1885 (2012) - [i11]Paul Beame, Raphaël Clifford, Widad Machmouchi:
Sliding Windows with Limited Storage. CoRR abs/1212.4372 (2012) - [i10]Paul Beame, Raphaël Clifford, Widad Machmouchi:
Sliding Windows With Limited Storage. Electron. Colloquium Comput. Complex. TR12 (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 - [i9]Raphaël Clifford, Markus Jalsenius:
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model. CoRR abs/1101.0768 (2011) - [i8]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Space Lower Bounds for Online Pattern Matching. CoRR abs/1106.4412 (2011) - [i7]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) - [i6]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 - [i5]David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach:
The Complexity of Flood Filling Games. CoRR abs/1001.4420 (2010) - [i4]Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa:
Permuted Common Supersequence. CoRR abs/1004.0424 (2010)
2000 – 2009
- 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 W. Harrow, Alexandru Popa, Benjamin Sach:
Generalised Matching. SPIRE 2009: 295-301 - [i3]Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild:
Pattern matching with don't cares and few errors. Search Methodologies 2009 - 2008
- [j5]Michael A. Bender, Raphaël Clifford, Kostas Tsichlas:
Scheduling algorithms for procrastinators. J. Sched. 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]Peter Clifford, Raphaël Clifford:
Self-normalised Distance with Don't Cares. CPM 2007: 63-70 - [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]Raphaël Clifford:
Distributed suffix trees. J. Discrete Algorithms 3(2-4): 176-197 (2005) - [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 - 2002
- [b1]Raphaël Clifford:
Indexed strings for large scale genomic analysis. Imperial College London, UK, 2002 - 2000
- [j1]Raphaël Clifford, Aaron J. Mackey:
Disperse: a simple and efficient approach to parallel database searching. Bioinform. 16(6): 564-565 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
