| 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 | 78 | 2015 |
| A combination framework for complexity M Avanzini, G Moser Information and Computation 248, 22-55, 2016 | 72 | 2016 |
| Closing the gap between runtime complexity and polytime computability M Avanzini, G Moser Proceedings of the 21st International Conference on Rewriting Techniques and …, 2010 | 66 | 2010 |
| Complexity analysis by rewriting M Avanzini, G Moser International Symposium on Functional and Logic Programming, 130-146, 2008 | 56 | 2008 |
| TcT: Tyrolean complexity tool M Avanzini, G Moser, M Schaper Tools and Algorithms for the Construction and Analysis of Systems: 22nd …, 2016 | 44 | 2016 |
| Automating sized-type inference for complexity analysis M Avanzini, U Dal Lago Proceedings of the ACM on Programming Languages 1 (ICFP), 1-29, 2017 | 41 | 2017 |
| 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 | 35 | 2020 |
| Tyrolean complexity tool: Features and usage M Avanzini, G Moser 24th International Conference on Rewriting Techniques and Applications (RTA …, 2013 | 34 | 2013 |
| On probabilistic term rewriting M Avanzini, U Dal Lago, A Yamada Science of Computer Programming 185, 102338, 2020 | 33 | 2020 |
| On probabilistic term rewriting M Avanzini, U Dal Lago, A Yamada Functional and Logic Programming: 14th International Symposium, FLOPS 2018 …, 2018 | 26 | 2018 |
| Dependency pairs and polynomial path orders M Avanzini, G Moser International Conference on Rewriting Techniques and Applications, 48-62, 2009 | 26 | 2009 |
| 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 | 25 | 2019 |
| Complexity analysis by graph rewriting M Avanzini, G Moser International Symposium on Functional and Logic Programming, 257-271, 2010 | 24 | 2010 |
| Polynomial path orders M Avanzini, G Moser Logical Methods in Computer Science 9, 2013 | 22 | 2013 |
| Automated implicit computational complexity analysis (system description) M Avanzini, G Moser, A Schnabl Automated Reasoning: 4th International Joint Conference, IJCAR 2008 Sydney …, 2008 | 21 | 2008 |
| 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 | 17 | 2010 |
| Verifying polytime computability automatically M Avanzini na, 2013 | 16 | 2013 |
| Certification of complexity proofs using CeTA M Avanzini, C Sternagel, R Thiemann 26th International Conference on Rewriting Techniques and Applications, 2015 | 14 | 2015 |
| 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 | 13 | 2021 |
| 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 | 12 | 2012 |
