Parallel string matching with variable length don't cares
From MaRDI portal
Publication:1344536
DOI10.1006/jpdc.1994.1083zbMath0939.68945OpenAlexW1976043380MaRDI QIDQ1344536
Alan A. Bertossi, Filippo Logi
Publication date: 6 July 2000
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.1994.1083
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)
Related Items (2)
Matching a set of strings with variable length don't cares ⋮ Multi-pattern matching algorithm with wildcards based on bit-parallelism
This page was built for publication: Parallel string matching with variable length don't cares