Fast parallel string prefix-matching
type: Item
instance of: scholarly article
title: Fast parallel string prefix-matching
zbMATH Open document ID: 0873.68072
DOI: 10.1016/0304-3975(94)00177-K
author: Dany Breslauer
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 986074
MaRDI profile type: Publication
cites work: An Alphabet Independent Approach to Two-Dimensional Pattern Matching
cites work: Optimal parallel algorithms for periods, palindromes and squares
cites work: Q4942631
cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: Efficient string matching on packed texts
cites work: Testing string superprimitivity in parallel
cites work: An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
cites work: A Lower Bound for Parallel String Matching
cites work: Finding all periods and initial palindromes of a string in parallel
cites work: Optimal parallel algorithms for string matching
cites work: Q4230346
cites work: Fast Pattern Matching in Strings
cites work: The equation \(a_ M=b^ Nc^ P\) in a free group
cites work: An O(n log n) algorithm for finding all repetitions in a string
cites work: Finding the maximum, merging, and sorting in a parallel computation model
Recommended article: Fast parallel and serial approximate string matching
Recommended article: Parallel String Matching Algorithms
Recommended article: Q4858435
Recommended article: Q4737701
Recommended article: Fast prefix matching of bounded strings
Recommended article: Optimal parallel algorithms for Prefix Matching
Recommended article: Optimal parallel algorithms for string matching
Recommended article: Q3687751
Recommended article: Optimal parallel pattern matching in strings
Recommended article: Parallel Suffix–Prefix-Matching Algorithm and Applications
description: scientific article; zbMATH DE number 986074