- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j4 |      | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Space lower bounds for online pattern matching. Theor. Comput. Sci. 483: 68-74 (2013) |
| c10 | | Raphaël Clifford, Markus Jalsenius, Benjamin Sach: Tight Cell-Probe Bounds for Online Hamming Distance Computation. SODA 2013: 664-674 |
| c9 | | Markus Jalsenius, Benny Porat, Benjamin Sach: Parameterized Matching in the Streaming Model. STACS 2013: 400-411 |
| 2012 | ||
| j3 | | Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach: The Complexity of Flood Filling Games. Theory Comput. Syst. 50(1): 72-92 (2012) |
| c8 | | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Pattern Matching in Multiple Streams. CPM 2012: 97-109 |
| c7 | | Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj: Time-Space Trade-Offs for Longest Common Extensions. CPM 2012: 293-305 |
| i9 | | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Pattern Matching in Multiple Streams. CoRR abs/1202.3470 (2012) |
| i8 | | Philip Bille, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj: Sparse Suffix Tree Construction with Small Space. CoRR abs/1207.1135 (2012) |
| i7 | | Raphaël Clifford, Markus Jalsenius, Benjamin Sach: Tight Cell-Probe Bounds for Online Hamming Distance Computation. CoRR abs/1207.1885 (2012) |
| i6 | | Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj: Time-Space Trade-Offs for Longest Common Extensions. CoRR abs/1211.0270 (2012) |
| 2011 | ||
| j2 | | Raphaël Clifford, Benjamin Sach: Pattern matching in pseudo real-time. J. Discrete Algorithms 9(1): 67-81 (2011) |
| c6 | | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Space Lower Bounds for Online Pattern Matching. CPM 2011: 184-196 |
| i5 | | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Space Lower Bounds for Online Pattern Matching. CoRR abs/1106.4412 (2011) |
| i4 | | Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach: Pattern Matching under Polynomial Transformation. CoRR abs/1109.1494 (2011) |
| i3 | | Raphaël Clifford, Markus Jalsenius, Benjamin Sach: Streaming Pattern Matching with Relabelling. CoRR abs/1109.5269 (2011) |
| 2010 | ||
| j1 | | Raphaël Clifford, Benjamin Sach: Permuted function matching. Inf. Process. Lett. 110(22): 1012-1015 (2010) |
| c5 | | Raphaël Clifford, Benjamin Sach: Pseudo-realtime Pattern Matching: Closing the Gap. CPM 2010: 101-111 |
| c4 | | David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach: The Complexity of Flood Filling Games. FUN 2010: 307-318 |
| i2 | | David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach: The Complexity of Flood Filling Games. CoRR abs/1001.4420 (2010) |
| 2009 | ||
| c3 | | Raphaël Clifford, Benjamin Sach: Online Approximate Matching with Non-local Distances. CPM 2009: 142-153 |
| c2 | | Raphaël Clifford, Aram Wettroth Harrow, Alexandru Popa, Benjamin Sach: Generalised Matching. SPIRE 2009: 295-301 |
| 2008 | ||
| i1 | | Benjamin Sach, Raphaël Clifford: An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem. CoRR abs/0802.1026 (2008) |
| 2007 | ||
| c1 | | Raphaël Clifford, Benjamin Sach: Fast Approximate Point Set Matching for Information Retrieval. SOFSEM (1) 2007: 212-223 |
Data released under the ODC-BY 1.0 license — See also our legal information page