@inproceedings{BoChChLi10,
     author 	= {Bostan, Alin and Chen, Shaoshi and Chyzak, Fr\'{e}d\'{e}ric and Li, Ziming},
     title 	= {Complexity of creative telescoping for bivariate rational functions},
     booktitle 	= {ISSAC '10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation},
     year 	= {2010},
     pages 	= {203--210},
     location 	= {Munich, Germany},
     doi 	= {http://doi.acm.org/10.1145/1837934.1837975},
     publisher 	= {ACM},
     address   	= {New York, NY, USA},
     abstract	= {The long-term goal initiated in this work is to obtain fast algorithms and implementations for definite integration in Almkvist and Zeilberger's framework of (differential) creative telescoping. Our complexity-driven approach is to obtain tight degree bounds on the various expressions involved in the method. To make the problem more tractable, we restrict to \emph{bivariate rational\/} functions. By considering this constrained class of inputs, we are able to blend the general method of creative telescoping with the well-known Hermite reduction. We then use our new method to compute diagonals of rational power series arising from combinatorics.},
}