| 2026 | CAV | Automated Amortised Analysis of Skew Heaps and Leftist Heaps. | Armin Walch, Georg Moser, Berry Schoenmakers, Florian Zuleger |
| 2025 | EMNLP | LaTeXMT: Machine Translation for LaTeX Documents. | Calvin Hoy, Samuel Frontull, Georg Moser |
| 2024 | ESOP | On the Hardness of Analyzing Quantum Programs Quantitatively. | Martin Avanzini, Georg Moser, Romain Pchoux, Simon Perdrix |
| 2024 | MFCS | On Complexity of Confluence and Church-Rosser Proofs. | Arnold Beckmann, Georg Moser |
| 2023 | FSCD | α-Avoidance. | Samuel Frontull, Georg Moser, Vincent van Oostrom |
| 2022 | CAV | Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. | Lorenz Leutgeb, Georg Moser, Florian Zuleger |
| 2022 | LICS | Quantum Expectation Transformers for Cost Analysis. | Martin Avanzini, Georg Moser, Romain Pchoux, Simon Perdrix, Vladimir Zamdzhiev |
| 2021 | CAV | ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures. | Lorenz Leutgeb, Georg Moser, Florian Zuleger |
| 2021 | EDUCON | Teaching Software Quality Assurance with Gamification and Continuous Feedback Techniques. | Georg Moser, Raoul Vallon, Mario Bernhart, Thomas Grechenig |
| 2020 | LOPSTR | Runtime Complexity Analysis of Logically Constrained Rewriting. | Sarah Winkler, Georg Moser |
| 2018 | CADE | MdMax: A Maximal Ordered Completion Tool. | Sarah Winkler, Georg Moser |
| 2018 | FLOPS | Automated Amortised Resource Analysis for Term Rewrite Systems. | Georg Moser, Manuel Schneckenreither |
| 2017 | LPAR | Quantified Boolean Formulas: Call the Plumber! | Josef Lindsberger, Alexander Maringele, Georg Moser |
| 2016 | POPL | The complexity of interaction. | Stphane Gimenez, Georg Moser |
| 2016 | TACAS | TcT: Tyrolean Complexity Tool. | Martin Avanzini, Georg Moser, Michael Schaper |
| 2015 | CiE | On the Computational Content of Termination Proofs. | Georg Moser, Thomas Powell |
| 2015 | ICFP | Analysing the complexity of functional programs: higher-order meets first-order. | Martin Avanzini, Ugo Dal Lago, Georg Moser |
| 2013 | CSL | The Structure of Interaction. | Stphane Gimenez, Georg Moser |
| 2012 | APLAS | A New Order-Theoretic Characterisation of the Polytime Computable Functions. | Martin Avanzini, Naohi Eguchi, Georg Moser |
| 2011 | CADE | On Transfinite Knuth-Bendix Orders. | Laura Kovcs, Georg Moser, Andrei Voronkov |
| 2011 | CloudCom | A Bi-Criteria Truthful Mechanism for Scheduling of Workflows in Clouds. | Hamid Mohammadi Fard, Radu Prodan, Georg Moser, Thomas Fahringer |
| 2010 | FLOPS | Complexity Analysis by Graph Rewriting. | Martin Avanzini, Georg Moser |
| 2010 | LPAR | Characterising Space Complexity Classes via Knuth-Bendix Orders. | Guillaume Bonfante, Georg Moser |
| 2008 | CADE | Automated Implicit Computational Complexity Analysis (System Description). | Martin Avanzini, Georg Moser, Andreas Schnabl |
| 2008 | CADE | Automated Complexity Analysis Based on the Dependency Pair Method. | Nao Hirokawa, Georg Moser |
| 2008 | FLOPS | Complexity Analysis by Rewriting. | Martin Avanzini, Georg Moser |
| 2008 | LPAR | Complexity, Graphs, and the Dependency Pair Method. | Nao Hirokawa, Georg Moser |
| 2006 | LPAR | Derivational Complexity of Knuth-Bendix Orders Revisited. | Georg Moser |
| 2003 | CSL | The Epsilon Calculus (Tutorial). | Georg Moser, Richard Zach |
| 2002 | CSL | On Generalizations of Semi-terms of Particularly Simple Form. | Matthias Baaz, Georg Moser |
| 2001 | CSL | On a Generalisation of Herbrand's Theorem. | Matthias Baaz, Georg Moser |
| 2001 | LPAR | Tableaux for Reasoning About Atomic Updates. | Christian G. Fermller, Georg Moser, Richard Zach |
| 2000 | LPAR | Have Spass with OCC1N | Christian G. Fermller, Georg Moser |
| 1999 | CADE | System Description: CutRes 0.1: Cut Elimination by Resolution. | Matthias Baaz, Alexander Leitsch, Georg Moser |