In this thesis we are concerned with the study of pointwise and ergodic iteration-complexities of a family of splitting-projective methods proposed by Eckstein and Svaiter, for finding a zero of the sum of two maximal monotone operators. We also present two inexact variants of specific instances of this family of algorithms, and derive corresponding convergence rate results.