Finding telescopers with minimal depth for indefinite nested sum and product expressions

Carsten Schneider. Finding telescopers with minimal depth for indefinite nested sum and product expressions. In Manuel Kauers, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings. pages 285-292, ACM, 2005. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: