Finding all periods and initial palindromes of a string in parallel
type: Item
instance of: scholarly article
title: Finding all periods and initial palindromes of a string in parallel
zbMATH Open document ID: 0833.68053
DOI: 10.1007/BF01294132
author: Zvi Galil
author: Dany Breslauer
published in: Algorithmica
publication date: 1996-03-11T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 803320
zbMATH Keywords: CRCW-PRAM algorithm
MaRDI profile type: Publication
cites work: An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String
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: 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: Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
cites work: Optimal parallel algorithms for string matching
cites work: Q3862379
cites work: Q4125823
cites work: Parallel Suffix–Prefix-Matching Algorithm and Applications
cites work: Fast Pattern Matching in Strings
cites work: Q3659988
cites work: The equation \(a_ M=b^ Nc^ P\) in a free group
cites work: A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
cites work: Parallelism in Comparison Problems
cites work: Optimal parallel pattern matching in strings
full work available at URL: https://doi.org/10.1007/bf01294132
OpenAlex ID: W2244342551
description: scientific article; zbMATH DE number 803320