Summary: A reconfigurable array of processors (RAP) is defined to be an array of processors connected to a reconfigurable bus system whose configuration can be dynamically changed. For an \(n\times n\) image and \(m\times m\) template, a constant time algorithm for template matching is proposed on a RAP with \(m \times m \times n \times n \times n\) processors when the domain of the image and the template is Boolean. Even if the domain is integer and each integer is bounded and represented by a \(q\)-bits binary sequence, a constant or \(O(\log^*m)\) time algorithm is still obtained. The number of processors needed is increased to \(2qm^ 2 \times 2qm^ 2 \times \max\{m,n\} \times n\times n\) and \(m^ 2 \times m^ 2 \times \max\{m^ 2,n\} \times n \times n\), respectively. An \(O(\log m)\) time algorithm also derived for the domain is integer or real but the number of processors is reduced to \(m\times m \times n \times n \times n\).