Assoc. Prof. Dr. Georg Moser   

Find below a selection of my publications, roughly sepearated into the areas rewriting and proof theory. Selected works have been partially funded by the Austrian Science Fund (FWF) or the European Commission. Further publications can be found here, here, or at DBLP.

resource analysis (selection)

A Combination Framework for Complexity
Martin Avanzini and Georg Moser, Information and Computation, 248:22-55, 2016.
Partly supported by P 25781-N15, the final version is available here.

The Complexity of Interaction
Stéphane Gimenez and Georg Moser, Proceedings of the 43rd Symposium on Principle of Programming Languages, pages 243-255, ACM, 2016.
Partly supported by P 25781-N15, the final version is available here.

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order
Martin Avanzini, Ugo Dal Lago and Georg Moser, Proceedings of the 20th International Conference on Functional Programming, pages 152-164, ACM, 2015.
Partly supported by P 25781-N15, the final version is available here.

Multivariate Amortised Resource Analysis for Term Rewrite Systems
Martin Hofmann, Georg Moser, Proceedings of the 13th International Conference on Typed Lambda Calculus, pages 241-256, 2015.
Partly supported by P 25781-N15.

Polynomial Path Orders
Martin Avanzini and Georg Moser, Logical Methods in Computer Science 9(4), pp. 1 – 42, 2013.
Partly supported by I 603-N15.

Closing the Gap Between Runtime Complexity and Polytime Computability
Martin Avanzini and Georg Moser, Proceedings of the 21st International Conference on Rewriting Techniques and Applications, pages 33-48, volume 6 in LIPIcs, 2010.
Partly supported by P 20133-N18.

The Hydra Battle and Cichon's Principle
Georg Moser, Appl. Algebra Engrg. Comm. Comput., 2009
Mathematical Reviews 2511883 (S. Salehi)
© Springer
Partly supported by P 20133-N18; the final publication is available here.

Proof Theory at Work: Complexity Analysis of Term Rewrite Systems
Georg Moser, Habilitation Thesis. University of Innsbruck, 2009

Complexity Analysis of Term Rewriting Based on Matrix and Context Depdent Interpretations
Georg Moser, Andreas Schnabl and Johannes Waldmann. Proceedings of the Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pages 304-315, 2008.
Partly supported by P 20133-N18.

Automated complexity analysis based on the dependency pair method
Nao Hirokawa and Georg Moser, Proceedings of 4th IJCAR, 2008
© Springer
Partly supported by P 20133-N18; the final publication is available here.

proof theory (selection)

KBOs, Ordinals, Subrecursive Hierarchies and All That
Georg Moser, Journal of Logic and Computations, to appear, 2015.
© Oxford University Press
Partly supported by I 603-N15; the final publication is available here.

Ackermann's substitution method (remixed)
Georg Moser, Annals of Pure and Applied Logic, 2006
Mathematical Reviews 2250535 (M. Yasuhara)
© Elsevier
Supported by HPMF-CT-2002-015777; the final publication is available here.

The Epsilon Calculus and Herbrand Complexity
Georg Moser and Richard Zach, Studia Logica, 2006
Mathematical Reviews 2205042 (M. Yasuhara)
© Springer
The final publication is available here.

Herbrand's Theorem and Term Induction
Matthias Baaz and Georg Moser, Archive of Mathematical Logic, 2006
Mathematical Reviews 2227497 (P. C. Gilmore)
© Springer
Partly supported by HPMF-CT-2002-015777; the final publication is available here.