Analytic Analysis of Algorithms

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.

[1]  A. Odlyzko,et al.  Asymptotic expansions for the coefficients of analytic generating functions , 1985 .

[2]  Philippe Flajolet,et al.  Automatic Average-Case Analysis of Algorithm , 1991, Theor. Comput. Sci..

[3]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[4]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[5]  Philippe Flajolet,et al.  Gaussian limiting distributions for the number of components in combinatorial structures , 1990, J. Comb. Theory, Ser. A.

[6]  Jean-Marc Steyaert,et al.  Patterns and Pattern-Matching in Trees: An Analysis , 1984, Inf. Control..

[7]  Donald E. Knuth,et al.  The Average Time for Carry Propagation , 1978 .

[8]  Michele Soria-Cousineau.  Méthodes d'analyse pour les constructions combinatoires et les algorithmes , 1990 .

[9]  Frank Harary,et al.  Graphical enumeration , 1973 .

[10]  Danièle Gardy.  Methode de col et lois limites en analyse combinatoire , 1992, Theor. Comput. Sci..

[11]  Philippe Flajolet,et al.  Random Mapping Statistics , 1990, EUROCRYPT.

[12]  Philippe Flajolet,et al.  Digital Search Trees Revisited , 1986, SIAM J. Comput..

[13]  Paul Zimmermann,et al.  Analysis of functions with a finite number of return values , 1992 .

[14]  Vladimir Lifschitz,et al.  The Number of Increasing Subsequences of the Random Permutation , 1981, J. Comb. Theory, Ser. A.

[15]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[16]  G. Pólya,et al.  Combinatorial Enumeration Of Groups, Graphs, And Chemical Compounds , 1988 .

[17]  Egon Börger,et al.  Trends in theoretical computer science , 1988 .

[18]  D. Greene.  Labelled formal languages and their uses , 1983 .

[19]  François Fages,et al.  Average-Case Analysis of Unification Algorithms , 1991, Theor. Comput. Sci..

[20]  Helmut Prodinger,et al.  On the variance of the external path length in a symmetric digital trie , 1989, Discret. Appl. Math..

[21]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[22]  Wojciech Szpankowski,et al.  Patricia tries again revisited , 1990, JACM.

[23]  Richard P. Stanley,et al.  Differentiably Finite Power Series , 1980, Eur. J. Comb..

[24]  E. Bender.  Asymptotic Methods in Enumeration , 1974 .

[25]  Wojciech Rytter,et al.  Analysis of algorithms and data structures , 1991, International computer science series.

[26]  Ira M. Gessel,et al.  Symmetric functions and P-recursiveness , 1990, J. Comb. Theory, Ser. A.

[27]  J. Berstel,et al.  Les séries rationnelles et leurs langages , 1984 .

[28]  Z. Galil,et al.  Combinatorial Algorithms on Words , 1985 .

[29]  Micha Hofri,et al.  On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel , 1986 .

[30]  Philippe Flajolet,et al.  Generalized Digital Trees and Their Difference-Differential Equations , 1992, Random Struct. Algorithms.

[31]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[32]  L. Lipshitz,et al.  The diagonal of a D-finite power series is D-finite , 1988 .

[33]  Philippe Flajolet,et al.  Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..

[34]  Edward A. Bender,et al.  Central and Local Limit Theorems Applied to Asymptotic Enumeration , 1973, J. Comb. Theory A.

[35]  H. Prodinger,et al.  ON SOME APPLICATIONS OF FORMULAE OF RAMANUJAN IN THE ANALYSIS OF ALGORITHMS , 1991 .

[36]  Kevin J. Compton,et al.  A logical approach to asymptotic combinatorics II: Monadic second-order properties , 1989, J. Comb. Theory A.

[37]  K. Compton.  A Logical Approach to Asymptotic Combinatorics I. First Order Properties , 1987 .

[38]  P. Dienes,et al.  The Taylor Series. , 1932 .

[39]  Paolo Massazza,et al.  Holonomic Functions and Their Relation to Linearly Constrained Languages , 1993, RAIRO Theor. Informatics Appl..

[40]  de Ng Dick Bruijn,et al.  THE AVERAGE HEIGHT OF PLANTED PLANE TREES , 1972 .

[41]  D. Aldous,et al.  A diffusion limit for a class of randomly-growing binary trees , 1988 .

[42]  L. Lipshitz,et al.  D-finite power series , 1989 .

[43]  Andrew Odlyzko.  Enumeration of Strings , 1985 .

[44]  Gaston H. Gonnet,et al.  The analysis of multidimensional searching in quad-trees , 1991, SODA '91.

[45]  E. Capelas de Oliveira.  On generating functions , 1992 .

[46]  Philippe Flajolet,et al.  A complexity calculus for classes of recursive search programs over tree structures , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[47]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[48]  Michèle Soria,et al.  Complexity Analysis of Term-Rewriting Systems , 1989, Theor. Comput. Sci..

[49]  N. D. Bruijn.  Asymptotic methods in analysis , 1958 .

[50]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[51]  Danièle Gardy.  Saddle method and limit laws in combinatorial analysis , 1992 .

[52]  D. Knuth,et al.  Mathematics for the Analysis of Algorithms , 1999 .

[53]  J. Moon,et al.  On the Altitude of Nodes in Random Trees , 1978, Canadian Journal of Mathematics.

[54]  Philippe Flajolet,et al.  Partial match retrieval of multidimensional data , 1986, JACM.

[55]  Brendan D. McKay,et al.  The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs , 1990, Comb..

[56]  Edward A. Bender,et al.  Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions , 1983, J. Comb. Theory, Ser. A.

[57]  Philippe Flajolet,et al.  Analytic Variations on the Common Subexpression Problem , 1990, ICALP.

[58]  Frank Harary.  Chapter 1 – LABELED ENUMERATION , 1973 .

[59]  W. Burnside.  Theory of Functions , 1899, Nature.

[60]  Philippe Flajolet,et al.  Average-Case Analysis of Algorithms and Data Structures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[61]  Philippe Flajolet,et al.  Analyse d'algorithmes de manipulation d'arbres et de fichiers , 1981 .

[62]  D. Zeilberger.  A holonomic systems approach to special functions identities , 1990 .

[63]  Rainer Kemp,et al.  Fundamentals of the average case analysis of particular algorithms , 1985, Wiley-Teubner series in computer science.

[64]  B. Salvy.  Asymptotique automatique et fonctions generatrices , 1991 .

[65]  A. Joyal.  Une théorie combinatoire des séries formelles , 1981 .

[66]  K. Compton.  Laws in Logic and Combinatorics , 1989 .

[67]  W. Wasow.  Asymptotic expansions for ordinary differential equations , 1965 .

[68]  R. Casasy,et al.  Statistics on Random Trees , 1991 .

[69]  Philippe Flajolet,et al.  Analytic Models and Ambiguity of Context-free Languages* , 2022 .

[70]  Donald E. Knuth.  The art of computer programming: fundamental algorithms , 1969 .

[71]  Donald E. Knuth,et al.  The Expected Linearity of a Simple Equivalence Algorithm , 1978, Theor. Comput. Sci..

[72]  E. Rodney Canfield,et al.  Central and Local Limit Theorems for the Coefficients of Polynomials of Binomial Type , 1977, J. Comb. Theory, Ser. A.

[73]  Jean-Marc Steyaert,et al.  Algebraic Simplification in Computer Algebra: An Analysis of Bottom-up Algorithms , 1990, Theor. Comput. Sci..

[74]  D. Zeilberger,et al.  Resurrecting the asymptotics of linear recurrences , 1985 .

[75]  P. Zimmermann.  Séries génératrices et analyse automatique d'algorithmes , 1991 .

[76]  Guy Louchard,et al.  The Brownian Motion: A Neglected Tool for the Complexity Analysis of Sorted Tables Manipulation , 1983, RAIRO Theor. Informatics Appl..

[77]  Philippe Flajolet,et al.  Page usage in quadtree indexes , 1991 .