Optimal parallel algorithms for Prefix Matching

DOI10.1007/3-540-58201-0_69zbMath1418.68249OpenAlexW1484724976MaRDI QIDQ4632427

No author found.

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

string matchingsuffix treedictionary matchingstring matching algorithmroot position

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast parallel string prefix-matching
• Tight comparison bounds for the string prefix-matching problem
• Parallel construction of a suffix tree with applications
• On saving space in parallel computation
• An O(n log n) algorithm for finding all repetitions in a string
• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
• Optimal parallel algorithms for string matching
• A Lower Bound for Parallel String Matching
• Fast Pattern Matching in Strings
• Parallel Suffix–Prefix-Matching Algorithm and Applications

This page was built for publication: Optimal parallel algorithms for Prefix Matching