Attribute grammars and automatic complexity analysis
From MaRDI portal
Publication:1398296
DOI10.1016/S0196-8858(02)00542-0zbMath1028.68073MaRDI QIDQ1398296
Publication date: 29 July 2003
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
68Q42: Grammars and rewriting systems
Related Items
Randomness Preserving Deletions on Special Binary Search Trees, Assessing the quality of multilevel graph clustering, \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis, From object grammars to ECO systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic analysis of bucket recursive trees
- Automatic average-case analysis of algorithms
- Attribute grammars are useful for combinatorics
- Probabilistic analysis of multiple quick select
- A calculus for the random generation of labelled combinatorial structures
- Semantics of context-free languages