scientific article
From MaRDI portal
Publication:2957901
DOI10.4230/LIPIcs.STACS.2013.400zbMath1354.68306arXiv1109.5269MaRDI QIDQ2957901
Benny Porat, Markus Jalsenius, Benjamin Sach
Publication date: 30 January 2017
Full work available at URL: https://arxiv.org/abs/1109.5269
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Algorithms on strings (68W32)
Related Items (7)
Dictionary Matching in a Stream ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Streaming pattern matching with \(d\) wildcards ⋮ A brief history of parameterized matching problems ⋮ Tight tradeoffs for real-time approximation of longest palindromes in streams ⋮ Real-Time Streaming Multi-Pattern Search for Constant Alphabet
This page was built for publication: