@article{ABDL:ICFP:21,
 author    = "M. Avanzini and G. Barthe U. {Dal Lago}",
 title     = {{On Continuation-passing Transformations and Expected Cost Analysis}},
 journal   = {{Proceedings of the ACM on Programming Languages}},
 volume    = "5",
 year      = 2021,
 publisher = "Association for Computing Machinery",
}

@inproceedings{AMS:OOPSLA:20,
 author    = "M. Avanzini and G. Moser and M. Schaper",
 title     = {{A Modular Cost Analysis for Probabilistic Programs}},
 year      = 2020,
 pages     = "172:1--172:30",
}

@article{ADLY:SCP:19,
 author    = "M. Avanzini and U. {Dal Lago} and A. Yamada",
 title     = {{On Probabilistic Term Rewriting}},
 journal   = {{Science of Computer Programming}},
 volume    = "185",
 year      = 2019,
 pages     = "102338",
 publisher = "Elsevier",
}

@inproceedings{AGDL:LICS:19,
 author    = "M. Avanzini and A. Ghyselen and U. {Dal Lago}",
 title     = {{Type-Based Complexity Analysis of Probabilistic Functional Programs}},
 booktitle = "Proceedings of the 34th Logics in Computer Science Symposium",
 year      = 2019,
 pages     = "1--13",
 publisher = "IEEE",
}

@inproceedings{ASM:DICE:19,
 author    = "M. Avanzini and M. Schaper and G. Moser",
 title     = {{Modular Runtime Complexity Analysis of Probabilistic While Programs}},
 booktitle = "Proceedings of the Workshop on Developments in Implicit Computational complExity and Workshop on Foundational and Practical Aspects of Resource Analysis 2019",
 year      = 2019,
}

@article{ADL:IC:18,
 author    = "M. Avanzini and U. {Dal Lago}",
 title     = {{On Sharing, Memoization, and Polynomial Time}},
 journal   = {{Information and Computation}},
 volume    = "261, part 1",
 year      = 2018,
 pages     = "3--22",
 publisher = "Elsevier",
}

@inproceedings{ADLY:FLOPS:18,
 author    = "M. Avanzini and U. {Dal Lago} and A. Yamada",
 title     = {{On Probabilistic Term Rewriting}},
 booktitle = "Proceedings of the 14th International Symposium on Functional and Logic Programming",
 series    = "Lecture Notes in Computer Science",
 volume    = "10818",
 year      = 2018,
 pages     = "132--148",
 publisher = "Springer Verlag Heidelberg",
}

@inproceedings{ADL:DICE:17,
 author    = "M. Avanzini and U. Dal Lago",
 title     = {{Automating Size Type Inference and Complexity Analysis}},
 booktitle = "Proceedings of the 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis",
 year      = 2017,
}

@article{ADL:ICFP:17,
 author    = "M. Avanzini and U. {Dal Lago}",
 title     = {{Automating Sized-Type Inference for Complexity Analysis}},
 journal   = {{Proceedings of the ACM on Programming Languages}},
 volume    = "1",
 year      = 2017,
 publisher = "Association for Computing Machinery",
}

@inproceedings{AS:DICE:17,
 author    = "M. Avanzini and M. Schaper",
 title     = {{GUBS Upper Bound Solver}},
 booktitle = "Proceedings of the 17th International Workshop on Developments in Implicit Complexity",
 year      = 2017,
}

@inproceedings{AM:FSCD:16,
 author    = "M. Avanzini and G. Moser",
 title     = {{Complexity of Acyclic Term Graph Rewriting}},
 booktitle = "Proceedings of the 1th International Conference on Formal Structures for Computation and Deduction",
 series    = "Leibnitz International Proceedings in Informatics",
 volume    = "52",
 year      = 2016,
 pages     = "10:1--10:18",
 publisher = "Leibnitz Zentrum für Informatik",
}

@article{AM:IC:13,
 author    = "M. Avanzini and G. Moser",
 title     = {{A Combination Framework for Complexity}},
 journal   = {{Information and Computation}},
 volume    = "248",
 year      = 2016,
 pages     = "22--55",
 publisher = "Elsevier",
}

@inproceedings{AMS:TACAS:16,
 author    = "M. Avanzini and G. Moser and M. Schaper",
 title     = {{TcT: Tyrolean Complexity Tool}},
 booktitle = "Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems",
 series    = "Lecture Notes in Computer Science",
 volume    = "9636",
 year      = 2016,
 pages     = "407--423",
 publisher = "Springer Verlag Heidelberg",
}

@inproceedings{AD:STACS:15,
 author    = "M. Avanzini and U. {Dal Lago}",
 title     = {{On Sharing, Memoization, and Polynomial Time}},
 booktitle = "Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science",
 series    = "Leibnitz International Proceedings in Informatics",
 volume    = "30",
 year      = 2015,
 pages     = "62--75",
 publisher = "Leibnitz Zentrum für Informatik",
}

@inproceedings{ADM:DICE:15,
 author    = "M. Avanzini and U. {Dal Lago} and G. Moser",
 title     = {{Higher-Order Complexity Analysis: Harnessing First-Order Tools.}},
 booktitle = "Proceedings of the 6th International Workshop on Developments in Implicit Complexity",
 year      = 2015,
}

@inproceedings{ADM:ICFP:15,
 author    = "M. Avanzini and U. {Dal Lago} and G. Moser",
 title     = {{Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order}},
 booktitle = "Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming",
 year      = 2015,
 pages     = "152--164",
 publisher = "Association for Computing Machinery",
}

@article{AEM:TCS:15,
 author    = "M. Avanzini and N. Eguchi and G. Moser",
 title     = {{A new Order-theoretic Characterisation of the Polytime Computable Functions}},
 journal   = {{Theoretical Computer Science}},
 volume    = "585",
 year      = 2015,
 pages     = "3--24",
 publisher = "Elsevier",
}

@inproceedings{AST:RTA:15,
 author    = "M. Avanzini and C. Sternagel and R. Thiemann",
 title     = {{Certification of Complexity Proofs using CeTA}},
 booktitle = "Proceedings of the 26th International Conference on Rewriting Techniques and Applications",
 series    = "Leibnitz International Proceedings in Informatics",
 volume    = "36",
 year      = 2015,
 pages     = "23--39",
 publisher = "Leibnitz Zentrum für Informatik",
}

@inproceedings{AE:DICE:14,
 author    = "M. Avanzini and N. Eguchi",
 title     = {{A New Term Rewriting Characterisation of ETIME functions}},
 booktitle = "Proceedings of the 5th International Workshop on Developments in Implicit Complexity",
 year      = 2014,
}

@inproceedings{AF:WST:14,
 author    = "M. Avanzini and B. Felgenhauer",
 title     = {{Type Introduction for Runtime Complexity Analysis}},
 booktitle = "Proceedings of the 14th Workshop on Termination",
 year      = 2014,
}

@article{AM:LMCS:13,
 author    = "M. Avanzini and G. Moser",
 title     = {{Polynomial Path Orders}},
 journal   = {{Logical Methods in Computer Science}},
 volume    = "9",
 year      = 2013,
 publisher = "Leibnitz Zentrum für Informatik",
}

@inproceedings{AM:RTA:13,
 author    = "M. Avanzini and G.Moser",
 title     = {{A Combination Framework for Complexity}},
 booktitle = "Proceedings of the 24th International Conference on Rewriting Techniques and Applications",
 series    = "Leibnitz International Proceedings in Informatics",
 volume    = "21",
 year      = 2013,
 pages     = "55--70",
 publisher = "Leibnitz Zentrum für Informatik",
}

@inproceedings{AM:RTA:13b,
 author    = "M. Avanzini and G.Moser",
 title     = {{Tyrolean Complexity Tool: Features and Usage}},
 booktitle = "Proceedings of the 24th International Conference on Rewriting Techniques and Applications",
 series    = "Leibnitz International Proceedings in Informatics",
 volume    = "21",
 year      = 2013,
 pages     = "71--80",
 publisher = "Leibnitz Zentrum für Informatik",
}

@inproceedings{AMS:WST:13,
 author    = "M. Avanzini and M. Schaper and G. Moser",
 title     = {{Small Polynomial Path Orders in TcT}},
 booktitle = "Proceedings of the 12th Workshop on Termination",
 year      = 2013,
 pages     = "3--7",
}

@phdthesis{Avanzini:Diss:13,
 author    = "M. Avanzini",
 title     = {{Verifying Polytime Computability Automatically}},
 school    = "University of Innsbruck",
 year      = 2013,
}

@inproceedings{FAS:HART:13,
 author    = "B. Felgenhauer and M. Avanzini and C. Sternagel",
 title     = {{A Haskell Library for Term Rewriting}},
 booktitle = "Proceedings of the 1th Workshop on Haskell and Rewriting Techniques",
 year      = 2013,
}

@inproceedings{AEM:APLAS:12,
 author    = "M. Avanzini and N. Eguchi and G. Moser",
 title     = {{A New Order-theoretic Characterisation of the Polytime Computable Functions}},
 booktitle = "Proceedings of the 10th Asian Symposium on Programming Languages and Systems",
 series    = "Lecture Notes in Computer Science",
 volume    = "7705",
 year      = 2012,
 pages     = "280--295",
 publisher = "Springer Verlag Heidelberg",
}

@inproceedings{AEM:WST:12,
 author    = "M. Avanzini and N. Eguchi and G. Moser",
 title     = {{On a Correspondence between Predicative Recursion and Register Machines}},
 booktitle = "Proceedings of the 12th Workshop on Termination",
 year      = 2012,
 pages     = "15--19",
}

@inproceedings{AEM:RTA:11,
 author    = "M. Avanzini and N. Eguchi and G. Moser",
 title     = {{A Path Order for Rewrite Systems that Compute Exponential Time Functions}},
 booktitle = "Proceedings of the 22nd International Conference on Rewriting Techniques and Applications",
 series    = "Leibnitz International Proceedings in Informatics",
 volume    = "10",
 year      = 2011,
 pages     = "123--138",
 publisher = "Leibnitz Zentrum für Informatik",
}

@inproceedings{AE:WST:10,
 author    = "M. Avanzini and N. Eguchi",
 title     = {{A New Path Order for Exponential Time}},
 booktitle = "Proceedings of the 11th Workshop on Termination",
 year      = 2010,
}

@inproceedings{AM:FLOPS:10,
 author    = "M. Avanzini and G. Moser",
 title     = {{Complexity Analysis by Graph Rewriting}},
 booktitle = "Proceedings of the 10th International Symposium on Functional and Logic Programming",
 series    = "Lecture Notes in Computer Science",
 volume    = "6009",
 year      = 2010,
 pages     = "257--271",
 publisher = "Springer Verlag Heidelberg",
}

@inproceedings{AM:RTA:10,
 author    = "M. Avanzini and G.Moser",
 title     = {{Closing the Gap Between Runtime Complexity and Polytime Computability}},
 booktitle = "Proceedings of the 21st International Conference on Rewriting Techniques and Applications",
 series    = "Leibnitz International Proceedings in Informatics",
 volume    = "6",
 year      = 2010,
 pages     = "33--48",
 publisher = "Leibnitz Zentrum für Informatik",
}

@inproceedings{Avanzini:ESSLLI:10,
 author    = "M. Avanzini",
 title     = {{POP* and Semantic Labeling Using SAT}},
 booktitle = "Interfaces: Explorations in Logic, Language and Computation, ESSLLI 2008 and ESSLLI 2009 Student Sessions. Selected Papers.",
 series    = "Lecture Notes in Computer Science",
 volume    = "6211",
 year      = 2010,
 publisher = "Springer Verlag Heidelberg",
}

@inproceedings{AM:RTA:09,
 author    = "M. Avanzini and G.Moser",
 title     = {{Dependency Pairs and Polynomial Path Orders}},
 booktitle = "Proceedings of the 20th International Conference on Rewriting Techniques and Applications",
 series    = "Lecture Notes in Computer Science",
 volume    = "5595",
 year      = 2009,
 pages     = "48--62",
 publisher = "Springer Verlag Heidelberg",
}

@inproceedings{AM:WST:09,
 author    = "M. Avanzini and G. Moser",
 title     = {{Polynomial Path Orders and the Rules of Predicative Recursion with Parameter Substitution}},
 booktitle = "Proceedings of the 10th Workshop on Termination",
 year      = 2009,
 pages     = "16--20",
}

@mastersthesis{Avanzini:Master:09,
 author    = "M. Avanzini",
 title     = {{Automation of Polynomial Path Orders}},
 school    = "University of Innsbruck",
 year      = 2009,
}

@inproceedings{AM:FLOPS:08,
 author    = "M. Avanzini and G. Moser",
 title     = {{Complexity Analysis by Rewriting}},
 booktitle = "Proceedings of the 9th International Symposium on Functional and Logic Programming",
 series    = "Lecture Notes in Computer Science",
 volume    = "5989",
 year      = 2008,
 pages     = "130--146",
 publisher = "Springer Verlag Heidelberg",
}

@inproceedings{AMS:IJCAR:08,
 author    = "M. Avanzini and G. Moser and A. Schnabl",
 title     = {{Automated Implicit Computational Complexity Analysis (System Description)}},
 booktitle = "Proceedings of the 4th International Joint Conference on Automated Reasoning",
 series    = "Lecture Notes in Computer Science",
 volume    = "5195",
 year      = 2008,
 pages     = "132-138",
 publisher = "Springer Verlag Heidelberg",
}

@unpublished{Avanzini:CL:07,
 author    = "M. Avanzini",
 title     = {{Term Rewriting Characterizations of Complexity Classes}},
 year      = 2007,
}