@**article**{RISC2392,author = {R. Pirastu and K. Siegl},

title = {{Parallel Computation and Indefinite Summation: A MAPLE Application for the Rational Case}},

language = {english},

abstract = {The problem of computing a {\em closed form} for sum
expressions of special functions arises in many parts of
mathematics and computer science, especially in
combinatorics and complexity analysis.
Here we discuss two algorithms for indefinite
summation of rational functions, due to Abramow and Paule.
We describe some improvements and a parallel implementation on
a workstation network of SGI machines in
\pmaple\ (speak: parallel Maple). Our best implementation
achieves a speedup up to eight with respect to the fastest
available sequential implementation.
Finally, further applications of parallel computing in this field are outlined.},

journal = {J. Symbolic Comput.},

volume = {20},

pages = {603--616},

isbn_issn = {ISSN 0747-7171},

year = {1995},

refereed = {yes},

length = {14}

}