Martin Avanzini

Available identifiers

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	2018-07-09	Paper
On sharing, memoization, and polynomial time	2018-06-14	Paper
Complexity of Acyclic Term Graph Rewriting.	2017-10-17	Paper
https://portal.mardi4nfdi.de/entity/Q5277869	2017-07-12	Paper
Analysing the complexity of functional programs: higher-order meets first-order	2017-05-10	Paper
A Combination Framework for Complexity	2017-02-01	Paper
Tyrolean Complexity Tool: Features and Usage.	2017-02-01	Paper
https://portal.mardi4nfdi.de/entity/Q2954984	2017-01-24	Paper
A combination framework for complexity	2016-05-03	Paper
A new order-theoretic characterisation of the polytime computable functions	2015-05-26	Paper
Polynomial path orders	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
POP* and Semantic Labeling Using SAT	2010-08-24	Paper
Complexity Analysis by Graph Rewriting	2010-05-04	Paper
Dependency Pairs and Polynomial Path Orders	2009-06-30	Paper
Automated Implicit Computational Complexity Analysis (System Description)	2008-11-27	Paper
Complexity Analysis by Rewriting	2008-04-11	Paper

This page was built for person: Martin Avanzini