Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Raphaël Clifford
@inproceedings{DBLP:conf/cpm/CliffordGK0U22,
author = {Rapha{\"{e}}l Clifford and
Pawel Gawrychowski and
Tomasz Kociumaka and
Daniel P. Martin and
Przemyslaw Uznanski},
editor = {Hideo Bannai and
Jan Holub},
title = {The Dynamic k-Mismatch Problem},
booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2022,
June 27-29, 2022, Prague, Czech Republic},
series = {LIPIcs},
volume = {223},
pages = {18:1--18:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CPM.2022.18},
doi = {10.4230/LIPICS.CPM.2022.18},
timestamp = {Wed, 22 Jun 2022 16:20:49 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CliffordGK0U22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-06166,
author = {Rapha{\"{e}}l Clifford and
Pawel Gawrychowski and
Tomasz Kociumaka and
Daniel P. Martin and
Przemyslaw Uznanski},
title = {The Dynamic k-Mismatch Problem},
journal = {CoRR},
volume = {abs/2105.06166},
year = {2021},
url = {https://arxiv.org/abs/2105.06166},
eprinttype = {arXiv},
eprint = {2105.06166},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-06166.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apsec/SmithC20,
author = {Adam Leon Smith and
Rapha{\"{e}}l Clifford},
editor = {Tsuyoshi Nakajima and
Toshihiro Komiyama},
title = {Quality Characteristics of Artificially Intelligent Systems},
booktitle = {Proceedings of the 2nd International Workshop on Experience with SQuaRE
Series and Its Future Direction {(IWESQ} 2020) co-located with 27th
Asia-Pacific Software Engineering Conference {(APSEC} 2020), Singapore,
Dec 1, 2020},
series = {{CEUR} Workshop Proceedings},
volume = {2800},
pages = {1--6},
publisher = {CEUR-WS.org},
year = {2020},
url = {https://ceur-ws.org/Vol-2800/paper-01.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:12 +0100},
biburl = {https://dblp.org/rec/conf/apsec/SmithC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-04214,
author = {Peter Clifford and
Rapha{\"{e}}l Clifford},
title = {Faster classical Boson Sampling},
journal = {CoRR},
volume = {abs/2005.04214},
year = {2020},
url = {https://arxiv.org/abs/2005.04214},
eprinttype = {arXiv},
eprint = {2005.04214},
timestamp = {Thu, 14 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-04214.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/CliffordJS19,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Benjamin Sach},
title = {Time Bounds for Streaming Problems},
journal = {Theory Comput.},
volume = {15},
pages = {1--31},
year = {2019},
url = {https://doi.org/10.4086/toc.2019.v015a002},
doi = {10.4086/TOC.2019.V015A002},
timestamp = {Tue, 09 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/CliffordJS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CliffordGKMU19,
author = {Rapha{\"{e}}l Clifford and
Pawel Gawrychowski and
Tomasz Kociumaka and
Daniel P. Martin and
Przemyslaw Uznanski},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {{RLE} Edit Distance in Near Optimal Time},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {66:1--66:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.66},
doi = {10.4230/LIPICS.MFCS.2019.66},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CliffordGKMU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CliffordKP19,
author = {Rapha{\"{e}}l Clifford and
Tomasz Kociumaka and
Ely Porat},
editor = {Timothy M. Chan},
title = {The streaming k-mismatch problem},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1106--1125},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.68},
doi = {10.1137/1.9781611975482.68},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/CliffordKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-01254,
author = {Rapha{\"{e}}l Clifford and
Pawel Gawrychowski and
Tomasz Kociumaka and
Daniel P. Martin and
Przemyslaw Uznanski},
title = {{RLE} edit distance in near optimal time},
journal = {CoRR},
volume = {abs/1905.01254},
year = {2019},
url = {http://arxiv.org/abs/1905.01254},
eprinttype = {arXiv},
eprint = {1905.01254},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-01254.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CliffordC18,
author = {Peter Clifford and
Rapha{\"{e}}l Clifford},
editor = {Artur Czumaj},
title = {The Classical Complexity of Boson Sampling},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {146--155},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.10},
doi = {10.1137/1.9781611975031.10},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/CliffordC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CliffordGLS18,
author = {Rapha{\"{e}}l Clifford and
Allan Gr{\o}nlund and
Kasper Green Larsen and
Tatiana Starikovskaya},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Upper and Lower Bounds for Dynamic Data Structures on Strings},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.22},
doi = {10.4230/LIPICS.STACS.2018.22},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/CliffordGLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-06545,
author = {Rapha{\"{e}}l Clifford and
Allan Gr{\o}nlund and
Kasper Green Larsen and
Tatiana Starikovskaya},
title = {Upper and lower bounds for dynamic data structures on strings},
journal = {CoRR},
volume = {abs/1802.06545},
year = {2018},
url = {http://arxiv.org/abs/1802.06545},
eprinttype = {arXiv},
eprint = {1802.06545},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-06545.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordC17,
author = {Peter Clifford and
Rapha{\"{e}}l Clifford},
title = {The Classical Complexity of Boson Sampling},
journal = {CoRR},
volume = {abs/1706.01260},
year = {2017},
url = {http://arxiv.org/abs/1706.01260},
eprinttype = {arXiv},
eprint = {1706.01260},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CliffordC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-05223,
author = {Rapha{\"{e}}l Clifford and
Tomasz Kociumaka and
Ely Porat},
title = {The streaming k-mismatch problem},
journal = {CoRR},
volume = {abs/1708.05223},
year = {2017},
url = {http://arxiv.org/abs/1708.05223},
eprinttype = {arXiv},
eprint = {1708.05223},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-05223.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CliffordJS16,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Benjamin Sach},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Cell-Probe Lower Bounds for Bit Stream Computation},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {31:1--31:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.31},
doi = {10.4230/LIPICS.ESA.2016.31},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/CliffordJS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CliffordS16,
author = {Rapha{\"{e}}l Clifford and
Tatiana Starikovskaya},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Approximate Hamming Distance in a Stream},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {20:1--20:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.20},
doi = {10.4230/LIPICS.ICALP.2016.20},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/CliffordS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CliffordFPSS16,
author = {Rapha{\"{e}}l Clifford and
Allyx Fontaine and
Ely Porat and
Benjamin Sach and
Tatiana Starikovskaya},
editor = {Robert Krauthgamer},
title = {The \emph{k}-mismatch problem revisited},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {2039--2052},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch142},
doi = {10.1137/1.9781611974331.CH142},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/CliffordFPSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/CliffordFSV16,
author = {Rapha{\"{e}}l Clifford and
Allyx Fontaine and
Tatiana Starikovskaya and
Hjalte Wedel Vildh{\o}j},
editor = {Shunsuke Inenaga and
Kunihiko Sadakane and
Tetsuya Sakai},
title = {Dynamic and Approximate Pattern Matching in 2D},
booktitle = {String Processing and Information Retrieval - 23rd International Symposium,
{SPIRE} 2016, Beppu, Japan, October 18-20, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9954},
pages = {133--144},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-46049-9\_13},
doi = {10.1007/978-3-319-46049-9\_13},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/CliffordFSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordS16,
author = {Rapha{\"{e}}l Clifford and
Tatiana Starikovskaya},
title = {Approximate Hamming distance in a stream},
journal = {CoRR},
volume = {abs/1602.07241},
year = {2016},
url = {http://arxiv.org/abs/1602.07241},
eprinttype = {arXiv},
eprint = {1602.07241},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CliffordS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CliffordFPSS15,
author = {Rapha{\"{e}}l Clifford and
Allyx Fontaine and
Ely Porat and
Benjamin Sach and
Tatiana Starikovskaya},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Dictionary Matching in a Stream},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {361--372},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_31},
doi = {10.1007/978-3-662-48350-3\_31},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/CliffordFPSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CliffordGL15,
author = {Rapha{\"{e}}l Clifford and
Allan Gr{\o}nlund and
Kasper Green Larsen},
editor = {Venkatesan Guruswami},
title = {New Unconditional Hardness Results for Dynamic and Online Problems},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1089--1107},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.71},
doi = {10.1109/FOCS.2015.71},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CliffordGL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CliffordJS15,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Benjamin Sach},
editor = {Piotr Indyk},
title = {Cell-probe bounds for online edit distance and other pattern matching
problems},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {552--561},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.37},
doi = {10.1137/1.9781611973730.37},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/CliffordJS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordJS15,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Benjamin Sach},
title = {The complexity of computation in bit streams},
journal = {CoRR},
volume = {abs/1504.00834},
year = {2015},
url = {http://arxiv.org/abs/1504.00834},
eprinttype = {arXiv},
eprint = {1504.00834},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CliffordJS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordJL15,
author = {Rapha{\"{e}}l Clifford and
Allan Gr{\o}nlund J{\o}rgensen and
Kasper Green Larsen},
title = {New Unconditional Hardness Results for Dynamic and Online Problems},
journal = {CoRR},
volume = {abs/1504.01836},
year = {2015},
url = {http://arxiv.org/abs/1504.01836},
eprinttype = {arXiv},
eprint = {1504.01836},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CliffordJL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordFPSS15,
author = {Rapha{\"{e}}l Clifford and
Allyx Fontaine and
Ely Porat and
Benjamin Sach and
Tatiana Starikovskaya},
title = {Dictionary matching in a stream},
journal = {CoRR},
volume = {abs/1504.06242},
year = {2015},
url = {http://arxiv.org/abs/1504.06242},
eprinttype = {arXiv},
eprint = {1504.06242},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CliffordFPSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordFPSS15a,
author = {Rapha{\"{e}}l Clifford and
Allyx Fontaine and
Ely Porat and
Benjamin Sach and
Tatiana Starikovskaya},
title = {The k-mismatch problem revisited},
journal = {CoRR},
volume = {abs/1508.00731},
year = {2015},
url = {http://arxiv.org/abs/1508.00731},
eprinttype = {arXiv},
eprint = {1508.00731},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CliffordFPSS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordJS14,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Benjamin Sach},
title = {Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching
Problems},
journal = {CoRR},
volume = {abs/1407.6559},
year = {2014},
url = {http://arxiv.org/abs/1407.6559},
eprinttype = {arXiv},
eprint = {1407.6559},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CliffordJS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordJS14a,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Benjamin Sach},
title = {Time Bounds for Streaming Problems},
journal = {CoRR},
volume = {abs/1412.6935},
year = {2014},
url = {http://arxiv.org/abs/1412.6935},
eprinttype = {arXiv},
eprint = {1412.6935},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CliffordJS14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ButmanCCJLPPS13,
author = {Ayelet Butman and
Peter Clifford and
Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Noa Lewenstein and
Benny Porat and
Ely Porat and
Benjamin Sach},
title = {Pattern Matching under Polynomial Transformation},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {2},
pages = {611--633},
year = {2013},
url = {https://doi.org/10.1137/110853327},
doi = {10.1137/110853327},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ButmanCCJLPPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CliffordJPS13,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Ely Porat and
Benjamin Sach},
title = {Space lower bounds for online pattern matching},
journal = {Theor. Comput. Sci.},
volume = {483},
pages = {68--74},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.06.012},
doi = {10.1016/J.TCS.2012.06.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CliffordJPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeameCM13,
author = {Paul Beame and
Rapha{\"{e}}l Clifford and
Widad Machmouchi},
title = {Element Distinctness, Frequency Moments, and Sliding Windows},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {290--299},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.39},
doi = {10.1109/FOCS.2013.39},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BeameCM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CliffordJS13,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Benjamin Sach},
editor = {Sanjeev Khanna},
title = {Tight Cell-Probe Bounds for Online Hamming Distance Computation},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {664--674},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.48},
doi = {10.1137/1.9781611973105.48},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/CliffordJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeameCM13,
author = {Paul Beame and
Rapha{\"{e}}l Clifford and
Widad Machmouchi},
title = {Element Distinctness, Frequency Moments, and Sliding Windows},
journal = {CoRR},
volume = {abs/1309.3690},
year = {2013},
url = {http://arxiv.org/abs/1309.3690},
eprinttype = {arXiv},
eprint = {1309.3690},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BeameCM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeameCM13,
author = {Paul Beame and
Rapha{\"{e}}l Clifford and
Widad Machmouchi},
title = {Element Distinctness, Frequency Moments, and Sliding Windows},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-127}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/127},
eprinttype = {ECCC},
eprint = {TR13-127},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeameCM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/CliffordEPPR12,
author = {Rapha{\"{e}}l Clifford and
Klim Efremenko and
Benny Porat and
Ely Porat and
Amir Rothschild},
title = {Mismatch sampling},
journal = {Inf. Comput.},
volume = {214},
pages = {112--118},
year = {2012},
url = {https://doi.org/10.1016/j.ic.2012.02.007},
doi = {10.1016/J.IC.2012.02.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/CliffordEPPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CliffordJMS12,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Ashley Montanaro and
Benjamin Sach},
title = {The Complexity of Flood Filling Games},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {72--92},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9339-2},
doi = {10.1007/S00224-011-9339-2},
timestamp = {Sat, 24 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/CliffordJMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordJPS12,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Ely Porat and
Benjamin Sach},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jens Stoye},
title = {Pattern Matching in Multiple Streams},
booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
Helsinki, Finland, July 3-5, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7354},
pages = {97--109},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31265-6\_8},
doi = {10.1007/978-3-642-31265-6\_8},
timestamp = {Tue, 21 Mar 2023 21:02:12 +0100},
biburl = {https://dblp.org/rec/conf/cpm/CliffordJPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-3470,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Ely Porat and
Benjamin Sach},
title = {Pattern Matching in Multiple Streams},
journal = {CoRR},
volume = {abs/1202.3470},
year = {2012},
url = {http://arxiv.org/abs/1202.3470},
eprinttype = {arXiv},
eprint = {1202.3470},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-3470.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-1885,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Benjamin Sach},
title = {Tight Cell-Probe Bounds for Online Hamming Distance Computation},
journal = {CoRR},
volume = {abs/1207.1885},
year = {2012},
url = {http://arxiv.org/abs/1207.1885},
eprinttype = {arXiv},
eprint = {1207.1885},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-1885.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-4372,
author = {Paul Beame and
Rapha{\"{e}}l Clifford and
Widad Machmouchi},
title = {Sliding Windows with Limited Storage},
journal = {CoRR},
volume = {abs/1212.4372},
year = {2012},
url = {http://arxiv.org/abs/1212.4372},
eprinttype = {arXiv},
eprint = {1212.4372},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-4372.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeameCM12,
author = {Paul Beame and
Rapha{\"{e}}l Clifford and
Widad Machmouchi},
title = {Sliding Windows With Limited Storage},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-178}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/178},
eprinttype = {ECCC},
eprint = {TR12-178},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeameCM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/CliffordEPP11,
author = {Rapha{\"{e}}l Clifford and
Klim Efremenko and
Benny Porat and
Ely Porat},
title = {A black box for online approximate pattern matching},
journal = {Inf. Comput.},
volume = {209},
number = {4},
pages = {731--736},
year = {2011},
url = {https://doi.org/10.1016/j.ic.2010.12.007},
doi = {10.1016/J.IC.2010.12.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/CliffordEPP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CliffordP11,
author = {Rapha{\"{e}}l Clifford and
Alexandru Popa},
title = {Maximum subset intersection},
journal = {Inf. Process. Lett.},
volume = {111},
number = {7},
pages = {323--325},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.003},
doi = {10.1016/J.IPL.2010.12.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CliffordP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CliffordS11,
author = {Rapha{\"{e}}l Clifford and
Benjamin Sach},
title = {Pattern matching in pseudo real-time},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {67--81},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.09.005},
doi = {10.1016/J.JDA.2010.09.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CliffordS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordJPS11,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Ely Porat and
Benjamin Sach},
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {Space Lower Bounds for Online Pattern Matching},
booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
Palermo, Italy, June 27-29, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6661},
pages = {184--196},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21458-5\_17},
doi = {10.1007/978-3-642-21458-5\_17},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CliffordJPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordGLP11,
author = {Rapha{\"{e}}l Clifford and
Zvi Gotthilf and
Moshe Lewenstein and
Alexandru Popa},
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {Restricted Common Superstring and Restricted Common Supersequence},
booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
Palermo, Italy, June 27-29, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6661},
pages = {467--478},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21458-5\_39},
doi = {10.1007/978-3-642-21458-5\_39},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CliffordGLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CliffordJ11,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Lower Bounds for Online Integer Multiplication and Convolution in
the Cell-Probe Model},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {593--604},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_50},
doi = {10.1007/978-3-642-22006-7\_50},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CliffordJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-0768,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius},
title = {Lower Bounds for Online Integer Multiplication and Convolution in
the Cell-Probe Model},
journal = {CoRR},
volume = {abs/1101.0768},
year = {2011},
url = {http://arxiv.org/abs/1101.0768},
eprinttype = {arXiv},
eprint = {1101.0768},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1101-0768.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-4412,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Ely Porat and
Benjamin Sach},
title = {Space Lower Bounds for Online Pattern Matching},
journal = {CoRR},
volume = {abs/1106.4412},
year = {2011},
url = {http://arxiv.org/abs/1106.4412},
eprinttype = {arXiv},
eprint = {1106.4412},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-4412.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-1494,
author = {Ayelet Butman and
Peter Clifford and
Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Noa Lewenstein and
Benny Porat and
Ely Porat and
Benjamin Sach},
title = {Pattern Matching under Polynomial Transformation},
journal = {CoRR},
volume = {abs/1109.1494},
year = {2011},
url = {http://arxiv.org/abs/1109.1494},
eprinttype = {arXiv},
eprint = {1109.1494},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-1494.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-5269,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Benjamin Sach},
title = {Streaming Pattern Matching with Relabelling},
journal = {CoRR},
volume = {abs/1109.5269},
year = {2011},
url = {http://arxiv.org/abs/1109.5269},
eprinttype = {arXiv},
eprint = {1109.5269},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-5269.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CliffordS10,
author = {Rapha{\"{e}}l Clifford and
Benjamin Sach},
title = {Permuted function matching},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {1012--1015},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.017},
doi = {10.1016/J.IPL.2010.08.017},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CliffordS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CliffordP10,
author = {Rapha{\"{e}}l Clifford and
Ely Porat},
title = {A filtering algorithm for k-mismatch with don't cares},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {1021--1025},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.012},
doi = {10.1016/J.IPL.2010.08.012},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CliffordP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CliffordEPR10,
author = {Rapha{\"{e}}l Clifford and
Klim Efremenko and
Ely Porat and
Amir Rothschild},
title = {Pattern matching with don't cares and few errors},
journal = {J. Comput. Syst. Sci.},
volume = {76},
number = {2},
pages = {115--124},
year = {2010},
url = {https://doi.org/10.1016/j.jcss.2009.06.002},
doi = {10.1016/J.JCSS.2009.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/CliffordEPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordS10,
author = {Rapha{\"{e}}l Clifford and
Benjamin Sach},
editor = {Amihood Amir and
Laxmi Parida},
title = {Pseudo-realtime Pattern Matching: Closing the Gap},
booktitle = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010,
New York, NY, USA, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6129},
pages = {101--111},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13509-5\_10},
doi = {10.1007/978-3-642-13509-5\_10},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CliffordS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/ArthurCJMS10,
author = {David Arthur and
Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Ashley Montanaro and
Benjamin Sach},
editor = {Paolo Boldi and
Luisa Gargano},
title = {The Complexity of Flood Filling Games},
booktitle = {Fun with Algorithms, 5th International Conference, {FUN} 2010, Ischia,
Italy, June 2-4, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6099},
pages = {307--318},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13122-6\_30},
doi = {10.1007/978-3-642-13122-6\_30},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/ArthurCJMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/CliffordP10,
author = {Rapha{\"{e}}l Clifford and
Alexandru Popa},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {(In)approximability Results for Pattern Matching Problems},
booktitle = {Proceedings of the Prague Stringology Conference 2010, Prague, Czech
Republic, August 30 - September 1, 2010},
pages = {52--62},
publisher = {Prague Stringology Club, Department of Theoretical Computer Science,
Faculty of Information Technology, Czech Technical University in Prague},
year = {2010},
url = {http://www.stringology.org/event/2010/p05.html},
timestamp = {Wed, 10 Feb 2021 08:42:22 +0100},
biburl = {https://dblp.org/rec/conf/stringology/CliffordP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-4420,
author = {David Arthur and
Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Ashley Montanaro and
Benjamin Sach},
title = {The Complexity of Flood Filling Games},
journal = {CoRR},
volume = {abs/1001.4420},
year = {2010},
url = {http://arxiv.org/abs/1001.4420},
eprinttype = {arXiv},
eprint = {1001.4420},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-4420.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-0424,
author = {Rapha{\"{e}}l Clifford and
Zvi Gotthilf and
Moshe Lewenstein and
Alexandru Popa},
title = {Permuted Common Supersequence},
journal = {CoRR},
volume = {abs/1004.0424},
year = {2010},
url = {http://arxiv.org/abs/1004.0424},
eprinttype = {arXiv},
eprint = {1004.0424},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-0424.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordS09,
author = {Rapha{\"{e}}l Clifford and
Benjamin Sach},
editor = {Gregory Kucherov and
Esko Ukkonen},
title = {Online Approximate Matching with Non-local Distances},
booktitle = {Combinatorial Pattern Matching, 20th Annual Symposium, {CPM} 2009,
Lille, France, June 22-24, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5577},
pages = {142--153},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02441-2\_13},
doi = {10.1007/978-3-642-02441-2\_13},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CliffordS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CliffordEPR09,
author = {Rapha{\"{e}}l Clifford and
Klim Efremenko and
Ely Porat and
Amir Rothschild},
editor = {Claire Mathieu},
title = {From coding theory to efficient pattern matching},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {778--784},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.85},
doi = {10.1137/1.9781611973068.85},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/CliffordEPR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/CliffordHPS09,
author = {Rapha{\"{e}}l Clifford and
Aram W. Harrow and
Alexandru Popa and
Benjamin Sach},
editor = {Jussi Karlgren and
Jorma Tarhio and
Heikki Hyyr{\"{o}}},
title = {Generalised Matching},
booktitle = {String Processing and Information Retrieval, 16th International Symposium,
{SPIRE} 2009, Saariselk{\"{a}}, Finland, August 25-27, 2009,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5721},
pages = {295--301},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03784-9\_29},
doi = {10.1007/978-3-642-03784-9\_29},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/CliffordHPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/CliffordEPR09,
author = {Rapha{\"{e}}l Clifford and
Klim Efremenko and
Ely Porat and
Amir Rothschild},
editor = {Rudolf Ahlswede and
Ferdinando Cicalese and
Ugo Vaccaro},
title = {Pattern matching with don't cares and few errors},
booktitle = {Search Methodologies, 05.07. - 10.07.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09281},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2009/2244/},
timestamp = {Thu, 10 Jun 2021 13:02:11 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/CliffordEPR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BenderCT08,
author = {Michael A. Bender and
Rapha{\"{e}}l Clifford and
Kostas Tsichlas},
title = {Scheduling algorithms for procrastinators},
journal = {J. Sched.},
volume = {11},
number = {2},
pages = {95--104},
year = {2008},
url = {https://doi.org/10.1007/s10951-007-0038-4},
doi = {10.1007/S10951-007-0038-4},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BenderCT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordEPP08,
author = {Rapha{\"{e}}l Clifford and
Klim Efremenko and
Benny Porat and
Ely Porat},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {A Black Box for Online Approximate Pattern Matching},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {143--151},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_15},
doi = {10.1007/978-3-540-69068-9\_15},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CliffordEPP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/CliffordEPPR08,
author = {Rapha{\"{e}}l Clifford and
Klim Efremenko and
Benny Porat and
Ely Porat and
Amir Rothschild},
editor = {Amihood Amir and
Andrew Turpin and
Alistair Moffat},
title = {Mismatch Sampling},
booktitle = {String Processing and Information Retrieval, 15th International Symposium,
{SPIRE} 2008, Melbourne, Australia, November 10-12, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5280},
pages = {99--108},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-89097-3\_11},
doi = {10.1007/978-3-540-89097-3\_11},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/CliffordEPPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-1026,
author = {Benjamin Sach and
Rapha{\"{e}}l Clifford},
title = {An Empirical Study of Cache-Oblivious Priority Queues and their Application
to the Shortest Path Problem},
journal = {CoRR},
volume = {abs/0802.1026},
year = {2008},
url = {http://arxiv.org/abs/0802.1026},
eprinttype = {arXiv},
eprint = {0802.1026},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-1026.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CliffordC07,
author = {Peter Clifford and
Rapha{\"{e}}l Clifford},
title = {Simple deterministic wildcard matching},
journal = {Inf. Process. Lett.},
volume = {101},
number = {2},
pages = {53--54},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2006.08.002},
doi = {10.1016/J.IPL.2006.08.002},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CliffordC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordC07,
author = {Peter Clifford and
Rapha{\"{e}}l Clifford},
editor = {Bin Ma and
Kaizhong Zhang},
title = {Self-normalised Distance with Don't Cares},
booktitle = {Combinatorial Pattern Matching, 18th Annual Symposium, {CPM} 2007,
London, Canada, July 9-11, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4580},
pages = {63--70},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73437-6\_9},
doi = {10.1007/978-3-540-73437-6\_9},
timestamp = {Mon, 13 Mar 2023 16:58:28 +0100},
biburl = {https://dblp.org/rec/conf/cpm/CliffordC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CliffordEPR07,
author = {Rapha{\"{e}}l Clifford and
Klim Efremenko and
Ely Porat and
Amir Rothschild},
editor = {Lars Arge and
Michael Hoffmann and
Emo Welzl},
title = {\emph{k} -Mismatch with Don't Cares},
booktitle = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
October 8-10, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4698},
pages = {151--162},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75520-3\_15},
doi = {10.1007/978-3-540-75520-3\_15},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/CliffordEPR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/CliffordS07,
author = {Rapha{\"{e}}l Clifford and
Benjamin Sach},
editor = {Jan van Leeuwen and
Giuseppe F. Italiano and
Wiebe van der Hoek and
Christoph Meinel and
Harald Sack and
Frantisek Pl{\'{a}}sil},
title = {Fast Approximate Point Set Matching for Information Retrieval},
booktitle = {{SOFSEM} 2007: Theory and Practice of Computer Science, 33rd Conference
on Current Trends in Theory and Practice of Computer Science, Harrachov,
Czech Republic, January 20-26, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4362},
pages = {212--223},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-69507-3\_17},
doi = {10.1007/978-3-540-69507-3\_17},
timestamp = {Fri, 21 Oct 2022 16:47:28 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/CliffordS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/CliffordP07,
author = {Rapha{\"{e}}l Clifford and
Ely Porat},
editor = {Nivio Ziviani and
Ricardo A. Baeza{-}Yates},
title = {A Filtering Algorithm for \emph{k} -Mismatch with Don't Cares},
booktitle = {String Processing and Information Retrieval, 14th International Symposium,
{SPIRE} 2007, Santiago, Chile, October 29-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4726},
pages = {130--136},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75530-2\_12},
doi = {10.1007/978-3-540-75530-2\_12},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/CliffordP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccsa/LeeCK06,
author = {Inbok Lee and
Rapha{\"{e}}l Clifford and
Sung{-}Ryul Kim},
editor = {Marina L. Gavrilova and
Osvaldo Gervasi and
Vipin Kumar and
Chih Jeng Kenneth Tan and
David Taniar and
Antonio Lagan{\`{a}} and
Youngsong Mun and
Hyunseung Choo},
title = {Algorithms on Extended (\emph{delta}, \emph{gamma})-Matching},
booktitle = {Computational Science and Its Applications - {ICCSA} 2006, International
Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {3982},
pages = {1137--1142},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11751595\_119},
doi = {10.1007/11751595\_119},
timestamp = {Thu, 28 Apr 2022 16:17:38 +0200},
biburl = {https://dblp.org/rec/conf/iccsa/LeeCK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismir/CliffordCCMW06,
author = {Rapha{\"{e}}l Clifford and
Manolis Christodoulakis and
Tim Crawford and
David Meredith and
Geraint A. Wiggins},
title = {A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level
Music Retrieval},
booktitle = {{ISMIR} 2006, 7th International Conference on Music Information Retrieval,
Victoria, Canada, 8-12 October 2006, Proceedings},
pages = {150--155},
year = {2006},
timestamp = {Mon, 26 Sep 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ismir/CliffordCCMW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0606067,
author = {Michael A. Bender and
Rapha{\"{e}}l Clifford and
Kostas Tsichlas},
title = {Scheduling Algorithms for Procrastinators},
journal = {CoRR},
volume = {abs/cs/0606067},
year = {2006},
url = {http://arxiv.org/abs/cs/0606067},
eprinttype = {arXiv},
eprint = {cs/0606067},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0606067.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Clifford05,
author = {Rapha{\"{e}}l Clifford},
title = {Distributed suffix trees},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {176--197},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.004},
doi = {10.1016/J.JDA.2004.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Clifford05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordCI05,
author = {Peter Clifford and
Rapha{\"{e}}l Clifford and
Costas S. Iliopoulos},
editor = {Alberto Apostolico and
Maxime Crochemore and
Kunsoo Park},
title = {Faster Algorithms for delta, gamma-Matching and Related Problems},
booktitle = {Combinatorial Pattern Matching, 16th Annual Symposium, {CPM} 2005,
Jeju Island, Korea, June 19-22, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3537},
pages = {68--78},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496656\_7},
doi = {10.1007/11496656\_7},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CliffordCI05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/ArdilaCM05,
author = {Yoan Jos{\'{e}} Pinz{\'{o}}n Ardila and
Rapha{\"{e}}l Clifford and
Manal Mohamed},
editor = {Mariano P. Consens and
Gonzalo Navarro},
title = {Necklace Swap Problem for Rhythmic Similarity Measures},
booktitle = {String Processing and Information Retrieval, 12th International Conference,
{SPIRE} 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3772},
pages = {234--245},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11575832\_27},
doi = {10.1007/11575832\_27},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/spire/ArdilaCM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/soco/CliffordI04,
author = {Rapha{\"{e}}l Clifford and
Costas S. Iliopoulos},
title = {Approximate string matching for music analysis},
journal = {Soft Comput.},
volume = {8},
number = {9},
pages = {597--603},
year = {2004},
url = {https://doi.org/10.1007/s00500-004-0384-5},
doi = {10.1007/S00500-004-0384-5},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/soco/CliffordI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordS03,
author = {Rapha{\"{e}}l Clifford and
Marek J. Sergot},
editor = {Ricardo A. Baeza{-}Yates and
Edgar Ch{\'{a}}vez and
Maxime Crochemore},
title = {Distributed and Paged Suffix Trees for Large Genetic Databases},
booktitle = {Combinatorial Pattern Matching, 14th Annual Symposium, {CPM} 2003,
Morelia, Michoc{\'{a}}n, Mexico, June 25-27, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2676},
pages = {70--82},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44888-8\_6},
doi = {10.1007/3-540-44888-8\_6},
timestamp = {Sun, 25 Oct 2020 23:06:11 +0100},
biburl = {https://dblp.org/rec/conf/cpm/CliffordS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ethos/Clifford02,
author = {Rapha{\"{e}}l Clifford},
title = {Indexed strings for large scale genomic analysis},
school = {Imperial College London, {UK}},
year = {2002},
url = {https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268368},
timestamp = {Tue, 05 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ethos/Clifford02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/CliffordM00,
author = {Rapha{\"{e}}l Clifford and
Aaron J. Mackey},
title = {Disperse: a simple and efficient approach to parallel database searching},
journal = {Bioinform.},
volume = {16},
number = {6},
pages = {564--565},
year = {2000},
url = {https://doi.org/10.1093/bioinformatics/16.6.564},
doi = {10.1093/BIOINFORMATICS/16.6.564},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/CliffordM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 18:20 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:
