The following pages link to Benjamin Sach (Q390880):
Displaying 21 items.
- Space lower bounds for online pattern matching (Q390881) (← links)
- Pattern matching in pseudo real-time (Q533411) (← links)
- The complexity of flood filling games (Q692938) (← links)
- Permuted function matching (Q1675783) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Pattern matching under polynomial transformation (Q2840986) (← links)
- Pattern Matching in Multiple Streams (Q2904482) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- (Q2957901) (← links)
- Space Lower Bounds for Online Pattern Matching (Q3011853) (← links)
- Dictionary Matching in a Stream (Q3452800) (← links)
- Pseudo-realtime Pattern Matching: Closing the Gap (Q3575240) (← links)
- The <i>k</i>-mismatch problem revisited (Q4575727) (← links)
- Cell-Probe Lower Bounds for Bit Stream Computation (Q4606300) (← links)
- Sparse Text Indexing in Small Space (Q4962616) (← links)
- Time bounds for streaming problems (Q5204820) (← links)
- Sparse Suffix Tree Construction in Small Space (Q5326557) (← links)
- Cell-probe bounds for online edit distance and other pattern matching problems (Q5362986) (← links)
- Fast Approximate Point Set Matching for Information Retrieval (Q5448774) (← links)
- Tight Cell-Probe Bounds for Online Hamming Distance Computation (Q5741756) (← links)