Parallel String Matching

DOI10.1007/978-3-319-58943-5_15zbMath1483.68507OpenAlexW2619717514MaRDI QIDQ5862565

Bernhard Scheirle, Martin Tillmann, Kevin Zerr, Philip Pfaffe, Sarah Lutteropp

Publication date: 9 March 2022

Published in: Euro-Par 2016: Parallel Processing Workshops (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000058845/3887876

zbMATH Keywords

string matchingalphabet sizestring matching algorithmparallel random access machinepattern length

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Fast and flexible packed string matching
• Fast exact string matching algorithms
• The exact online string matching problem
• A fast string searching algorithm
• A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
• EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
• Optimal parallel algorithms for string matching
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings
• A constant-time optimal parallel string-matching algorithm
• Fast Packed String Matching for Short Patterns
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• String Processing and Information Retrieval

This page was built for publication: Parallel String Matching