Philippe Flajolet  Home/Search
Context Related
Links: ACM DBLP | algo.inria.fr/flajolet/Publ...aaa.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: algo.inria.fr/flajolet/Publica... (more) Homepages: P.Flajolet |
Rate this article:      (best)Comment on this article |
Abstract: . The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis permit to express directly the counting generating functions of wide classes of combinatorial structures. Asymptotic methods based on complex analysis permit to extract directly coefficients of structurally complicated generating functions without a need for explicit coefficient expansions. Three... (Update)
Context of citations to this paper: More
.... relies on a description of relevant parameters by means of generating functions, a by now common tool in the average case of algorithms [12, 13]. As is usual in number theory contexts, the generating functions are Dirichlet series. They are first proved to be algebraically...
...tree enumerations, comparison based searching and sorting, digital structures, hashing and occupancy problems. This summary is based on [2]. Introduction Quicksort. The classical analysis of the Quicksort algorithm results in solving a recurrence based on the recursive...
Cited by: More
Dynamical Analysis of ff--Euclidean Algorithms - Er'emie Bourdon Benoit (Correct)
Dynamical Analysis of a Class of Euclidean Algorithms - Vallée (Correct)
Digits and Continuants in Euclidean Algorithms. Ergodic versus.. - Vallée (2000) (Correct)
Similar documents (at the sentence level):
14.1%: Analytic Analysis of Algorithms - Flajolet (1992) (Correct)
Active bibliography (related documents): More All
2.4: Asymptotic Enumeration Methods - Odlyzko (1996) (Correct)
2.3: Automatic Average-Case Analysis Of Algorithms - Flajolet, al. (1991) (Correct)
1.3: Statistics on Random Trees - Casas, Díaz, Martinez (1991) (Correct)
Similar documents based on text: More All
0.2: Sorting With Unreliable Comparisons: A Probabilistic.. - Alonso, Chassaing.. (Correct)
0.2: Phase Changes in Random M-Ary Search Trees and Generalized.. - Chern, Hwang (2001) (Correct)
0.1: Smoothed Analysis of Three Combinatorial Problems - Banderier, Mehlhorn, Beier (2003) (Correct)
Related documents from co-citation: More All
6: the average length of a class of continued fractions (context) - Heilbronn - 1969
6: An average--case analysis of the Gaussian algorithm for lattice reduction (context) - Daud'e, Flajolet et al. - 1997
6: a la th'eorie analytique des nombres (context) - Tenenbaum - 1990
BibTeX entry: (Update)
P. Flajolet. Analytic analysis of algorithms. In Automata, Languages and Programming, number 623 in Lecture Notes in Computer Science, pages 186--210, 1992. http://citeseer.ist.psu.edu/article/flajolet92analytic.html More
@inproceedings{ flajolet92analytic,
author = "Philippe Flajolet",
title = "Analytic Analysis of Algorithms",
booktitle = "Automata, Languages and Programming",
pages = "186-210",
year = "1992",
url = "citeseer.ist.psu.edu/article/flajolet92analytic.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1973
442 Concrete Mathematics (context) - Graham, Knuth et al. - 1989 ACM
267 Enumerative Combinatorics (context) - Stanley - 1986 ACM
172 Applied and Computational Complex Analysis (context) - Henrici - 1977
157 Advanced Combinatorics (context) - Comtet - 1974
154 Combinatorial Enumeration (context) - Goulden, Jackson - 1983 ACM
151 Singularity analysis of generating functions (context) - Flajolet, Odlyzko - 1990 DBLP
116 Graphical Enumeration (context) - Harary, Palmer - 1973
101 Central and local limit theorems applied to asymptotic enume.. (context) - Bender, Richmond - 1983
101 Central and local limit theorems applied to asymptotic enume.. (context) - Bender - 1973
85 Mathematics for the analysis of algorithms (context) - Greene, Knuth - 1981 ACM
73 Extendible hashing: A fast access method for dynamic files (context) - Fagin, Nievergelt et al. - 1979
66 the altitude of nodes in random trees (context) - Meir, Moon - 1978
61 Oxford University Press (context) - Titchmarsh - 1939
51 Une th'eorie combinatoire des s'eries formelles (context) - Joyal - 1981
48 Asymptotic methods in enumeration (context) - Bender - 1974
47 Symmetric functions and P --recursiveness (context) - Gessel - 1990
45 Probabilistic counting algorithms for data base applications - Flajolet, Martin - 1985 ACM DBLP
39 Automatic average--case analysis of algorithms - Flajolet, Salvy et al. - 1991
39 Differentiably finite power series (context) - Stanley - 1980
37 Analytic models and ambiguity of context--free languages (context) - Flajolet - 1987
33 Digital search trees revisited (context) - Flajolet, Sedgewick - 1986 ACM DBLP
31 laws in logic and combinatorics (context) - Compton - 1988
28 Combinatorial Enumeration of Groups (context) - P'olya, Read - 1987
27 Gaussian limiting distributions for the number of components.. (context) - Flajolet, Soria - 1990 ACM
27 Partial match retrieval of multidimensional data (context) - Flajolet, Puech - 1986 ACM DBLP
25 Mellin transforms and asymptotics: The mergesort recurrence - Flajolet, Golin - 1992 DBLP
23 Branching processes in the analysis of the heights of trees (context) - Devroye - 1987 ACM DBLP
22 Analysis of algorithms and data structures (context) - Vitter, Flajolet - 1990
21 Addison--Wesley (context) - Sedgewick - 1988
20 Generalized digital trees and their difference-- differentia.. - Flajolet, Richmond - 1991
20 Labelled formal languages and their uses (context) - Greene - 1983 ACM
19 A logical approach to asymptotic combinatorics (context) - Compton - 1987
19 Patricia tries again revisited (context) - Szpankowski - 1990 ACM DBLP
19 A logical approach to asymptotic combinatorics (context) - Compton - 1987
18 Fundamentals of the Average Case Analysis of Particular Algo.. (context) - Kemp - 1984 ACM
18 Asymptotique automatique et fonctions g'en'eratrices (context) - Salvy - 1991
18 Generating functions (context) - Stanley - 1978
17 finite power series (context) - Lipshitz - 1989
15 Institut National de Recherche en Informatique et en Automat.. (context) - Hoshi, Flajolet - 1991
14 Resurrecting the asymptotics of linear recurrences (context) - Wimp, Zeilberger - 1985
14 a functional equation arising in the analysis of a protocol .. (context) - Fayolle, Flajolet et al. - 1986
13 Patterns and pattern-matching in trees: an analysis (context) - Steyaert, Flajolet - 1983 DBLP
12 The analysis of multidimensional searching in quad--trees (context) - Flajolet, Gonnet et al. - 1991
12 Complexity analysis of term rewriting systems (context) - Choppy, Kaplan et al. - 1989
11 A complexity calculus for recursive tree algorithms (context) - Flajolet, Steyaert - 1987 DBLP
11 A diffusion limit for a class of randomly growing binary tre.. (context) - Aldous, Shields - 1988
11 The expected linearity of a simple equivalence algorithm (context) - Knuth, Sch - 1978 DBLP
11 On some applications of formulae of Ramanujan in the analysi.. (context) - Kirschenhofer, Prodinger - 1991
10 The average time for carry propagation (context) - Knuth - 1978
10 Average case analysis of unification algorithms (context) - Albert, Casas et al. - 1991 ACM DBLP
10 Asymptotic expansions for the coefficients of analytic gener.. - Odlyzko, Richmond - 1985
9 The average height of planted plane trees (context) - de Bruijn, Knuth et al. - 1972
9 Central and local limit theorems for the coefficients of pol.. (context) - Canfield - 1977
9 Les s'eries rationnelles et leurs langages (context) - Berstel, Reutenauer - 1984
9 Analytic variations on the common subexpression problem - Flajolet, Sipala et al. - 1990 ACM DBLP
9 M'ethodes d'analyse pour les constructions combinatoires et .. (context) - Soria-Cousineau - 1990
9 finite power series is D-finite (context) - Lipshitz, diagonal - 1988
8 Analyse d'algorithmes de manipulation d'arbres et de fichier.. (context) - Flajolet - 1981
7 Structure et complexit'e des algorithmes (context) - Steyaert - 1984
7 Enumeration of strings - Odlyzko - 1985
7 the variance of the external path length in a symmetric digi.. (context) - Kirschenhofer, Prodinger et al. - 1989
6 The number of increasing subsequences of the random permutat.. (context) - Lifschitz, Pittel - 1981
5 ese de Doctorat (context) - Zimmermann - 1991
4 eulerian digraphs and eulerian oriented graphs (context) - McKay - 1990
4 The Brownian motion: a neglected tool for the complexity ana.. (context) - Louchard - 1983
4 A complexity calculus for classes of recursive search progra.. (context) - Flajolet, Steyaert - 1981 DBLP
3 A holonomic approach to special functions identities (context) - Zeilberger - 1990
3 To appear as a chapter in the Handbook of Combinatorics (context) - Odlyzko - 1992
3 M'ethode de col et lois limites en analyse combinatoire (context) - Gardy - 1992
2 Algebraic simplification in computer algebra: An analysis of.. (context) - Casas, Fern'andez et al. - 1990 ACM DBLP
2 Statistics on random trees - Casas, Diaz et al. - 1991 ACM
2 Average case analysis of the Rete pattern--matching algorith.. (context) - Albert, Fages - 1988
2 of Encyclopedia of Mathematical Sciences (context) - Gamkrelidze, Ed - 1989
1 Holonomic functions and their relation to linearly constrain.. (context) - Massazza - 1991 DBLP
1 Bases de donn'ees et allocations al'eatoires: Quelques analy.. (context) - Gardy - 1989
1 Analysis of functions with a finite number of return values - Zimmermann - 1992
1 To appear as a chapter in the Handbook of Combinatorics (context) - Gessel, Stanley - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://algo.inria.fr/flajolet/Publications/): More
Analytic Combinatorics of Non-crossing Configurations - Flajolet, Noy (1997) (Correct)
Random Triangulations (Extended Abstract) - Devroye, Flajolet, Hurtado.. (1996) (Correct)
The Formal Theory of Birth-and-Death Processes, Lattice.. - Flajolet, Guillemin (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC