Benjamin Sach
From MaRDI portal
Person:390880
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Time bounds for streaming problems Theory of Computing | 2019-12-05 | Paper |
| Tight Cell-Probe Bounds for Online Hamming Distance Computation Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Sparse text indexing in small space ACM Transactions on Algorithms | 2018-11-05 | Paper |
| The \(k\)-mismatch problem revisited Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Cell-probe lower bounds for bit stream computation | 2018-03-02 | Paper |
| Permuted function matching Information Processing Letters | 2017-11-03 | Paper |
| Cell-probe bounds for online edit distance and other pattern matching problems Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Fingerprints in compressed strings Journal of Computer and System Sciences | 2017-05-26 | Paper |
| scientific article; zbMATH DE number 6678937 (Why is no real title available?) | 2017-01-30 | Paper |
| Dictionary matching in a stream Algorithms - ESA 2015 | 2015-11-19 | Paper |
| Computing the Longest Unbordered Substring | 2015-10-02 | Paper |
| Time-space trade-offs for longest common extensions Journal of Discrete Algorithms | 2014-04-01 | Paper |
| Space lower bounds for online pattern matching Theoretical Computer Science | 2014-01-09 | Paper |
| Fingerprints in compressed strings Lecture Notes in Computer Science | 2013-08-12 | Paper |
| Sparse suffix tree construction in small space Automata, Languages, and Programming | 2013-08-06 | Paper |
| Pattern matching under polynomial transformation SIAM Journal on Computing | 2013-07-24 | Paper |
| The complexity of flood filling games Theory of Computing Systems | 2012-12-06 | Paper |
| Time-Space Trade-Offs for Longest Common Extensions Combinatorial Pattern Matching | 2012-08-14 | Paper |
| Pattern matching in multiple streams Combinatorial Pattern Matching | 2012-08-14 | Paper |
| Space Lower Bounds for Online Pattern Matching Combinatorial Pattern Matching | 2011-06-29 | Paper |
| Pattern matching in pseudo real-time Journal of Discrete Algorithms | 2011-05-03 | Paper |
| Pseudo-realtime pattern matching: closing the gap Combinatorial Pattern Matching | 2010-07-26 | Paper |
| Fast Approximate Point Set Matching for Information Retrieval Lecture Notes in Computer Science | 2008-03-07 | Paper |
Research outcomes over time
This page was built for person: Benjamin Sach
