Verifying Program Performance
From MaRDI portal
Cited in
(5)- A complexity calculus for recursive tree algorithms
- An experimental logic based on the fundamental deduction principle
- Semantic foundations for cost analysis of pipeline-optimized programs
- Semantics of algorithmic languages
- Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
This page was built for publication: Verifying Program Performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099190)