Следене
Raphael Clifford
Raphael Clifford
Потвърден имейл адрес: cs.bris.ac.uk
Заглавие
Позовавания
Позовавания
Година
Classical boson sampling algorithms with superior performance to near-term experiments
A Neville, C Sparrow, R Clifford, E Johnston, PM Birchall, A Montanaro, ...
Nature Physics 13 (12), 1153-1157, 2017
2002017
The classical complexity of boson sampling
P Clifford, R Clifford
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
1142018
Simple deterministic wildcard matching
P Clifford, R Clifford
Information Processing Letters 101 (2), 53-54, 2007
1052007
The k-mismatch problem revisited
R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
642016
Faster Algorithms for δ,γ-Matching and Related Problems
P Clifford, R Clifford, C Iliopoulos
Annual Symposium on Combinatorial Pattern Matching, 68-78, 2005
522005
Pattern matching with don't cares and few errors
R Clifford, K Efremenko, E Porat, A Rothschild
Journal of Computer and System Sciences 76 (2), 115-124, 2010
512010
A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level Music Retrieval.
R Clifford, M Christodoulakis, T Crawford, D Meredith, GA Wiggins
ISMIR, 150-155, 2006
442006
Approximate string matching for music analysis
R Clifford, C Iliopoulos
Soft Computing 8, 597-603, 2004
432004
From coding theory to efficient pattern matching
R Clifford, K Efremenko, E Porat, A Rothschild
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
412009
k-Mismatch with Don’t Cares
R Clifford, K Efremenko, E Porat, A Rothschild
European Symposium on Algorithms, 151-162, 2007
412007
Dictionary matching in a stream
R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
392015
Distributed and paged suffix trees for large genetic databases
R Clifford, M Sergot
Annual Symposium on Combinatorial Pattern Matching, 70-82, 2003
362003
New unconditional hardness results for dynamic and online problems
RCA Gronlund, A Grønlund, KG Larsen
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1089-1107, 2015
342015
The streaming k-mismatch problem
R Clifford, T Kociumaka, E Porat
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
312019
The complexity of flood filling games
R Clifford, M Jalsenius, A Montanaro, B Sach
Theory of Computing Systems 50 (1), 72-92, 2012
312012
Approximate Hamming distance in a stream
R Clifford, T Starikovskaya
arXiv preprint arXiv:1602.07241, 2016
292016
Element distinctness, frequency moments, and sliding windows
P Beame, R Clifford, W Machmouchi
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 290-299, 2013
272013
The complexity of flood filling games
D Arthur, R Clifford, M Jalsenius, A Montanaro, B Sach
International Conference on Fun with Algorithms, 307-318, 2010
252010
Faster classical boson sampling
P Clifford, R Clifford
arXiv preprint arXiv:2005.04214, 2020
232020
Maximum subset intersection
R Clifford, A Popa
Information Processing Letters 111 (7), 323-325, 2011
232011
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20