Optimal parallel algorithms for prefix matching

DOI10.1007/3-540-58201-0_69MaRDI QIDQ4632427zbMATH OpenOpenAlexFDO

Authors

Publication date 29 April 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58201-0_69

zbMATH Keywords

dictionary matchingroot positionstring matchingstring matching algorithmsuffix tree

Mathematics Subject Classification ID

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

Recommendations

• Parallel Suffix–Prefix-Matching Algorithm and Applications
• Fast parallel string prefix-matching
• scientific article; zbMATH DE number 826061
• Faster Parallel String Matching via Larger Deterministic Samples
• Optimal parallel pattern matching in strings

Cites work

• A Lower Bound for Parallel String Matching
• An O(n log n) algorithm for finding all repetitions in a string
• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
• Fast parallel string prefix-matching
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 437523 (Why is no real title available?)
• scientific article; zbMATH DE number 177853 (Why is no real title available?)
• scientific article; zbMATH DE number 3551946 (Why is no real title available?)
• On saving space in parallel computation
• Optimal parallel algorithms for string matching
• Parallel construction of a suffix tree with applications
• Parallel Suffix–Prefix-Matching Algorithm and Applications
• Tight comparison bounds for the string prefix-matching problem

Cited in

(8)

• Optimal parallel algorithms for forest and term matching
• Parallel computation for the all-pairs suffix-prefix problem
• Faster optimal parallel prefix sums and list ranking
• Processor efficient parallel matching
• scientific article; zbMATH DE number 1307000 (Why is no real title available?)
• scientific article; zbMATH DE number 2166160 (Why is no real title available?)
• Parallel Suffix–Prefix-Matching Algorithm and Applications
• Fast parallel string prefix-matching

This page was built for publication: Optimal parallel algorithms for prefix matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632427)