An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String

An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String (1995)

by Alberto Apostolico , Dany Breslauer

Citations:

11 - 6 self

User correction supplied by mph

Datum	Value	Source
TITLE	An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String	user correction - Legacy Corrections
AUTHOR NAME	Alberto Apostolico	user correction
AUTHOR AFFIL		user correction
AUTHOR NAME	Dany Breslauer	user correction
AUTHOR AFFIL	University of Aarhus	user correction
ABSTRACT	An optimal O(log log n) time concurrent-read concurrent-write parallel algorithm for detecting all squares in a string is presented. A tight lower bound shows that over general alphabets this is the fastest possible optimal algorithm. When p processors are available the bounds become \Theta(d n log n p e + log log d1+p=ne 2p). The algorithm uses an optimal parallel string-matching algorithm together with periodicity properties to locate the squares within the input string.	user correction
YEAR	1995	user correction - Legacy Corrections
CITATIONS	30 found	ParsCit 1.0