Benjamin Sach

Publication Activity (10 Years)

Years Active: 2007-2019
Publications (10 Years): 7

Top Topics

Pattern Matching

Top Venues

Publications

Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Time Bounds for Streaming Problems. Theory Comput. 15 (2019)
Philip Bille, Inge Li Gørtz, Patrick Hagge Cording, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind
Fingerprints in compressed strings. J. Comput. Syst. Sci. 86 (2017)
Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
-mismatch problem revisited. SODA (2016)
Jake Longo, Daniel P. Martin, Luke Mather, Elisabeth Oswald, Benjamin Sach, Martijn Stam
How low can you go? Using side-channel data to enhance brute-force key recovery. IACR Cryptol. ePrint Arch. 2016 (2016)
Matt McVicar, Benjamin Sach, Cédric Mesnage, Jefrey Lijffijt, Eirini Spyropoulou, Tijl De Bie
SuMoTED: An intuitive edit distance between rooted unordered uniquely-labelled trees. Pattern Recognit. Lett. 79 (2016)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Cell-Probe Lower Bounds for Bit Stream Computation. ESA (2016)
Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj
Sparse Text Indexing in Small Space. ACM Trans. Algorithms 12 (3) (2016)
Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
The k-mismatch problem revisited. CoRR (2015)
Pawel Gawrychowski, Gregory Kucherov, Benjamin Sach, Tatiana Starikovskaya
Computing the Longest Unbordered Substring. SPIRE (2015)
Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
Dictionary matching in a stream. CoRR (2015)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
The complexity of computation in bit streams. CoRR (2015)
Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
Dictionary Matching in a Stream. ESA (2015)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Cell-probe bounds for online edit distance and other pattern matching problems. SODA (2015)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Time Bounds for Streaming Problems. CoRR (2014)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems. CoRR (2014)
Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj
Time-space trade-offs for longest common extensions. J. Discrete Algorithms 25 (2014)
Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind
Fingerprints in Compressed Strings CoRR (2013)
Markus Jalsenius, Benny Porat, Benjamin Sach
Parameterized Matching in the Streaming Model. STACS (2013)
Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind
Fingerprints in Compressed Strings. WADS (2013)
Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
Space lower bounds for online pattern matching. Theor. Comput. Sci. 483 (2013)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Tight Cell-Probe Bounds for Online Hamming Distance Computation. SODA (2013)
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) (2013)
Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj
Sparse Suffix Tree Construction in Small Space. ICALP (1) (2013)
Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
The Complexity of Flood Filling Games. Theory Comput. Syst. 50 (1) (2012)
Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
Pattern Matching in Multiple Streams CoRR (2012)
Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj
Time-Space Trade-Offs for Longest Common Extensions. CPM (2012)
Philip Bille, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj
Sparse Suffix Tree Construction with Small Space CoRR (2012)
Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
Pattern Matching in Multiple Streams. CPM (2012)
Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj
Time-Space Trade-Offs for Longest Common Extensions CoRR (2012)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Tight Cell-Probe Bounds for Online Hamming Distance Computation CoRR (2012)
Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
Space Lower Bounds for Online Pattern Matching. CPM (2011)
Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
Space Lower Bounds for Online Pattern Matching CoRR (2011)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Streaming Pattern Matching with Relabelling CoRR (2011)
Raphaël Clifford, Benjamin Sach
Pattern matching in pseudo real-time. J. Discrete Algorithms 9 (1) (2011)
Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach
Pattern Matching under Polynomial Transformation CoRR (2011)
Raphaël Clifford, Benjamin Sach
Permuted function matching. Inf. Process. Lett. 110 (22) (2010)
David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
The Complexity of Flood Filling Games CoRR (2010)
David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
The Complexity of Flood Filling Games. FUN (2010)
Raphaël Clifford, Benjamin Sach
Pseudo-realtime Pattern Matching: Closing the Gap. CPM (2010)
Raphaël Clifford, Aram W. Harrow, Alexandru Popa, Benjamin Sach
Generalised Matching. SPIRE (2009)
Raphaël Clifford, Benjamin Sach
Online Approximate Matching with Non-local Distances. CPM (2009)
Benjamin Sach, Raphaël Clifford
An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem CoRR (2008)
Raphaël Clifford, Benjamin Sach
Fast Approximate Point Set Matching for Information Retrieval. SOFSEM (1) (2007)