Title of article
Optimal Parallel Searching an Array for Certain Repetitions
Author/Authors
Brimkov، نويسنده , , Valentin E. Brimkov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
12
From page
82
To page
93
Abstract
Repetitive substructures of two-dimensional arrays have been recently defined and studied in an attempt to parallel some of the analogous developments already known for strings. In the present paper we propose an O (log log n) time O(n3 log n) work optimally fast, optimal parallel CRCW-PRAM algorithm for detecting all repetitions of certain type in an n × n array.
Keywords
2D array , Repetition , tandem , optimal parallel algorithm
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2003
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453382
Link To Document