A bridging model for parallel computation
Communications of the ACM
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Towards efficiency and portability: programming with the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Improved linear systolic algorithms for substring statistics
Information Processing Letters
Handbook of Theoretical Computer Science
Handbook of Theoretical Computer Science
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
A fast algorithm for finding the positions of all squares in a run-length encoded string
Theoretical Computer Science
| Hi-index | 0.89 |
The paper presents a Coarse-Grained Multicomputer algorithm that solves the problem of detection of repetitions. This algorithm can be implemented in the CGM model with P processors in O(N2/p) in time and O(P) communication steps. It is the first CGM algorithm for this problem. We present also experimental results showing that the CGM algorithm is very efficient.