Philippe Flajolet, et al.  Home/Search
Context Related
| inria.fr/INRIA/publicat...RR1233.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: pauillac.inria.fr/algo/...algobib (more) Homepages: P.Flajolet |
Rate this article:      (best)Comment on this article |
Abstract: . Many probabilistic properties of elementary discrete combinatorial structures of interest for the average--case analysis of algorithms prove to be decidable. This paper presents a general framework in which such decision procedures can be developed: It is based on a combination of generating function techniques for counting, and complex analysis techniques for asymptotic estimations. We expose here the theory of exact analysis in terms of generating functions for four different domains: the... (Update)
Cited by: More
Non-failure Analysis and Granularity Control in Parallel.. - Garcia (2000) (Correct)
Towards Granularity Based Control of Parallelism in.. - Garcia, Hermenegildo.. (1994) (Correct)
Checking and Bounding the Solutions - Of Some Recurrence (Correct)
Active bibliography (related documents): More All
2.4: Asymptotic Enumeration Methods - Odlyzko (1996) (Correct)
2.3: Analytic Analysis of Algorithms - Flajolet (1992) (Correct)
1.1: Computer Algebra Libraries for Combinatorial Structures - Flajolet, Salvy (1995) (Correct)
Similar documents based on text: More All
0.7: Fast Computation with Two Algebraic Numbers - Bostan, Flajolet, Salvy, Schost (2002) (Correct)
0.6: A Calculus for the Random Generation of Combinatorial.. - Flajolet, Zimmermann.. (1993) (Correct)
0.3: Publication List - Flajolet (1997) (Correct)
Related documents from co-citation: More All
15: The art of computer programming (context) - Knuth - 1973
13: Automatic complexity analysis (context) - Rosendahl - 1989
12: The automatic complexity analysis of divide-and-conquer algorithms - Zimmermann, Zimmermann - 1991
BibTeX entry: (Update)
Flajolet, P., Salvy, B., and Zimmermann, P. Automatic average--case analysis of algorithms. Theoretical Computer Science 79, 1 (Feb. 1991), 37--109. http://citeseer.ist.psu.edu/flajolet91automatic.html More
@article{ flajolet91automatic,
author = "Philippe Flajolet and Bruno Salvy and Paul Zimmermann",
title = "Automatic Average-Case Analysis of Algorithm",
journal = "Theoretical Computer Science",
volume = "79",
number = "1",
pages = "37-109",
year = "1991",
url = "citeseer.ist.psu.edu/flajolet91automatic.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1973
2003 The Art of Computer Programming (context) - Knuth - 1981
2003 The Art of Computer Programming (context) - Knuth - 1968
1749 An Introduction to Probability Theory and its Applications (context) - Feller - 1968
267 Enumerative Combinatorics (context) - Stanley - 1986
248 Oxford University Press (context) - Titchmarsh - 1939
157 Advanced Combinatorics (context) - Comtet - 1974
154 Combinatorial Enumeration (context) - Goulden, Jackson - 1983
151 Singularity analysis of generating functions (context) - Flajolet, Odlyzko - 1990
148 A First Course in Stochastic Processes (context) - Karlin, Taylor - 1975
121 and Machines (context) - Eilenberg - 1974
116 Graphical Enumeration (context) - Harary, Palmer - 1973
104 Automata-Theoretic Aspects of Formal Power Series (context) - Salomaa, Soittola - 1978
102 of Encyclopedia of Mathematics and its Applications (context) - Andrews - 1976
101 Central and local limit theorems applied to asymptotic enume.. (context) - Bender - 1973
98 Asymptotics and Special Functions (context) - Olver - 1974
73 Speeding up the computations on an elliptic curve using addi.. - Morain, Olivos - 1989
66 the altitude of nodes in random trees (context) - Meir, Moon - 1978
56 Asymptotic Approximations of Integrals (context) - Wong - 1989
51 Une th'eorie combinatoire des s'eries formelles (context) - Joyal - 1981
48 Mechanical program analysis (context) - Wegbreit - 1975
46 MAPLE: Reference Manual (context) - Char, Geddes et al. - 1988
44 A Handbook of Integer Sequences (context) - Sloane - 1973
43 of Encyclopedia of Mathematics and its Applications (context) - Lothaire - 1983
42 Random mapping statistics - Flajolet, Odlyzko - 1990
39 Differentiably finite power series (context) - Stanley - 1980
37 Analytic models and ambiguity of context--free languages (context) - Flajolet - 1987
35 The algebraic theory of context--free languages (context) - Chomsky, Sch - 1963
32 A unifying look at data structures (context) - Vuillemin - 1980
31 laws in logic and combinatorics (context) - Compton - 1988
30 Combinatorial analysis of quicksort algorithm (context) - Hennequin - 1989
29 Automating program analysis (context) - Hickey, Cohen - 1988
28 Combinatorial Enumeration of Groups (context) - P'olya, Read - 1987
27 Gaussian limiting distributions for the number of components.. (context) - Flajolet, Soria - 1990
26 Computers and Mathematics with Applications (context) - Louchard, Brownian - 1984
23 The CAML Reference Manual (context) - Weis, Aponte et al. - 1987
22 Finite Operator Calculus (context) - Rota - 1975
22 Analysis of algorithms and data structures (context) - Vitter, Flajolet - 1990
20 Labelled formal languages and their uses (context) - Greene - 1983
19 A logical approach to asymptotic combinatorics (context) - Compton - 1987
19 A logical approach to asymptotic combinatorics (context) - Compton - 1987
18 Uniform random generation of strings in a context-free langu.. (context) - Cohen, Hickey - 1983
18 Asymptotique automatique et fonctions g'en'eratrices (context) - Salvy - 1991
18 Generating functions (context) - Stanley - 1978
18 Kombinatorische Anzahlbestimmungen fur Gruppen (context) - P'olya - 1937
15 Computer--assisted microanalysis of programs (context) - Cohen - 1982
15 Recognizable formal power series on trees (context) - Berstel, Reutenauer - 1982
15 Institut National de Recherche en Informatique et en Automat.. (context) - Flajolet, Salvy et al. - 1989
14 Resurrecting the asymptotics of linear recurrences (context) - Wimp, Zeilberger - 1985
14 Theoretical Computer Science (context) - Delest, Viennot - 1984
14 emes d"enum (context) - Foata - 1974
13 Asymptotic expansions for the coefficients of analytic funct.. (context) - Harris, Schoenfeld - 1968
13 A generalization of Stirling's formula (context) - Hayman - 1956
12 Enumerative uses of generating functions (context) - Bender, Goldman - 1971
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
10 ACM Transactions on Programming Languages and Systems (context) - Le Metayer - 1988
10 Average case analysis of unification algorithms (context) - Albert, Casas et al. - 1990
10 Asymptotic expansions for the coefficients of analytic gener.. - Odlyzko, Richmond - 1985
9 Central and local limit theorems for the coefficients of pol.. (context) - Canfield - 1977
9 M'ethodes d'analyse pour les constructions combinatoires et .. (context) - Soria - 1990
9 Les s'eries rationnelles et leurs langages (context) - Berstel, Reutenauer - 1984
8 Analyse d'algorithmes de manipulation d'arbres et de fichier.. (context) - Flajolet - 1981
8 Algebraic simplification: a guide for the perplexed (context) - Moses - 1971
8 Cambridge Tracts in Mathematics (context) - Hardy - 1910
7 Institut National de Recherche en Informatique et en Automat.. (context) - Salvy - 1989
7 Structure et complexit'e des algorithmes (context) - Steyaert - 1984
6 Twenty-step algorithm for determining the asymptotic number .. (context) - Harary, Robinson et al. - 1975
6 Zeitschrift fur Wahrscheinlichkeitstheorie (context) - Rota, On - 1964
5 Theoretical Informatics and Applications (context) - R'egnier - 1989
5 A note on the number of functional digraphs (context) - Read - 1961
4 A complexity calculus for classes of recursive search progra.. (context) - Flajolet, Steyaert - 1981
4 Some methods for computing component distribution probabilit.. (context) - Compton - 1987
4 Alas : un syst`eme d'analyse alg'ebrique (context) - Zimmermann - 1989
4 The asymptotic behavior of the Laurent coefficients (context) - Wyman - 1959
4 Sur la densit'e asymptotique de langages formels (context) - Berstel - 1972
3 Sur les s'eries de Taylor n'ayant que des singularit'es alg'.. (context) - Jungen - 1931
3 Also available as Tech (context) - Ramshaw, the - 1979
3 A holonomic approach to special function identities (context) - Zeilberger - 1988
2 S'eries g'en'eratrices et analyse automatique d'algorithmes (context) - Zimmermann - 1990
2 Functional equations for data structures (context) - Bergeron, Labelle et al. - 1988
2 A trivial algorithm whose analysis is not (context) - Jonassen, Knuth - 1978
2 Darwin: Computer algebra and enumerative combinatorics (context) - Bergeron, Cartier - 1988
1 Automatische Komplexitatsanalyse von funktionalen Programmen (context) - Zimmermann - 1989
1 and Compiling; Volume 1: Parsing (context) - Aho, Ullman - 1972
1 Analysis of Programs with Semantic Conditionals (context) - Zimmermann, Zimmermann - 1990
1 Enumeration of injective partial transformations (context) - Borwein, Rankin et al. - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pauillac.inria.fr/algo/papers/bibgen/algobib.html): More
Analytic Combinatorics of Non-crossing Configurations - Flajolet, Noy (1997) (Correct)
The Maximum of a Random Walk and Its Application to.. - Coffman, Flajolet.. (1997) (Correct)
The Analysis of Hybrid Trie Structures - Clément, Flajolet.. (1997) (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