2018

• M. Avanzini and U. Dal Lago. “On Sharing, Memoization, and Polynomial Time”. Information and Computation 261, part 1:3–22, 2018. Elsevier. © Creative Commons License - ND.

2015

• M. Avanzini and U. Dal Lago. “On Sharing, Memoization, and Polynomial Time”. Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, volume 30 of Leibnitz International Proceedings in Informatics, pages 62–75, 2015. Leibnitz Zentrum für Informatik. © Creative Commons License - ND.

• M. Avanzini and N. Eguchi and G. Moser. “A new Order-theoretic Characterisation of the Polytime Computable Functions”. Theoretical Computer Science 585:3–24, 2015. Elsevier. © Elsevier.

2014

• M. Avanzini and N. Eguchi. “A New Term Rewriting Characterisation of ETIME functions”. Proceedings of the 5th International Workshop on Developments in Implicit Complexity, 2014.

2013

• M. Avanzini and G. Moser. “Polynomial Path Orders”. Logical Methods in Computer Science 9 (4), 2013. Leibnitz Zentrum für Informatik. © Creative Commons License - ND.

• M. Avanzini. “Verifying Polytime Computability Automatically”. PhD thesis, University of Innsbruck, 2013.

2012

• M. Avanzini and N. Eguchi and G. Moser. “A New Order-theoretic Characterisation of the Polytime Computable Functions”. Proceedings of the 10th Asian Symposium on Programming Languages and Systems, volume 7705 of Lecture Notes in Computer Science, pages 280–295, 2012. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

• M. Avanzini and N. Eguchi and G. Moser. “On a Correspondence between Predicative Recursion and Register Machines”. Proceedings of the 12th Workshop on Termination, pages 15–19, 2012.

2011

• M. Avanzini and N. Eguchi and G. Moser. “A Path Order for Rewrite Systems that Compute Exponential Time Functions”. Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, volume 10 of Leibnitz International Proceedings in Informatics, pages 123–138, 2011. Leibnitz Zentrum für Informatik. © Creative Commons License - ND.

2010

• M. Avanzini and N. Eguchi. “A New Path Order for Exponential Time”. Proceedings of the 11th Workshop on Termination, 2010.

• M. Avanzini and G. Moser. “Complexity Analysis by Graph Rewriting”. (Preprint). Proceedings of the 10th International Symposium on Functional and Logic Programming, volume 6009 of Lecture Notes in Computer Science, pages 257–271, 2010. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

• M. Avanzini and G.Moser. “Closing the Gap Between Runtime Complexity and Polytime Computability”. Proceedings of the 21st International Conference on Rewriting Techniques and Applications, volume 6 of Leibnitz International Proceedings in Informatics, pages 33–48, 2010. Leibnitz Zentrum für Informatik. © Creative Commons License - ND.

2009

• M. Avanzini and G. Moser. “Polynomial Path Orders and the Rules of Predicative Recursion with Parameter Substitution”. Proceedings of the 10th Workshop on Termination, pages 16–20, 2009.

• M. Avanzini. “Automation of Polynomial Path Orders”. Masters thesis, University of Innsbruck, 2009.

2008

• M. Avanzini and G. Moser. “Complexity Analysis by Rewriting”. (Preprint). Proceedings of the 9th International Symposium on Functional and Logic Programming, volume 5989 of Lecture Notes in Computer Science, pages 130–146, 2008. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

• M. Avanzini and G. Moser and A. Schnabl. “Automated Implicit Computational Complexity Analysis (System Description)”. (Preprint). Proceedings of the 4th International Joint Conference on Automated Reasoning, volume 5195 of Lecture Notes in Computer Science, pages 132-138, 2008. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

2007

• M. Avanzini. “Term Rewriting Characterizations of Complexity Classes”.