Benjamin Sach

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5204820	2019-12-05	Paper
Tight Cell-Probe Bounds for Online Hamming Distance Computation	2019-05-15	Paper
Sparse Text Indexing in Small Space	2018-11-05	Paper
The k-mismatch problem revisited	2018-07-16	Paper
Cell-Probe Lower Bounds for Bit Stream Computation	2018-03-02	Paper
Permuted function matching	2017-11-03	Paper
Cell-probe bounds for online edit distance and other pattern matching problems	2017-10-05	Paper
Fingerprints in compressed strings	2017-05-26	Paper
https://portal.mardi4nfdi.de/entity/Q2957901	2017-01-30	Paper
Dictionary Matching in a Stream	2015-11-19	Paper
Computing the Longest Unbordered Substring	2015-10-02	Paper
Time-space trade-offs for longest common extensions	2014-04-01	Paper
Space lower bounds for online pattern matching	2014-01-09	Paper
Fingerprints in compressed strings	2013-08-12	Paper
Sparse Suffix Tree Construction in Small Space	2013-08-06	Paper
Pattern matching under polynomial transformation	2013-07-24	Paper
The complexity of flood filling games	2012-12-06	Paper
Time-Space Trade-Offs for Longest Common Extensions	2012-08-14	Paper
Pattern Matching in Multiple Streams	2012-08-14	Paper
Space Lower Bounds for Online Pattern Matching	2011-06-29	Paper
Pattern matching in pseudo real-time	2011-05-03	Paper
Pseudo-realtime Pattern Matching: Closing the Gap	2010-07-26	Paper
Fast Approximate Point Set Matching for Information Retrieval	2008-03-07	Paper

This page was built for person: Benjamin Sach