Follow
Martin Avanzini
Martin Avanzini
Verified email at uibk.ac.at
Title
Cited by
Cited by
Year
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
742015
A combination framework for complexity
M Avanzini, G Moser
Information and Computation 248, 22-55, 2016
692016
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
Complexity analysis by rewriting
M Avanzini, G Moser
International Symposium on Functional and Logic Programming, 130-146, 2008
542008
TcT: Tyrolean complexity tool
M Avanzini, G Moser, M Schaper
Tools and Algorithms for the Construction and Analysis of Systems: 22nd …, 2016
442016
Automating sized-type inference for complexity analysis
M Avanzini, U Dal Lago
Proceedings of the ACM on Programming Languages 1 (ICFP), 1-29, 2017
412017
Tyrolean complexity tool: Features and usage
M Avanzini, G Moser
24th International Conference on Rewriting Techniques and Applications (RTA …, 2013
332013
On probabilistic term rewriting
M Avanzini, U Dal Lago, A Yamada
Science of Computer Programming 185, 102338, 2020
282020
On probabilistic term rewriting
M Avanzini, U Dal Lago, A Yamada
Functional and Logic Programming: 14th International Symposium, FLOPS 2018 …, 2018
282018
Dependency pairs and polynomial path orders
M Avanzini, G Moser
International Conference on Rewriting Techniques and Applications, 48-62, 2009
262009
A modular cost analysis for probabilistic programs
M Avanzini, G Moser, M Schaper
Proceedings of the ACM on Programming Languages 4 (OOPSLA), 1-30, 2020
252020
Complexity analysis by graph rewriting
M Avanzini, G Moser
International Symposium on Functional and Logic Programming, 257-271, 2010
242010
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
222019
Polynomial path orders
M Avanzini, G Moser
Logical Methods in Computer Science 9, 2013
222013
Automated implicit computational complexity analysis (system description)
M Avanzini, G Moser, A Schnabl
Automated Reasoning: 4th International Joint Conference, IJCAR 2008 Sydney …, 2008
212008
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
172010
Verifying polytime computability automatically
M Avanzini
na, 2013
162013
Certification of complexity proofs using CeTA
M Avanzini, C Sternagel, R Thiemann
26th International Conference on Rewriting Techniques and Applications, 2015
142015
A new order-theoretic characterisation of the polytime computable functions
M Avanzini, N Eguchi, G Moser
Asian Symposium on Programming Languages and Systems, 280-295, 2012
122012
On continuation-passing transformations and expected cost analysis
M Avanzini, G Barthe, U Dal Lago
Proceedings of the ACM on Programming Languages 5 (ICFP), 1-30, 2021
72021
The system can't perform the operation now. Try again later.
Articles 1–20