Raphaël Clifford

80 papers A* 9A 3B 11C 5Misc 2Journal 43Unranked 6

Year	Rank	Type	Title / Venue / Authors
2022	B	`conf`	The Dynamic k-Mismatch Problem. CPM Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
2021	J	`jnl`	The Dynamic k-Mismatch Problem. CoRR Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
2020	J	`jnl`	Faster classical Boson Sampling. CoRR Peter Clifford, Raphaël Clifford
2020	—	`conf`	Quality Characteristics of Artificially Intelligent Systems. IWESQ@APSEC Adam Leon Smith, Raphaël Clifford
2019	B	`conf`	RLE Edit Distance in Near Optimal Time. MFCS Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
2019	J	`jnl`	RLE edit distance in near optimal time. CoRR Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
2019	A*	`conf`	The streaming k-mismatch problem. SODA Raphaël Clifford, Tomasz Kociumaka, Ely Porat
2019	J	`jnl`	Time Bounds for Streaming Problems. Theory Comput. Raphaël Clifford, Markus Jalsenius, Benjamin Sach
2018	A*	`conf`	The Classical Complexity of Boson Sampling. SODA Peter Clifford, Raphaël Clifford
2018	A	`conf`	Upper and Lower Bounds for Dynamic Data Structures on Strings. STACS Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya
2018	J	`jnl`	Upper and lower bounds for dynamic data structures on strings. CoRR Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya
2017	J	`jnl`	The Classical Complexity of Boson Sampling. CoRR Peter Clifford, Raphaël Clifford
2017	J	`jnl`	The streaming k-mismatch problem. CoRR Raphaël Clifford, Tomasz Kociumaka, Ely Porat
2016	A*	`conf`	Approximate Hamming Distance in a Stream. ICALP Raphaël Clifford, Tatiana Starikovskaya
2016	J	`jnl`	Approximate Hamming distance in a stream. CoRR Raphaël Clifford, Tatiana Starikovskaya
2016	A	`conf`	Cell-Probe Lower Bounds for Bit Stream Computation. ESA Raphaël Clifford, Markus Jalsenius, Benjamin Sach
2016	C	`conf`	Dynamic and Approximate Pattern Matching in 2D. SPIRE Raphaël Clifford, Allyx Fontaine, Tatiana Starikovskaya, Hjalte Wedel Vildhøj
2016	A*	`conf`	The SODA Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
2015	A*	`conf`	Cell-probe bounds for online edit distance and other pattern matching problems. SODA Raphaël Clifford, Markus Jalsenius, Benjamin Sach
2015	A	`conf`	Dictionary Matching in a Stream. ESA Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
2015	J	`jnl`	Dictionary matching in a stream. CoRR Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
2015	A*	`conf`	New Unconditional Hardness Results for Dynamic and Online Problems. FOCS Raphaël Clifford, Allan Grønlund, Kasper Green Larsen
2015	J	`jnl`	New Unconditional Hardness Results for Dynamic and Online Problems. CoRR Raphaël Clifford, Allan Grønlund Jørgensen, Kasper Green Larsen
2015	J	`jnl`	The complexity of computation in bit streams. CoRR Raphaël Clifford, Markus Jalsenius, Benjamin Sach
2015	J	`jnl`	The k-mismatch problem revisited. CoRR Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
2014	J	`jnl`	Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems. CoRR Raphaël Clifford, Markus Jalsenius, Benjamin Sach
2014	J	`jnl`	Time Bounds for Streaming Problems. CoRR Raphaël Clifford, Markus Jalsenius, Benjamin Sach
2013	A*	`conf`	Element Distinctness, Frequency Moments, and Sliding Windows. FOCS Paul Beame, Raphaël Clifford, Widad Machmouchi
2013	J	`jnl`	Element Distinctness, Frequency Moments, and Sliding Windows. CoRR Paul Beame, Raphaël Clifford, Widad Machmouchi
2013	J	`jnl`	Element Distinctness, Frequency Moments, and Sliding Windows. Electron. Colloquium Comput. Complex. Paul Beame, Raphaël Clifford, Widad Machmouchi
2013	J	`jnl`	Pattern Matching under Polynomial Transformation. SIAM J. Comput. Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach
2013	J	`jnl`	Space lower bounds for online pattern matching. Theor. Comput. Sci. Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2013	A*	`conf`	Tight Cell-Probe Bounds for Online Hamming Distance Computation. SODA Raphaël Clifford, Markus Jalsenius, Benjamin Sach
2012	J	`jnl`	Mismatch sampling. Inf. Comput. Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild
2012	J	`jnl`	Pattern Matching in Multiple Streams CoRR Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2012	B	`conf`	Pattern Matching in Multiple Streams. CPM Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2012	J	`jnl`	Sliding Windows With Limited Storage. Electron. Colloquium Comput. Complex. Paul Beame, Raphaël Clifford, Widad Machmouchi
2012	J	`jnl`	Sliding Windows with Limited Storage CoRR Paul Beame, Raphaël Clifford, Widad Machmouchi
2012	J	`jnl`	The Complexity of Flood Filling Games. Theory Comput. Syst. Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
2012	J	`jnl`	Tight Cell-Probe Bounds for Online Hamming Distance Computation CoRR Raphaël Clifford, Markus Jalsenius, Benjamin Sach
2011	J	`jnl`	A black box for online approximate pattern matching. Inf. Comput. Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat
2011	J	`jnl`	Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model CoRR Raphaël Clifford, Markus Jalsenius
2011	—	`conf`	Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model. ICALP (1) Raphaël Clifford, Markus Jalsenius
2011	J	`jnl`	Maximum subset intersection. Inf. Process. Lett. Raphaël Clifford, Alexandru Popa
2011	J	`jnl`	Pattern Matching under Polynomial Transformation CoRR Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach
2011	J	`jnl`	Pattern matching in pseudo real-time. J. Discrete Algorithms Raphaël Clifford, Benjamin Sach
2011	B	`conf`	Restricted Common Superstring and Restricted Common Supersequence. CPM Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
2011	J	`jnl`	Space Lower Bounds for Online Pattern Matching CoRR Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2011	B	`conf`	Space Lower Bounds for Online Pattern Matching. CPM Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2011	J	`jnl`	Streaming Pattern Matching with Relabelling CoRR Raphaël Clifford, Markus Jalsenius, Benjamin Sach
2010	Misc	`conf`	(In)approximability Results for Pattern Matching Problems. PSC Raphaël Clifford, Alexandru Popa
2010	J	`jnl`	A filtering algorithm for k-mismatch with don't cares. Inf. Process. Lett. Raphaël Clifford, Ely Porat
2010	J	`jnl`	Pattern matching with don't cares and few errors. J. Comput. Syst. Sci. Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
2010	J	`jnl`	Permuted Common Supersequence CoRR Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
2010	J	`jnl`	Permuted function matching. Inf. Process. Lett. Raphaël Clifford, Benjamin Sach
2010	B	`conf`	Pseudo-realtime Pattern Matching: Closing the Gap. CPM Raphaël Clifford, Benjamin Sach
2010	J	`jnl`	The Complexity of Flood Filling Games CoRR David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
2010	Misc	`conf`	The Complexity of Flood Filling Games. FUN David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
2009	A*	`conf`	From coding theory to efficient pattern matching. SODA Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
2009	C	`conf`	Generalised Matching. SPIRE Raphaël Clifford, Aram W. Harrow, Alexandru Popa, Benjamin Sach
2009	B	`conf`	Online Approximate Matching with Non-local Distances. CPM Raphaël Clifford, Benjamin Sach
2009	—	`conf`	Pattern matching with don't cares and few errors. Search Methodologies Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
2008	B	`conf`	A Black Box for Online Approximate Pattern Matching. CPM Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat
2008	J	`jnl`	An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem CoRR Benjamin Sach, Raphaël Clifford
2008	C	`conf`	Mismatch Sampling. SPIRE Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild
2008	J	`jnl`	Scheduling algorithms for procrastinators. J. Sched. Michael A. Bender, Raphaël Clifford, Kostas Tsichlas
2007	C	`conf`	A Filtering Algorithm for SPIRE Raphaël Clifford, Ely Porat
2007	—	`conf`	Fast Approximate Point Set Matching for Information Retrieval. SOFSEM (1) Raphaël Clifford, Benjamin Sach
2007	B	`conf`	Self-normalised Distance with Don't Cares. CPM Peter Clifford, Raphaël Clifford
2007	J	`jnl`	Simple deterministic wildcard matching. Inf. Process. Lett. Peter Clifford, Raphaël Clifford
2006	—	`conf`	A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level Music Retrieval. ISMIR Raphaël Clifford, Manolis Christodoulakis, Tim Crawford, David Meredith, Geraint A. Wiggins
2006	—	`conf`	Algorithms on Extended ( ICCSA (3) Inbok Lee, Raphaël Clifford, Sung-Ryul Kim
2006	J	`jnl`	Scheduling Algorithms for Procrastinators CoRR Michael A. Bender, Raphaël Clifford, Kostas Tsichlas
2005	J	`jnl`	Distributed suffix trees. J. Discrete Algorithms Raphaël Clifford
2005	B	`conf`	Faster Algorithms for delta, gamma-Matching and Related Problems. CPM Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos
2005	C	`conf`	Necklace Swap Problem for Rhythmic Similarity Measures. SPIRE Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed
2004	J	`jnl`	Approximate string matching for music analysis. Soft Comput. Raphaël Clifford, Costas S. Iliopoulos
2003	B	`conf`	Distributed and Paged Suffix Trees for Large Genetic Databases. CPM Raphaël Clifford, Marek J. Sergot
2002	—	`—`	Indexed strings for large scale genomic analysis. Raphaël Clifford
2000	J	`jnl`	Disperse: a simple and efficient approach to parallel database searching. Bioinform. Raphaël Clifford, Aaron J. Mackey