Benjamin Sach - RankMe

44 papers A* 3A 3B 6C 2Misc 1Journal 26Unranked 2

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