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, M. Schaper and G. Moser. “Small Polynomial Path Orders in TcT”. 12th Workshop on Termination (WST), pages 3–7, (2013).

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

2009

• Martin Avanzini and Georg Moser. “Dependency Pairs and Polynomial Path Orders”. Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brası́lia, Brazil, June 29 - July 1, 2009, Proceedings, volume 5595 of Lecture Notes in Computer Science, pages 48–62, (2009). Springer.

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

• Martin 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, pages 155–166, (2009). Springer.

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

2007

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