论文信息 - Attribute grammars and automatic complexity analysis

Attribute grammars and automatic complexity analysis

Attribute grammars provide a concise way to describe traits of a wide family of structures. Structures defined by context-free grammars have been well studied by Delest, Fedou, and more recently by Duchon. One of the principle benefits of this approach is the easy access to multivariate generating function equations from which average and higher moments are easily accessible. This work extends these notions to a wider class of structures and considers the application to algorithm analysis.

Marni Mishna

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

[2] Hosam M. Mahmoud,et al. Probabilistic Analysis of Bucket Recursive Trees , 1995, Theor. Comput. Sci..

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

[4] Pascal Hennequin. Analyse en moyenne d'algorithmes, tri rapide et arbres de recherche , 1991 .

[5] Jean-Marc Fedou,et al. Attibute Grammars are Useful for Combinatorics , 1992, Theor. Comput. Sci..

[6] Philippe Flajolet,et al. A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..

[7] Bruno Salvy,et al. Lambda-Upsilon-Omega the 1989 cookbook , 1989 .

[8] P. Zimmermann,et al. Automatic Average-Case Analysis of Algorithm , 1991, Theor. Comput. Sci..

[9] Donald E. Knuth,et al. Semantics of context-free languages , 1968, Mathematical systems theory.

[10] Helmut Prodinger,et al. A generating functions approach for the analysis of grand averages for multiple QUICKSELECT , 1998 .

[11] I. Dutour,et al. Object grammars and random generation , 1998, Discret. Math. Theor. Comput. Sci..

[12] Hosam M. Mahmoud,et al. Probabilistic Analysis of MULTIPLE QUICK SELECT , 1998, Algorithmica.

[13] P. Hennequin. Combinatorial Analysis of Quicksort Algorithm , 1989, RAIRO Theor. Informatics Appl..