Singularity analysis, Hadamard products, and tree recurrences
| dc.creator | Fill, James Allen | |
| dc.creator | Flajolet, Philippe | |
| dc.creator | Kapur, Nevin | |
| dc.date | 2003-06-13 | |
| dc.date.accessioned | 2026-07-07T04:58:58Z | |
| dc.date.available | 2026-07-07T04:58:58Z | |
| dc.description | We present a toolbox for extracting asymptotic information on the coefficients of combinatorial generating functions. This toolbox notably includes a treatment of the effect of Hadamard products on singularities in the context of the complex Tauberian technique known as singularity analysis. As a consequence, it becomes possible to unify the analysis of a number of divide-and-conquer algorithms, or equivalently random tree models, including several classical methods for sorting, searching, and dynamically managing equivalence relations | |
| dc.description | 47 pages. Submitted for publication | |
| dc.identifier | https://arxiv.org/abs/math/0306225 | |
| dc.identifier | http://arxiv.org/abs/math/0306225 | |
| dc.identifier | J. Comput. Appl. Math. 174 (2005) 271-313 | |
| dc.identifier | doi:10.1016/j.cam.2004.04.014 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67796 | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.subject | 05A16 (Primary); 40E99, 68W40 (Secondary) | |
| dc.title | Singularity analysis, Hadamard products, and tree recurrences | |
| dc.type | text |