2018

• Martin Avanzini and Ugo Dal Lago. “On sharing, memoization, and polynomial time”. Inf. Comput. 261: 3–22 (2018)

2015

• Martin Avanzini and Ugo Dal Lago. “On Sharing, Memoization, and Polynomial Time”. 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany, volume 30 of LIPIcs, pages 62–75, (2015). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

• Martin Avanzini, Naohi Eguchi and Georg Moser. “A new order-theoretic characterisation of the polytime computable functions”. Theor. Comput. Sci. 585: 3–24 (2015)

2014

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

2013

• Martin Avanzini and Georg Moser. “Polynomial Path Orders”. Log. Methods Comput. Sci. 9 (4) (2013) © cc.

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

2012

• Martin Avanzini, Naohi Eguchi and Georg Moser. “A New Order-Theoretic Characterisation of the Polytime Computable Functions”. Programming Languages and Systems - 10th Asian Symposium, APLAS 2012, Kyoto, Japan, December 11-13, 2012. Proceedings, volume 7705 of Lecture Notes in Computer Science, pages 280–295, (2012). Springer.

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

2011

• Martin Avanzini, Naohi Eguchi and Georg Moser. “A Path Order for Rewrite Systems that Compute Exponential Time Functions”. Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, May 30 - June 1, 2011, Novi Sad, Serbia, volume 10 of LIPIcs, pages 123–138, (2011). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2010

• M. Avanzini and N. Eguchi. “A New Path Order for Exponential Time”. 11th Workshop on Termination (WST), (2010).

• Martin Avanzini and Georg Moser. “Complexity Analysis by Graph Rewriting”. Functional and Logic Programming, 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings, volume 6009 of Lecture Notes in Computer Science, pages 257–271, (2010). Springer.

• Martin Avanzini and Georg Moser. “Closing the Gap Between Runtime Complexity and Polytime Computability”. Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010, July 11-13, 2010, Edinburgh, Scottland, UK, volume 6 of LIPIcs, pages 33–48, (2010). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2009

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

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

2008

• Martin Avanzini and Georg Moser. “Complexity Analysis by Rewriting”. Functional and Logic Programming, 9th International Symposium, FLOPS 2008, Ise, Japan, April 14-16, 2008. Proceedings, volume 4989 of Lecture Notes in Computer Science, pages 130–146, (2008). Springer.

• Martin Avanzini, Georg Moser and Andreas Schnabl. “Automated Implicit Computational Complexity Analysis (System Description)”. Automated Reasoning, 4th International Joint Conference, IJCAR 2008, Sydney, Australia, August 12-15, 2008, Proceedings, volume 5195 of Lecture Notes in Computer Science, pages 132–138, (2008). Springer.

2007

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