A CONSTANT TIME PARALLEL DETECTION OF REPETITIONS
Résumé
Recently Akl and al. introduced a new model of parallel computation, called BSR (broadcasting with selective reduction) and showed that it is more powerful than any CRCW PRAM and yet requires no more resources (asymptotically) for implementation than even EREW PRAM [2,3,4]. The model allows constant time solutions to sorting, parallel prefix and other problems. In this paper, we describe constant time solution to the detection of repetitions (with overlapping) problem using the one criterion BSR model. This is the first constant time solution to this problem on any model of computation. If the problem is only to detect the existence of any repetition then n processors suffice, where n is the length of the string. If all repetitions are to be found then [Formula: see text] processors suffice in our algorithm.