An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String.

Alberto Apostolico Dany Breslauer

Published in: SIAM J. Comput. (1996)

Keyphrases

parallel algorithm
binary search trees
worst case
parallel computation
dynamic programming
shared memory
parallel programming
parallel version
cluster of workstations
optimal solution
data structure
lower bound
log log
processor array
upper bound
medial axis transform