System Description: CutRes 0.1: Cut Elimination by Resolution. - Matthias Baaz; Alexander Leitsch; Georg Moser (CADE, 1999)

Have Spass with OCC1Ng=. - Christian G. Fermüller; Georg Moser (LPAR, 2000)

On a Generalisation of Herbrand's Theorem. - Matthias Baaz; Georg Moser (CSL, 2001)

Tableaux for Reasoning About Atomic Updates. - Christian G. Fermüller; Georg Moser; Richard Zach (LPAR, 2001)

On Generalizations of Semi-terms of Particularly Simple Form. - Matthias Baaz; Georg Moser (CSL, 2002)

Foreword. - Matthias Baaz; Georg Gottlob; Georg Moser (Theor. Comput. Sci., 2002)

The Epsilon Calculus (Tutorial). - Georg Moser; Richard Zach (CSL, 2003)

Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. - Georg Moser; Andreas Weiermann (RTA, 2003)

Proofs of Termination of Rewrite Systems for Polytime Functions. - Toshiyasu Arai; Georg Moser (FSTTCS, 2005)

Preface. - Arnold Beckmann; Jeremy Avigad; Georg Moser (Ann. Pure Appl. Log., 2005)

Derivational Complexity of Knuth-Bendix Orders Revisited. - Georg Moser (LPAR, 2006)

Herbrand's theorem and term induction. - Matthias Baaz; Georg Moser (Arch. Math. Log., 2006)

Ackermann's substitution method (remixed). - Georg Moser (Ann. Pure Appl. Log., 2006)

The Epsilon Calculus and Herbrand Complexity. - Georg Moser; Richard Zach (Stud Logica, 2006)

The Hydra Battle Revisited. - Nachum Dershowitz; Georg Moser (Rewriting, Computation and Proof, 2007)

Automated Implicit Computational Complexity Analysis (System Description). - Martin Avanzini; Georg Moser; Andreas Schnabl (IJCAR, 2008)

Automated Complexity Analysis Based on the Dependency Pair Method. - Nao Hirokawa; Georg Moser (IJCAR, 2008)

Complexity Analysis by Rewriting. - Martin Avanzini; Georg Moser (FLOPS, 2008)

Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. - Georg Moser; Andreas Schnabl; Johannes Waldmann (FSTTCS, 2008)

Complexity, Graphs, and the Dependency Pair Method. - Nao Hirokawa; Georg Moser (LPAR, 2008)

Proving Quadratic Derivational Complexities Using Context Dependent Interpretations. - Georg Moser; Andreas Schnabl (RTA, 2008)

Dependency Pairs and Polynomial Path Orders. - Martin Avanzini; Georg Moser (RTA, 2009)

The Hydra battle and Cichon's principle. - Georg Moser (Appl. Algebra Eng. Commun. Comput., 2009)

Proof Theory at Work: Complexity Analysis of Term Rewrite Systems - Georg Moser (CoRR, 2009)

Complexity Analysis by Graph Rewriting. - Martin Avanzini; Georg Moser (FLOPS, 2010)

Characterising Space Complexity Classes via Knuth-Bendix Orders. - Guillaume Bonfante; Georg Moser (LPAR (Yogyakarta), 2010)

Closing the Gap Between Runtime Complexity and Polytime Computability. - Martin Avanzini; Georg Moser (RTA, 2010)

Efficient Implementation of Rewriting Revisited Technical Report - Martin Avanzini; Georg Moser (CoRR, 2010)

A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) - Martin Avanzini; Naohi Eguchi; Georg Moser (CoRR, 2010)

On Transfinite Knuth-Bendix Orders. - Laura Kovács; Georg Moser; Andrei Voronkov (CADE, 2011)

Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. - Aart Middeldorp; Georg Moser; Friedrich Neurauter; Johannes Waldmann; Harald Zankl (CAI, 2011)

A Bi-Criteria Truthful Mechanism for Scheduling of Workflows in Clouds. - Hamid Mohammadi Fard; Radu Prodan; Georg Moser; Thomas Fahringer (CloudCom, 2011)

A Path Order for Rewrite Systems that Compute Exponential Time Functions. - Martin Avanzini; Naohi Eguchi; Georg Moser (RTA, 2011)

Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity. - Georg Moser; Andreas Schnabl (RTA, 2011)

The Derivational Complexity Induced by the Dependency Pair Method - Georg Moser; Andreas Schnabl (Log. Methods Comput. Sci., 2011)

A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems - Georg Moser; Michael Schaper (CoRR, 2012)

Polynomial Path Orders: A Maximal Model - Martin Avanzini; Georg Moser (CoRR, 2012)

The Structure of Interaction. - Stéphane Gimenez; Georg Moser (CSL, 2013)

Tyrolean Complexity Tool: Features and Usage. - Martin Avanzini; Georg Moser (RTA, 2013)

Polynomial Path Orders. - Martin Avanzini; Georg Moser (Log. Methods Comput. Sci., 2013)

Amortised Resource Analysis and Typed Polynomial Interpretations. - Martin Hofmann 001; Georg Moser (RTA-TLCA, 2014)

Automated Complexity Analysis Based on Context-Sensitive Rewriting. - Nao Hirokawa; Georg Moser (RTA-TLCA, 2014)

Amortised Resource Analysis and Typed Polynomial Interpretations (extended version). - Martin Hofmann 001; Georg Moser (CoRR, 2014)

On the Computational Content of Termination Proofs. - Georg Moser; Thomas Powell 001 (CiE, 2015)

Analysing the complexity of functional programs: higher-order meets first-order. - Martin Avanzini; Ugo Dal Lago; Georg Moser (ICFP, 2015)

Leftmost Outermost Revisited. - Nao Hirokawa; Aart Middeldorp; Georg Moser (RTA, 2015)

Multivariate Amortised Resource Analysis for Term Rewrite Systems. - Martin Hofmann 001; Georg Moser (TLCA, 2015)

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version). - Martin Avanzini; Ugo Dal Lago; Georg Moser (CoRR, 2015)

The Complexity of Interaction (Long Version). - Stéphane Gimenez; Georg Moser (CoRR, 2015)

A new order-theoretic characterisation of the polytime computable functions. - Martin Avanzini; Naohi Eguchi; Georg Moser (Theor. Comput. Sci., 2015)

The complexity of interaction. - Stéphane Gimenez; Georg Moser (POPL, 2016)

Complexity of Acyclic Term Graph Rewriting. - Martin Avanzini; Georg Moser (FSCD, 2016)

TcT: Tyrolean Complexity Tool. - Martin Avanzini; Georg Moser; Michael Schaper (TACAS, 2016)

Kruskal's Tree Theorem for Acyclic Term Graphs. - Georg Moser; Maria Anna Schett (TERMGRAPH, 2016)

A combination framework for complexity. - Martin Avanzini; Georg Moser (Inf. Comput., 2016)

Quantified Boolean Formulas: Call the Plumber! - Josef Lindsberger; Alexander Maringele; Georg Moser (LPAR, 2017)

Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk). - Georg Moser (FSCD, 2017)

KBOs, ordinals, subrecursive hierarchies and all that. - Georg Moser (J. Log. Comput., 2017)

MædMax: A Maximal Ordered Completion Tool. - Sarah Winkler; Georg Moser (IJCAR, 2018)

Analysis of Logarithmic Amortised Complexity. - Martin Hofmann 001; Georg Moser (CoRR, 2018)

From Jinja bytecode to term rewriting: A complexity reflecting transformation. - Georg Moser; Michael Schaper (Inf. Comput., 2018)

The Epsilon Calculus with Equality and Herbrand Complexity. - Kenji Miyamoto; Georg Moser (CoRR, 2019)

Modular Runtime Complexity Analysis of Probabilistic While Programs. - Martin Avanzini; Michael Schaper; Georg Moser (CoRR, 2019)

Smarter Features, Simpler Learning? - Sarah Winkler; Georg Moser (ARCADE@CADE, 2019)

Runtime Complexity Analysis of Logically Constrained Rewriting. - Sarah Winkler; Georg Moser (LOPSTR, 2020)

A modular cost analysis for probabilistic programs. - Martin Avanzini; Georg Moser; Michael Schaper (Proc. ACM Program. Lang., 2020)

Automated amortised resource analysis for term rewrite systems. - Georg Moser; Manuel Schneckenreither (Sci. Comput. Program., 2020)

ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures. - Lorenz Leutgeb; Georg Moser; Florian Zuleger (CAV (2), 2021)

Teaching Software Quality Assurance with Gamification and Continuous Feedback Techniques. - Georg Moser; Raoul Vallon; Mario Bernhart; Thomas Grechenig (EDUCON, 2021)

Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. - Lorenz Leutgeb; Georg Moser; Florian Zuleger (CAV (2), 2022)

Quantum Expectation Transformers for Cost Analysis. - Martin Avanzini; Georg Moser; Romain Péchoux; Simon Perdrix; Vladimir Zamdzhiev (LICS, 2022)

Type-based analysis of logarithmic amortised complexity. - Martin Hofmann 001; Lorenz Leutgeb; David Obwaller; Georg Moser; Florian Zuleger (Math. Struct. Comput. Sci., 2022)

α-Avoidance. - Samuel Frontull; Georg Moser; Vincent van Oostrom (FSCD, 2023)

Automated Expected Value Analysis of Recursive Programs. - Martin Avanzini; Georg Moser; Michael Schaper (Proc. ACM Program. Lang., 2023)

On the Hardness of Analyzing Quantum Programs Quantitatively. - Martin Avanzini; Georg Moser; Romain Péchoux; Simon Perdrix (ESOP (2), 2024)

A Voting Approach for Explainable Classification with Rule Learning. - Albert Nössig; Tobias Hell; Georg Moser (AIAI (4), 2024)

On Complexity of Confluence and Church-Rosser Proofs. - Arnold Beckmann; Georg Moser (MFCS, 2024)

Rule-Based, Neural and LLM Back-Translation: Comparative Insights from a Variant of Ladin. - Samuel Frontull; Georg Moser (CoRR, 2024)

Rule by Rule: Learning with Confidence through Vocabulary Expansion. - Albert Nössig; Tobias Hell; Georg Moser (CoRR, 2024)

Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs. - Martin Avanzini; Gilles Barthe; Benjamin Grégoire; Georg Moser; Gabriele Vanoni (Proc. ACM Program. Lang., 2024)

Herbrand complexity and the epsilon calculus with equality. - Kenji Miyamoto; Georg Moser (Arch. Math. Log., 2024)

Rule learning by modularity. - Albert Nössig; Tobias Hell; Georg Moser (Mach. Learn., 2024)

To Zip Through the Cost Analysis of Probabilistic Programs. - Matthias Hetzenberger; Georg Moser; Florian Zuleger (CoRR, 2025)