AbstractWe do what the title promises, and as a bonus, we get much simplified versions of these algorithms, that do not make any explicit mention of Gosper’s algorithm
International audienceOver the last several decades, improvements in the fields of analytic combinat...
Abstract A terminating condition of the well-known Zeilberger's algorithm for a given hypergeom...
AbstractThe performance attributes of a broad class of randomised algorithms can be described by a r...
AbstractThe existence of proper terms that have homogeneous Zeilberger recurrences with telescoping ...
AbstractWe present a derivation of Gosper's algorithm which permits generalization to higher-order r...
Abstract. We describe an algorithm that takes as input a complex sequence (un) given by a linear rec...
New algorithms and lower bounds for the parallel evaluation of certain rational expression
Some remarks on the numerical evaluation of recurrence relations are presented. Results concerning t...
[[abstract]]Let M(n) be defined by the recurrence M(n) = max (M(k) + M(n - k) + min(f(k), f(n - k)))...
AbstractWe describe an algorithm that takes as input a complex sequence (un) given by a linear recur...
25 pagesInternational audienceWe describe an algorithm that takes as input a complex sequence $(u_n)...
AbstractThis paper describes three algorithms for q -hypergeometric summation: • a multibasic analog...
AbstractGosper's and Zeilberger's algorithms for summation of terminating hypergeometric series as w...
AbstractS. Golomb discovered a self describing sequence of integers with a simple asymptotic behavio...
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based o...
International audienceOver the last several decades, improvements in the fields of analytic combinat...
Abstract A terminating condition of the well-known Zeilberger's algorithm for a given hypergeom...
AbstractThe performance attributes of a broad class of randomised algorithms can be described by a r...
AbstractThe existence of proper terms that have homogeneous Zeilberger recurrences with telescoping ...
AbstractWe present a derivation of Gosper's algorithm which permits generalization to higher-order r...
Abstract. We describe an algorithm that takes as input a complex sequence (un) given by a linear rec...
New algorithms and lower bounds for the parallel evaluation of certain rational expression
Some remarks on the numerical evaluation of recurrence relations are presented. Results concerning t...
[[abstract]]Let M(n) be defined by the recurrence M(n) = max (M(k) + M(n - k) + min(f(k), f(n - k)))...
AbstractWe describe an algorithm that takes as input a complex sequence (un) given by a linear recur...
25 pagesInternational audienceWe describe an algorithm that takes as input a complex sequence $(u_n)...
AbstractThis paper describes three algorithms for q -hypergeometric summation: • a multibasic analog...
AbstractGosper's and Zeilberger's algorithms for summation of terminating hypergeometric series as w...
AbstractS. Golomb discovered a self describing sequence of integers with a simple asymptotic behavio...
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based o...
International audienceOver the last several decades, improvements in the fields of analytic combinat...
Abstract A terminating condition of the well-known Zeilberger's algorithm for a given hypergeom...
AbstractThe performance attributes of a broad class of randomised algorithms can be described by a r...
DOI
Add to ORKG