Martin Avanzini

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Type-based complexity analysis of probabilistic functional programs	2024-12-19	Paper
Quantum expectation transformers for cost analysis	2024-12-06	Paper
On probabilistic term rewriting (available as arXiv preprint)	2018-07-09	Paper
On sharing, memoization, and polynomial time Information and Computation	2018-06-14	Paper
Complexity of acyclic term graph rewriting	2017-10-17	Paper
Certification of complexity proofs using CeTA	2017-07-12	Paper
Analysing the complexity of functional programs: higher-order meets first-order Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming	2017-05-10	Paper
Analysing the complexity of functional programs: higher-order meets first-order Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming	2017-05-10	Paper
A combination framework for complexity (available as arXiv preprint)	2017-02-01	Paper
Tyrolean Complexity Tool: Features and Usage.	2017-02-01	Paper
On sharing, memoization, and polynomial time (available as arXiv preprint)	2017-01-24	Paper
A combination framework for complexity Information and Computation	2016-05-03	Paper
A new order-theoretic characterisation of the polytime computable functions Theoretical Computer Science	2015-05-26	Paper
Polynomial path orders Logical Methods in Computer Science	2013-11-28	Paper
Closing the gap between runtime complexity and polytime computability	2012-04-25	Paper
A path order for rewrite systems that compute exponential time functions	2012-04-24	Paper
A path order for rewrite systems that compute exponential time functions (available as arXiv preprint)	2012-04-24	Paper
POP* and Semantic Labeling Using SAT Interfaces: Explorations in Logic, Language and Computation	2010-08-24	Paper
Complexity analysis by graph rewriting Functional and Logic Programming	2010-05-04	Paper
Dependency Pairs and Polynomial Path Orders Rewriting Techniques and Applications	2009-06-30	Paper
Automated Implicit Computational Complexity Analysis (System Description) Automated Reasoning	2008-11-27	Paper
Complexity Analysis by Rewriting Functional and Logic Programming	2008-04-11	Paper

Research outcomes over time

This page was built for person: Martin Avanzini