In this paper, we prove various results concerning DGA-algebras in the context of the Homological Perturbation Theory. We distinguish two class of contractions for algebras: full algebra contractions and semi-full algebra contractions. A full algebra contraction is, in particular, a semi-full algebra contraction. Taking a full algebra contraction and an "algebra perturbation" as data of the Basic Perturbation Lemma, the Algebra Perturbation Lemma (or simply, F-APL) of [20] and [29] appears in a natural way. We establish here a perturbation machinery, the Semi-Full Algebra Perturbation Lemma (or, simply, SFAPL) that is a generalization of the previous one in the sense that the application range of SF-APL is wider than that of F-APL. We show four important applications in which this result is essential for the construction of algebra or coalgebra structures in various chain complexes. 1. Introduction Homological Perturbation Theory [52, 14, 8, 9, 18, 36, 19, 20, 29] is a set of technique...

. We establish an algorithm computing the homology of commutative dierential graded algebras (briey, CDGAs). The main tool in this approach is given by the Homological Perturbation Theory particularized for the algebra category (see [21]). Taking into account these results, we develop and rene some methods already known about the computation of the Hochschild and cyclic homologies of CDGAs. In the last section of the paper, we analyze the p-local homology of the iterated bar construction of a CDGA (p prime). 1. Introduction. The description of eÆcient algorithms of homological computation might be considered as a very important question in Homological Algebra, in order to use those processes mainly in the resolution of problems on algebraic topology; but this subject also inuence directly on the development of non so closedareas as Cohomological Physics (in this sense, we nd useful references in [12], [24], [25]) and Secondary Calculus ([14], [27], [28]). Working in the context ...