Testing string superprimitivity in parallel
type: Item
instance of: scholarly article
title: Testing string superprimitivity in parallel
zbMATH Open document ID: 0795.68092
DOI: 10.1016/0020-0190(94)90060-4
author: Dany Breslauer
published in: Information Processing Letters
publication date: 1994-04-05T00:00:00Z
full work available at URL: RT-0160.pdf
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 540891
zbMATH Keywords: parallel algorithms
zbMATH Keywords: string matching
zbMATH Keywords: periods
zbMATH Keywords: quasiperiods
zbMATH Keywords: superprimitivity
MaRDI profile type: Publication
OpenAlex ID: W2024070750
cites work: Optimal parallel algorithms for periods, palindromes and squares
cites work: Efficient detection of quasiperiodicities in strings
cites work: Optimal superprimitivity testing for strings
cites work: Recursive Star-Tree Parallel Data Structure
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: An on-line string superprimitivity test
cites work: Fast parallel string prefix-matching
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: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
cites work: Covering a string
cites work: Q3659988
cites work: Efficiency of a Good But Not Linear Set Union Algorithm
Recommended article: Optimal superprimitivity testing for strings
Recommended article: An on-line string superprimitivity test
Recommended article: Efficient parallel algorithms to test square-freeness and factorize strings
Recommended article: Q3601062
Recommended article: Parallel and sequential approximation of shortest superstrings
Recommended article: Q3355232
Recommended article: Optimal parallel detection of squares in strings
Recommended article: Sequential and Parallel Approximation of Shortest Superstrings
Recommended article: On testing consecutive-ones property in parallel
Recommended article: A Lower Bound for Parallel String Matching
description: scientific article; zbMATH DE number 540891