Fast Approximate Point Set Matching for Information Retrieval. - Raphaël Clifford; Benjamin Sach (SOFSEM (1), 2007)

An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem - Benjamin Sach; Raphaël Clifford (CoRR, 2008)

Online Approximate Matching with Non-local Distances. - Raphaël Clifford; Benjamin Sach (CPM, 2009)

Generalised Matching. - Raphaël Clifford; Aram W. Harrow; Alexandru Popa 001; Benjamin Sach (SPIRE, 2009)

Pseudo-realtime Pattern Matching: Closing the Gap. - Raphaël Clifford; Benjamin Sach (CPM, 2010)

The Complexity of Flood Filling Games. - David Arthur; Raphaël Clifford; Markus Jalsenius; Ashley Montanaro; Benjamin Sach (FUN, 2010)

Permuted function matching. - Raphaël Clifford; Benjamin Sach (Inf. Process. Lett., 2010)

Approximate and pseudo real-time pattern matching. - Benjamin Sach (2010)

Streaming Pattern Matching with Relabelling - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (CoRR, 2011)

Pattern matching in pseudo real-time. - Raphaël Clifford; Benjamin Sach (J. Discrete Algorithms, 2011)

Pattern Matching in Multiple Streams. - Raphaël Clifford; Markus Jalsenius; Ely Porat; Benjamin Sach (CPM, 2012)

Sparse Suffix Tree Construction with Small Space - Philip Bille; Inge Li Gørtz; Tsvi Kopelowitz; Benjamin Sach; Hjalte Wedel Vildhøj (CoRR, 2012)

The Complexity of Flood Filling Games. - Raphaël Clifford; Markus Jalsenius; Ashley Montanaro; Benjamin Sach (Theory Comput. Syst., 2012)

Sparse Suffix Tree Construction in Small Space. - Philip Bille; Johannes Fischer 001; Inge Li Gørtz; Tsvi Kopelowitz; Benjamin Sach; Hjalte Wedel Vildhøj (ICALP (1), 2013)

Tight Cell-Probe Bounds for Online Hamming Distance Computation. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (SODA, 2013)

Parameterized Matching in the Streaming Model. - Markus Jalsenius; Benny Porat; Benjamin Sach (STACS, 2013)

Pattern Matching under Polynomial Transformation. - Ayelet Butman; Peter Clifford; Raphaël Clifford; Markus Jalsenius; Noa Lewenstein; Benny Porat; Ely Porat; Benjamin Sach (SIAM J. Comput., 2013)

Space lower bounds for online pattern matching. - Raphaël Clifford; Markus Jalsenius; Ely Porat; Benjamin Sach (Theor. Comput. Sci., 2013)

Time-space trade-offs for longest common extensions. - Philip Bille; Inge Li Gørtz; Benjamin Sach; Hjalte Wedel Vildhøj (J. Discrete Algorithms, 2014)

Dictionary Matching in a Stream. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (ESA, 2015)

Cell-probe bounds for online edit distance and other pattern matching problems. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (SODA, 2015)

Computing the Longest Unbordered Substring. - Pawel Gawrychowski; Gregory Kucherov; Benjamin Sach; Tatiana Starikovskaya (SPIRE, 2015)

The k-mismatch problem revisited. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (CoRR, 2015)

The complexity of computation in bit streams. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (CoRR, 2015)

Cell-Probe Lower Bounds for Bit Stream Computation. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (ESA, 2016)

The k-mismatch problem revisited. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (SODA, 2016)

How low can you go? Using side-channel data to enhance brute-force key recovery. - Jake Longo; Daniel P. Martin 001; Luke Mather; Elisabeth Oswald; Benjamin Sach; Martijn Stam (IACR Cryptol. ePrint Arch., 2016)

SuMoTED: An intuitive edit distance between rooted unordered uniquely-labelled trees. - Matt McVicar; Benjamin Sach; Cédric Mesnage; Jefrey Lijffijt; Eirini Spyropoulou; Tijl De Bie (Pattern Recognit. Lett., 2016)

Sparse Text Indexing in Small Space. - Philip Bille; Johannes Fischer 001; Inge Li Gørtz; Tsvi Kopelowitz; Benjamin Sach; Hjalte Wedel Vildhøj (ACM Trans. Algorithms, 2016)

Fingerprints in compressed strings. - Philip Bille; Inge Li Gørtz; Patrick Hagge Cording; Benjamin Sach; Hjalte Wedel Vildhøj; Søren Vind (J. Comput. Syst. Sci., 2017)

Time Bounds for Streaming Problems. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (Theory Comput., 2019)