This report is part of a projected series whose aim is to present in a synthetic way the major methods and models in the average-case analysis of algorithms. The present work - complex asymptotics and generating functions - is devoted to the use of complex analysis in order to estimate the asymptotic growth of coefficients of combinatorial generating functions. It consists of two chapters : complex asymptotic methods - syngularity analysis of generating functions.