This article deals with two iterative algorithms of finding a common fixed points for strict pseudo-contractions defined on a closed convex subset of a real Hilbert space (an operator is a strict pseudo-contraction, if there exists a constant such that ). The first algorithm, called parallel, is defined by the formula
the second one, called cyclic, by the formula
The main results describe (provided that ) conditions on the control sequence so that the approximations converge weakly to a common fixed point of . At the end of the article, some modifications of algorithms (1) and (2) are proposed; it is proved that approximations for these modified algorithms converge strongly to , where is the nearest point projection from onto .