AbstractHigh 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
AbstractFlajolet and Soria established several central limit theorems for the parameter ‘number of c...
International audienceAmong all sequences that satisfy a divide-and-conquer recurrence, those which ...
Mellin transforms and Dirichlet series are useful in quantifying periodicity phenomena present in re...
AbstractHigh order differences of simple number sequences may be analysed asymptotically by means of...
This survey presents a unified and essentially self-contained approach to the asymptotic analysis of...
AbstractThis survey presents a unified and essentially self-contained approach to the asymptotic ana...
Programme 2 - Calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Docume...
AbstractArithmetic functions related to number representation systems exhibit various periodicity ph...
Mellin transforms and Dirichlet series are useful in quantifying periodicity phenomena present in re...
AbstractWe present a method for deriving asymptotic expansions of integrals of the form ∫0∞f(t)h(xt)...
International audienceThe Fourier transform of orthogonal polynomials with respect to their own orth...
November 2004A simple approach is presented to study the asymptotic behavior of some algorithms with...
This paper studies three types of functions arising separately in the analysis of algo-rithms, which...
AbstractAn asymptotic formula, having bounded relative error, is developed for the numerical sequenc...
AbstractExplicit expressions are derived for the error terms associated with the asymptotic expansio...
AbstractFlajolet and Soria established several central limit theorems for the parameter ‘number of c...
International audienceAmong all sequences that satisfy a divide-and-conquer recurrence, those which ...
Mellin transforms and Dirichlet series are useful in quantifying periodicity phenomena present in re...
AbstractHigh order differences of simple number sequences may be analysed asymptotically by means of...
This survey presents a unified and essentially self-contained approach to the asymptotic analysis of...
AbstractThis survey presents a unified and essentially self-contained approach to the asymptotic ana...
Programme 2 - Calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Docume...
AbstractArithmetic functions related to number representation systems exhibit various periodicity ph...
Mellin transforms and Dirichlet series are useful in quantifying periodicity phenomena present in re...
AbstractWe present a method for deriving asymptotic expansions of integrals of the form ∫0∞f(t)h(xt)...
International audienceThe Fourier transform of orthogonal polynomials with respect to their own orth...
November 2004A simple approach is presented to study the asymptotic behavior of some algorithms with...
This paper studies three types of functions arising separately in the analysis of algo-rithms, which...
AbstractAn asymptotic formula, having bounded relative error, is developed for the numerical sequenc...
AbstractExplicit expressions are derived for the error terms associated with the asymptotic expansio...
AbstractFlajolet and Soria established several central limit theorems for the parameter ‘number of c...
International audienceAmong all sequences that satisfy a divide-and-conquer recurrence, those which ...
Mellin transforms and Dirichlet series are useful in quantifying periodicity phenomena present in re...