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.

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. “POP* and Semantic Labeling Using SAT”. (Preprint). Interfaces: Explorations in Logic, Language and Computation, ESSLLI 2008 and ESSLLI 2009 Student Sessions. Selected Papers., volume 6211 of Lecture Notes in Computer Science, 2010. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

2009

• M. Avanzini and G.Moser. “Dependency Pairs and Polynomial Path Orders”. (Preprint). Proceedings of the 20th International Conference on Rewriting Techniques and Applications, volume 5595 of Lecture Notes in Computer Science, pages 48–62, 2009. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

• 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.