𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal Parallel Searching an Array for Certain Repetitions

✍ Scribed by Valentin E. Brimkov

Book ID
104444357
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
179 KB
Volume
12
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

✦ Synopsis

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(n 3 log n) work optimally fast, optimal parallel CRCW-PRAM algorithm for detecting all repetitions of certain type in an n Γ— n array.

πŸ“œ SIMILAR VOLUMES

Combinatorial constraints on searching f
Combinatorial constraints on searching for optimal real or symmetric linear array excitation distributions
✍ A. Trastoy; J. A. RodrΓ­guez; F. Ares πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 114 KB

Gi¨en a null-filled radiation power pattern to be synthesized by a linear antenna array, optimally realizable excitation distributions satisfying the requirements of being symmetric or in phase can be found by means of a genetic algorithm approach.

An Optimal Parallel Matching Algorithm f
An Optimal Parallel Matching Algorithm for Cographs
✍ R. Lin; S. Olariu πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 865 KB

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an \(n\)-v