home > publications > Complexity Analysis

Publications tagged "Complexity Analysis"

Show all.. Download:

2021

2020

2019

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.

  • M. Avanzini and U. Dal Lago and A. Yamada. “On Probabilistic Term Rewriting”. (Preprint). Proceedings of the 14th International Symposium on Functional and Logic Programming, volume 10818 of Lecture Notes in Computer Science, pages 132–148, 2018. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

2017

2016

  • M. Avanzini and G. Moser. “Complexity of Acyclic Term Graph Rewriting”. Proceedings of the 1th International Conference on Formal Structures for Computation and Deduction, volume 52 of Leibnitz International Proceedings in Informatics, pages 10:1–10:18, 2016. Leibnitz Zentrum für Informatik. © Creative Commons License - ND.

  • M. Avanzini and G. Moser. “A Combination Framework for Complexity”. Information and Computation 248:22–55, 2016. Elsevier. © Elsevier.

  • M. Avanzini and G. Moser and M. Schaper. “TcT: Tyrolean Complexity Tool”. (Preprint). Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 9636 of Lecture Notes in Computer Science, pages 407–423, 2016. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

2015

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 and G.Moser. “A Combination Framework for Complexity”. Proceedings of the 24th International Conference on Rewriting Techniques and Applications, volume 21 of Leibnitz International Proceedings in Informatics, pages 55–70, 2013. Leibnitz Zentrum für Informatik. © Creative Commons License - ND.

  • M. Avanzini and G.Moser. “Tyrolean Complexity Tool: Features and Usage”. Proceedings of the 24th International Conference on Rewriting Techniques and Applications, volume 21 of Leibnitz International Proceedings in Informatics, pages 71–80, 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.

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

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.