IPL
2006
13 years 4 months ago
2006
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting probl...
DM
2008
13 years 4 months ago
2008
In this paper we study recurrences concerning the combinatorial sum n r m = kr (mod m) n k and the alternate sum kr (mod m)(-1)(k-r)/m n k , where m > 0, n 0 and r are integers....
ICALP
1993
Springer
13 years 8 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...