Attribute grammars and automatic complexity analysis
From MaRDI portal
Publication:1398296
DOI10.1016/S0196-8858(02)00542-0zbMATH Open1028.68073OpenAlexW1993840779MaRDI QIDQ1398296FDOQ1398296
Authors: Marni Mishna 
Publication date: 29 July 2003
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0196-8858(02)00542-0
Recommendations
Cites Work
- A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
- Probabilistic analysis of bucket recursive trees
- Semantics of context-free languages
- A calculus for the random generation of labelled combinatorial structures
- Attribute grammars are useful for combinatorics
- Automatic average-case analysis of algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic analysis of multiple quick select
Cited In (17)
- Title not available (Why is that?)
- Composition and evaluation of attribute coupled grammars
- Recursive combinatorial structures: enumeration, probabilistic analysis and random generation
- Title not available (Why is that?)
- Machines for attribute grammars
- Circular reference attributed grammars - their evaluation and applications
- Randomness Preserving Deletions on Special Binary Search Trees
- Attributed tree grammars
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
- Assessing the quality of multilevel graph clustering
- From object grammars to ECO systems
- On the complexity of regular-grammars with integer attributes
- On attribute grammars without attribute synthesis
- Computational and attribute models of formal languages
- Attribute grammars are useful for combinatorics
- Unfolding Symbolic Attributed Graph Grammars
- Title not available (Why is that?)
This page was built for publication: Attribute grammars and automatic complexity analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398296)
