Automatic average-case analysis of algorithms
Theoretical Computer Science - Theme issue on the algebraic and computing treatment of noncommutative power series
Attribute grammars are useful for combinatorics
Theoretical Computer Science - Selected papers of the 2nd workshop on algebraic and computer-theoretic aspects of formal power series
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Probabilistic analysis of bucket recursive trees
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
proceedings of the eighth international conference on Random structures and algorithms
Feature extraction from noisy speech signals
Feature extraction from noisy speech signals
Labelled formal languages and their uses
Labelled formal languages and their uses
From object grammars to ECO systems
Theoretical Computer Science
Assessing the quality of multilevel graph clustering
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
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, Fédou, 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.