default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Sach
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j10]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Time Bounds for Streaming Problems. Theory Comput. 15: 1-31 (2019)- 2017
- [j9]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: 171-180 (2017) - 2016
- [j8]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: 52-59 (2016) - [j7]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): 39:1-39:19 (2016) - [c17]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Cell-Probe Lower Bounds for Bit Stream Computation. ESA 2016: 31:1-31:15 - [c16]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
The k-mismatch problem revisited. SODA 2016: 2039-2052 - [i16]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: 609 (2016) - 2015
- [c15]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
Dictionary Matching in a Stream. ESA 2015: 361-372 - [c14]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Cell-probe bounds for online edit distance and other pattern matching problems. SODA 2015: 552-561 - [c13]Pawel Gawrychowski, Gregory Kucherov, Benjamin Sach, Tatiana Starikovskaya:
Computing the Longest Unbordered Substring. SPIRE 2015: 246-257 - [i15]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
The complexity of computation in bit streams. CoRR abs/1504.00834 (2015) - [i14]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
Dictionary matching in a stream. CoRR abs/1504.06242 (2015) - [i13]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
The k-mismatch problem revisited. CoRR abs/1508.00731 (2015) - 2014
- [j6]Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj:
Time-space trade-offs for longest common extensions. J. Discrete Algorithms 25: 42-50 (2014) - [i12]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems. CoRR abs/1407.6559 (2014) - [i11]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Time Bounds for Streaming Problems. CoRR abs/1412.6935 (2014) - 2013
- [j5]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): 611-633 (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) - [c12]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: 148-159 - [c11]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Tight Cell-Probe Bounds for Online Hamming Distance Computation. SODA 2013: 664-674 - [c10]Markus Jalsenius, Benny Porat, Benjamin Sach:
Parameterized Matching in the Streaming Model. STACS 2013: 400-411 - [c9]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind:
Fingerprints in Compressed Strings. WADS 2013: 146-157 - [i10]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind:
Fingerprints in Compressed Strings. CoRR abs/1305.2777 (2013) - 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
- [b1]Benjamin Sach:
Approximate and pseudo real-time pattern matching. University of Bristol, UK, 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)
2000 – 2009
- 2009
- [c3]Raphaël Clifford, Benjamin Sach:
Online Approximate Matching with Non-local Distances. CPM 2009: 142-153 - [c2]Raphaël Clifford, Aram W. 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
