Attribute grammars and automatic complexity analysis

Advances in Applied Mathematics

Volumn 30, Issue 1-2, 2003, Pages 189-207

  Mishna, Marni ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038066477     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-8858(02)00542-0     Document Type: Review

References (12)

1. M.P. Delest, P. Duchon, Exploration de paramètres inconnus par des q-grammaires, in: SCFA`99, Barcelona, 1999.
2. M.P. Delest, J.-M. Fédou, Attribute grammars are useful for combinatorics, Theoret. Comput. Sci. 98 (1992) 65-76.
3. I. Dutour, J.-M. Fédou, Object grammars and random generation, Discrete Math. Theoret. Comput. Sci. 2 (1998) 49-63.
4. P. Flajolet, B. Salvy, P. Zimmermann, Lambda-Upsilon-Omega: The 1989 Cookbook, Research Report 1073, Institut National de Recherche en Informatique et en Automatique, August 1989, p. 116.
5. P. Flajolet, B. Salvy, P. Zimmermann, Automatic average-case analysis of algorithms, Theoret. Comput. Sci. Ser. A 79 (1) (1991) 37-109.
6. P. Flajolet, P. Zimmerman, B. Van Cutsem, A calculus for the random generation of labelled combinatorial structures, Theoret. Comput. Sci. 123 (1994) 1-35.
7. D. Green, Formal Languages and their Uses, PhD thesis, Stanford University, 1985.
8. D.E. Knuth, Semantics of context-free languages, Math. Systems Theory 2 (2) (1968) 127-145.
9. H. Mahmoud, R. Smythe, Probabilistic analysis of bucket recursive trees, Theoret. Comput. Sci. 144 (1995) 221-249.
10. H. Mahmoud, R. Smythe, Probablisitic analysis of multiple quick select, Algorithmica 22 (1998) 569-584.
11. A. Panholzer, H. Prodinger, A generating functions approach for the analysis of grand averages for multiple quickselect, Random Structures Algorithms 18 (3) (1998) 189-209.
12. P. Zimmerman, Series génératrices et analyse automatique d'algorithmes, PhD thesis, École Polytechnique Palaiseau, 1991.