Benjamin Sach
Benjamin Sach
The Alan Turing Institute
Verified email at turing.ac.uk
Title
Cited by
Cited by
Year
The k-mismatch problem revisited
R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya
SODA 2016: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on …, 2016
422016
Time–space trade-offs for longest common extensions
P Bille, IL Gørtz, B Sach, HW Vildhøj
Journal of Discrete Algorithms 25, 42-50, 2014
342014
Dictionary matching in a stream
R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya
ESA 2015: European Symposium on Algorithms, 361-372, 2015
312015
The complexity of flood filling games
R Clifford, M Jalsenius, A Montanaro, B Sach
Theory of Computing Systems 50 (1), 72-92, 2012
262012
Fingerprints in compressed strings
P Bille, PH Cording, IL Gørtz, B Sach, HW Vildhøj, S Vind
WADS 2013: Algorithms and Data Structures Symposium, 146-157, 2013
25*2013
The complexity of flood filling games
D Arthur, R Clifford, M Jalsenius, A Montanaro, B Sach
FUN 2009: Fun with Algorithms, 307-318, 2010
232010
Sparse Text Indexing in Small Space
P Bille, J Fischer, IL Gørtz, T Kopelowitz, B Sach, HW Vildhøj
ACM Transactions on Algorithms, 2016
21*2016
Generalised Matching
R Clifford, AW Harrow, A Popa, B Sach
String Processing and Information Retrieval: 16th International Symposium …, 2009
14*2009
Pseudo-realtime Pattern Matching: Closing the Gap
R Clifford, B Sach
CPM 2010: Combinatorial Pattern Matching, 101, 2010
13*2010
Space lower bounds for online pattern matching
R Clifford, M Jalsenius, E Porat, B Sach
Theoretical Computer Science 483, 68-74, 2013
122013
Time-space trade-offs for longest common extensions
P Bille, IL Gørtz, B Sach, HW Vildhøj
Annual Symposium on Combinatorial Pattern Matching, 293-305, 2012
122012
Pattern matching in pseudo real-time
R Clifford, B Sach
Journal of Discrete Algorithms 9 (1), 67-81, 2011
12*2011
Pattern matching under polynomial transformation
A Butman, P Clifford, R Clifford, M Jalsenius, N Lewenstein, B Porat, ...
SIAM Journal on Computing 42 (2), 611-633, 2013
112013
Cell-probe bounds for online edit distance and other pattern matching problems
R Clifford, M Jalsenius, B Sach
SODA 2015: ACM-SIAM Symposium on Discrete Algorithms, 552-561, 2015
82015
SuMoTED: An intuitive edit distance between rooted unordered uniquely-labelled trees
M McVicar, B Sach, C Mesnage, J Lijffijt, E Spyropoulou, T De Bie
Pattern Recognition Letters 79, 52-59, 2016
72016
Pattern Matching in Multiple Streams.
R Clifford, M Jalsenius, E Porat, B Sach
CPM 2012: Combinatorial Pattern Matching 12, 97-109, 2012
72012
Tight cell-probe bounds for online hamming distance computation
R Clifford, M Jalsenius, B Sach
SODA 2013, 664-674, 2012
62012
Computing the Longest Unbordered Substring
P Gawrychowski, G Kucherov, B Sach, T Starikovskaya
SPIRE 2015: String Processing and Information Retrieval, 246-257, 2015
52015
Permuted function matching
R Clifford, B Sach
Information processing letters 110 (22), 1012-1015, 2010
32010
An empirical study of cache-oblivious priority queues and their application to the shortest path problem
B Sach, R Clifford
Undergraduate Project (arXiv preprint arXiv:0802.1026), 2008
32008
The system can't perform the operation now. Try again later.
Articles 1–20