Melczer, Stephen2017-06-262017-06-262017-06-262017-06-20http://hdl.handle.net/10012/12039The field of analytic combinatorics, which studies the asymptotic behaviour of sequences through analytic properties of their generating functions, has led to the development of deep and powerful tools with applications across mathematics and the natural sciences. In addition to the now classical univariate theory, recent work in the study of analytic combinatorics in several variables (ACSV) has shown how to derive asymptotics for the coefficients of certain D-finite functions represented by diagonals of multivariate rational functions. This thesis examines the methods of ACSV from a computer algebra viewpoint, developing rigorous algorithms and giving the first complexity results in this area under conditions which are broadly satisfied. Furthermore, this thesis gives several new applications of ACSV to the enumeration of lattice walks restricted to certain regions. In addition to proving several open conjectures on the asymptotics of such walks, a detailed study of lattice walk models with weighted steps is undertaken.enAnalytic CombinatoricsEnumerative CombinatoricsSingularity AnalysisComputer AlgebraLattice PathsRational DiagonalsPolynomial SystemsDoctoral Thesis