Martin Avanzini
Martin Avanzini
Verified email at uibk.ac.at
Title
Cited by
Cited by
Year
Closing the gap between runtime complexity and polytime computability
M Avanzini, G Moser
Proceedings of the 21st International Conference on Rewriting Techniques and …, 2010
662010
Analysing the complexity of functional programs: higher-order meets first-order
M Avanzini, U Dal Lago, G Moser
Proceedings of the 20th ACM SIGPLAN International Conference on Functional …, 2015
602015
Complexity analysis by rewriting
M Avanzini, G Moser
International Symposium on Functional and Logic Programming, 130-146, 2008
532008
A combination framework for complexity
M Avanzini, G Moser
Information and Computation 248, 22-55, 2016
512016
Tyrolean complexity tool: Features and usage
M Avanzini, G Moser
24th International Conference on Rewriting Techniques and Applications (RTA …, 2013
342013
On probabilistic term rewriting
M Avanzini, U Dal Lago, A Yamada
International Symposium on Functional and Logic Programming, 132-148, 2018
302018
TcT: Tyrolean complexity tool
M Avanzini, G Moser, M Schaper
International Conference on Tools and Algorithms for the Construction and …, 2016
302016
Dependency pairs and polynomial path orders
M Avanzini, G Moser
International Conference on Rewriting Techniques and Applications, 48-62, 2009
292009
Complexity analysis by graph rewriting
M Avanzini, G Moser
International Symposium on Functional and Logic Programming, 257-271, 2010
242010
Automated implicit computational complexity analysis (system description)
M Avanzini, G Moser, A Schnabl
International Joint Conference on Automated Reasoning, 132-138, 2008
222008
A new order-theoretic characterisation of the polytime computable functions
M Avanzini, N Eguchi, G Moser
Theoretical computer science 585, 3-24, 2015
212015
Polynomial path orders
M Avanzini, G Moser
arXiv preprint arXiv:1309.2394, 2013
192013
Automating sized-type inference for complexity analysis
M Avanzini, U Dal Lago
Proceedings of the ACM on Programming Languages 1 (ICFP), 1-29, 2017
182017
Verifying polytime computability automatically
M Avanzini
na, 2013
132013
A path order for rewrite systems that compute exponential time functions (technical report)
M Avanzini, N Eguchi, G Moser
arXiv preprint arXiv:1010.1128, 2010
122010
Certification of complexity proofs using CeTA
M Avanzini, C Sternagel, R Thiemann
112015
Type-based complexity analysis of probabilistic functional programs
M Avanzini, U Dal Lago, A Ghyselen
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2019
92019
On sharing, memoization, and polynomial time
M Avanzini, U Dal Lago
Information and Computation 261, 3-22, 2018
62018
Automation of polynomial path orders
M Avanzini
Master’s thesis, University of Innsbruck, Faculty for Computer Science, 2009
62009
Modular Runtime Complexity Analysis of Probabilistic While Programs
M Avanzini, M Schaper, G Moser
arXiv preprint arXiv:1908.11343, 2019
52019
The system can't perform the operation now. Try again later.
Articles 1–20