TY - JOUR
T1 - Mellin transforms and asymptotics
T2 - Finite differences and Rice's integrals
AU - Flajolet, Philippe
AU - Sedgewick, Robert
N1 - Funding Information:
*This work was partly supported by the ESPRIT Basic Research National Science Foundation grant no. CCR-9204846. *Corresponding author.
PY - 1995/6/26
Y1 - 1995/6/26
N2 - High order differences of simple number sequences may be analysed asymptotically by means of integral representations, residue calculus, and contour integration. This technique, akin to Mellin transform asymptotics, is put in perspective and illustrated by means of several examples related to combinatorics and the analysis of algorithms like digital tries, digital search trees, quadtrees, and distributed leader election.
AB - High order differences of simple number sequences may be analysed asymptotically by means of integral representations, residue calculus, and contour integration. This technique, akin to Mellin transform asymptotics, is put in perspective and illustrated by means of several examples related to combinatorics and the analysis of algorithms like digital tries, digital search trees, quadtrees, and distributed leader election.
UR - http://www.scopus.com/inward/record.url?scp=0029325565&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0029325565&partnerID=8YFLogxK
U2 - 10.1016/0304-3975(94)00281-M
DO - 10.1016/0304-3975(94)00281-M
M3 - Article
AN - SCOPUS:0029325565
SN - 0304-3975
VL - 144
SP - 101
EP - 124
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1-2
ER -