List of Publications: Predicative Recursion
-
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 U. Dal Lago. “On Sharing, Memoization, and Polynomial Time”. Accepted for publication in Information and Computation.
-
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.
-
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.
-
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 and M. Schaper and G. Moser. “Small Polynomial Path Orders in TcT”. Proceedings of the 12th Workshop on Termination, pages 3–7, 2013.
-
M. Avanzini. “Verifying Polytime Computability Automatically”. PhD thesis, University of Innsbruck, 2013.
-
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.
-
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.
-
M. Avanzini and N. Eguchi. “A New Path Order for Exponential Time”. Proceedings of the 11th Workshop on Termination, 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.
-
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 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.
-
M. Avanzini. “Term Rewriting Characterizations of Complexity Classes”.