Contributions to Books / Journals

Journal Article (Proceedings Paper)

• 
  Avanzini, Martin; Moser, Georg; Schaper, Michael (2023): Automated Expected Value Analysis of Recursive Programs.
  In: Proceedings of the ACM on Programming Languages 7, pp. 1050 - 1072. (DOI) (Web link)
  
  

Proceedings Article

• 
  Frontull, Samuel; Moser, Georg; van Oostrom, Vincent (2023): α-Avoidance.
  In: Gaboardi, M.; van Raamsdonk, F.: Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik (= Leibniz International Proceedings in Informatics (LIPICS), 260)., ISBN 978-3-95977-277-8, No. 22. (DOI) (Web link)
  
  

Contributions to Books / Journals

Journal Article (Original Paper)

• 
  Frontull, Samuel; Hell, Tobias (2022): Arbeitsbericht: Maschinelle Übersetzung für das Gadertalische.
  In: Ladinia - Sföi Culturâl di Ladins dles Dolomites XLVI, pp. 203 - 232. (DOI) (Web link)
  
  
• 
  Hofmann, Martin; Leutgeb, Lorenz; Obwaller, David; Moser, Georg; Zuleger, Florian (2022): Type-Based Analysis of Logarithmic Amortised Complexity.
  In: Mathematical Structures in Computer Science 32/6, pp. 794 - 826. (DOI) (Web link)
  
  

Proceedings Article

• 
  Avanzini, Martin; Moser, Georg; Péchoux, Romain; Perdix, Simon; Zamdzhiev, Vladimir (2022): Quantum Expectation Transformers for Cost Analysis.
  In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022). Haifa Israel, August 2 - 5, 2022. New York: ACM Digital Library., ISBN 978-1-4503-9351-5, No. 10. (DOI) (Web link)
  
  
• 
  Leutgeb, Lorenz; Moser, Georg; Zuleger, Florian (2022): Automated Expected Amortised Cost Analysis of Probabilistic Data Structures.
  In: Shoham, S.; Vizel, Y.: Computer Aided Verification. 34th International Conference, CAV 2022. Haifa, Israel, August 7–10, 2022, Proceedings, Part II. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 13372)., ISBN 978-3-031-13188-2, pp. 70 - 91. (DOI) (Web link)
  
  
• 
  Schneckenreither, Manuel; Moser, Georg (2022): Average Reward Adjusted Discounted Reinforcement Learning.
  In: Proceedings of the Adaptive and Learning Agents Workshop (ALA 2022). 9 & 10 May 2022, Auckland, NZ. Manchester: EasyChair., No. 21. (Web link)
  
  

Contributions to Books / Journals

Proceedings Article

• 
  Leutgeb, Lorenz; Moser, Georg; Zuleger, Florian (2021): ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures.
  In: Silva, A.; Leino, K. R. M.: Computer Aided Verification. 33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part II. Cham: Springer International Publishing (= Lecture Notes in Computer Science, 12760)., ISBN 978-3-030-81687-2, pp. 99 - 122. (Web link)
  
  
• 
  Winkler, Sarah; Moser, Georg (2021): Runtime Complexity Analysis of Logically Constrained Rewriting.
  In: Fernández, Maribel: Logic-Based Program Synthesis and Transformation. 30th International Symposium, LOPSTR 2020, Bologna, Italy, September 7–9, 2020, Proceedings. Cham: Springer Nature., ISBN 978-3-030-68445-7, pp. 37 - 55. (DOI) (Web link)
  
  

Proceedings Article (Abstract)

• 
  Mitterwallner, Fabian; Hochrainer, Jamie; Middeldorp, Aart (2021): CoCo 2021 Participant:FORT-h1.1.
  In: Proceedings of the 10th International Workshop of Confluence (IWC 2021). published online / Internetpublikation., p. 57. (Web link)
  
  

Contributions to Books / Journals

Journal Article (Original Paper)

• 
  Moser, Georg; Schneckenreither, Manuel (2020): Automated amortised resource analysis for term rewrite systems.
  In: SCIENCE OF COMPUTER PROGRAMMING 185, No. 102306. (DOI) (Web link)
  
  

Journal Article (Proceedings Paper)

• 
  Avanzini, Martin; Moser, Georg; Schaper, Michael (2020): A modular cost analysis for probabilistic programs.
  In: Proceedings of the ACM on Programming Languages 4/OOPLSA, No. 172. (DOI) (Web link)
  
  

Contributions to Books / Journals

Proceedings Article

• 
  Avanzini, Martin; Dal Lago, Ugo; Moser, Georg (2019): Higher-Order Complexity Analysis With First-Order Tools.
  In: Ayala-Rincón, Mauricio; Ghilezan, Silvia; Grue Simonsen, Jakob: Joint Proceedings of HOR 2019 and IWC 2019. (with system descriptions from CoCo 2019). Manchester: EasyChair., pp. 6 - 10. (Web link)
  
  
• 
  Avanzini, Martin; Schaper, Michael; Moser, Georg (2019): Modular Runtime Complexity Analysis of Probabilistic While Programs.
  In: Papers of DICE-FOPARA 2019 Workshop on Developments in Implicit Computational complExity & Foundational & Practical Aspects of Resource Analysis. 6-7 April, 2019. München: Ludwig-Maximlians-Universität München., online. (Web link)
  
  

Proceedings Article (Abstract)

• 
  Moser, Georg; Winkler, Sarah (2019): Smarter Features, Simpler Learning?
  In: ARCADE 2019. Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements. 26 August 2019, Natal, Brasil. New York: ACM Digital Library., online. (Web link)
  
  

Contributions to Books / Journals

Journal Article (Original Paper)

• 
  Moser, Georg; Schaper, Michael (2018): From Jinja bytecode to term rewriting: A complexity reflecting transformation.
  In: INFORMATION AND COMPUTATION 261/1, pp. 116 - 143. (DOI) (Web link)
  
  

Proceedings Article

• 
  Moser, Georg; Schneckenreither, Manuel (2018): Automated Amortised Resource Analysis for Term Rewrite Systems.
  In: Gallagher, J. P.; Sulzmann, M.: Functional and Logic Programming. 14th International Symposium, FLOPS 2018, Nagoya, Japan, May 9–11, 2018, Proceedings. Cham: Springer International Publishing (= Lecture Notes in Computer Science, 10818)., ISBN 978-3-319-90685-0, pp. 214 - 229. (Full-text) (DOI) (Web link)
  
  
• 
  Winkler, Sarah; Moser, Georg (2018): MædMax: A Maximal Ordered Completion Tool.
  In: Galmiche, D.; Schulz, S.; Sebastiani, R.: Automated Reasoning. 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018. Proceedings. Cham: Springer International Publishing (= Lecture Notes in Computer Science, 10900)., ISBN 978-3-319-94204-9, pp. 472 - 480. (DOI) (Web link)
  
  

Proceedings Article (Abstract)

• 
  Moser, Georg; Schaper, Michael (2018): TcT: Tyrolean Complexity Tool.
  In: Salvador, Lucas: Proceeding of the 16th International Workshop on Termination (WST 2018). July 18–19, 2018, Oxford, UK. Oxford: University of Oxford., p. 77. (Web link)
  
  

(Co-)Edited Books

Proceedings (Editorship)

• 
  Bonfante, Guillaume; Moser, Goerg (2017): Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis. USA: Arxiv.org. (DOI) (Web link)
  
  

Contributions to Books / Journals

Journal Article (Original Paper)

• 
  Moser, Georg (2017): KBOs, ordinals, subrecursive hierarchies and all that.
  In: Journal of Logic and Computation 27/2, pp. 469 - 495. (DOI) (Web link)
  
  

Proceedings Article

• 
  Lindsberger, Josef; Maringele, Alexander; Moser, Georg (2017): Quantified Boolean Formulas: Call the Plumber!
  In: Eiter, Thomas; Sands, David: LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Manchester: EasyChair (= EPiC Series in Computing, 46)., pp. 162 - 170. (Web link)
  
  

Contributions to Books / Journals

Journal Article (Original Paper)

• 
  Avanzini, Martin; Moser, Georg (2016): A combination framework for complexity.
  In: INFORMATION AND COMPUTATION 248, pp. 22 - 55. (DOI)
  
  

Journal Article (Proceedings Paper)

• 
  Gimenez, Stephane; Moser, Georg (2016): The Complexity of Interaction.
  In: ACM SIGPLAN Notices 51/1, pp. 243 - 255. (DOI) (Web link)
  
  

Proceedings Article

• 
  Avanzini, Martin; Moser, Georg (2016): Complexity of Acyclic Term Graph Rewriting.
  In: Kesner, Delia; Pientka, Brigitte: 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016). FSCD 2016, June 22–26, 2016, Porto, Portugal. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik (= Leibniz International Proceedings in Informatics (LIPICS), 52)., ISBN 978-3-95977-010-1, Nr. 10. (DOI) (Web link)
  
  
• 
  Avanzini, Martin; Moser, Georg; Schaper, Michael (2016): TcT: Tyrolean Complexity Tool.
  In: Chechik, Marsha; Raskin, Jean-François: Tools and Algorithms for the Construction and Analysis of Systems. 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 9636)., ISBN 978-3-662-49673-2, pp. 407 - 423. (DOI) (Web link)
  
  
• 
  Gimenez, Stéphane; Moser, Georg (2016): The complexity of interaction.
  In: Bodik, Rastislav; Majumdar, Rupak: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. New York: ACM Digital Library., ISBN 978-1-4503-3549-2, pp. 243 - 255. (DOI) (Web link)
  
  
• 
  Moser, Georg; Schett, Maria (2016): Kruskal's Tree Theorem for Acyclic Term Graphs.
  In: Corradini, Andrea; Zantema, Hans: Proceedings 9th International Workshop on Computing with Terms and Graphs (TERMGRAPH 2016). Eindhoven, The Netherlands, April 8, 2016. USA: Arxiv.org., pp. 25 - 34. (DOI) (Web link)
  
  

Proceedings Article (Abstract)

• 
  Avanzini, Martin; Moser, Georg; Schaper, M (2016): TcT: Tyrolean Complexity Tool.
  In: Middeldorp, Aart; Thiemann, René: Proceedings of the 15th International Workshop on Termination (WST 2016). Innsbruck: Universität Innsbruck., Nr. 15. (Web link)
  
  
• 
  Gimenez, Stéphane; Moser, Georg (2016): The Complexity of Interaction.
  In: Mazza, Damiano: Proceedings of the 7th International Workshop on Developments in Implicit Complexity (DICE 2016). Eindhoven: Eindhoven University of Technology., elektronisch. (Web link)
  
  

Contributions to Books / Journals

Journal Article (Original Paper)

• 
  Avanzini, Martin; Eguchi, Naohi; Moser, Georg (2015): A new order-theoretic characterisation of the polytime computable functions.
  In: Theoretical Computer Science, pp. 3 - 24. (DOI) (Web link)
  
  

Journal Article (Proceedings Paper)

• 
  Avanzini, Martin; Dal Lago, Ugo; Moser, Georg (2015): Analysing the complexity of functional programs: higher-order meets first-order.
  In: ACM SIGPLAN Notices 50/9, pp. 152 - 164. (DOI) (Web link)
  
  

Proceedings Article

• 
  Hirokawa, Nao; Middeldorp, Aart; Moser, Georg (2015): Leftmost Outermost Revisited.
  In: Fernández, Maribel: 26th International Conference on Rewriting Techniques and Applications (RTA 2015). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik (= Leibniz International Proceedings in Informatics (LIPICS), 36)., ISBN 978-3-939897-85-9, pp. 209 - 222. (DOI) (Web link)
  
  
• 
  Hofmann, Martin; Moser, Georg (2015): Multivariate Amortised Resource Analysis for Term Rewrite Systems.
  In: Altenkirch, Thorsten: 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015). TLCA’15, July 1–3, 2015, Warsaw, Poland. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik (= Leibniz International Proceedings in Informatics (LIPICS), 38)., ISBN 978-3-939897-87-3, pp. 241 - 256. (DOI) (Web link)
  
  
• 
  Moser, Georg; Powell, Thomas (2015): On the Computational Content of Termination Proofs.
  In: Beckmann, Arnold; Mitrana, Victor; Soskova, Mariya: Evolving Computability. 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings. Cham: Springer International Publishing (= Lecture Notes in Computer Science, 9136)., ISBN 978-3-319-20027-9, pp. 276 - 285. (DOI) (Web link)
  
  

Contributions to Books / Journals

Proceedings Article

• 
  Hirokawa, Nao; Moser, Georg (2014): Automated Complexity Analysis Based on Context-Sensitive Rewriting.
  In: Dowek, Gilles: Rewriting and Typed Lambda Calculi. Joint International Conference, RTA-TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 8560)., ISBN 978-3-319-08917-1, pp. 257 - 271. (DOI) (Web link)
  
  
• 
  Hofman, Martin; Moser, Georg (2014): Amortised Resource Analysis and Typed Polynomial Interpretations.
  In: Dowek, Gilles: Rewriting and Typed Lambda Calculi. Joint International Conference, RTA-TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 8560)., ISBN 978-3-319-08917-1, pp. 272 - 286. (DOI) (Web link)
  
  

(Book) Reviews

Journal Article (Book Review)

• 
  Moser, Georg (2014): Ketema, Jeroen; Simonsen, Jakob Grue. Least upper bounds on the size of confluence and Church-Rosser diagrams in term rewriting and λ-calculus. ACM Trans. Comput. Log. 14 (2013), no. 4, Art. 31.
  In: Mathematical Reviews, MR3144935. (Web link)
  
  

Contributions to Books / Journals

Journal Article (Original Paper)

• 
  Avanzini, Martin; Moser, Georg (2013): Polynomial Path Orders.
  In: Logical Methods in Computer Science 9/4, Paper 9. (DOI) (Web link)
  
  

Proceedings Article

• 
  Avanzini, Martin; Moser, Georg (2013): A Combination Framework for Complexity.
  In: van Raamsdonk, Femke: 24th International Conference on Rewriting Techniques and Applications (RTA 2013). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik (= Leibniz International Proceedings in Informatics (LIPICS), 21)., ISBN 978-3-939897-53-8, pp. 55 - 70. (DOI) (Web link)
  
  
• 
  Avanzini, Martin; Moser, Georg (2013): Tyrolean Complexity Tool: Features and Usage.
  In: van Raamsdonk, Femke: 24th International Conference on Rewriting Techniques and Applications (RTA 2013). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik (= Leibniz International Proceedings in Informatics (LIPICS), 21)., ISBN 978-3-939897-53-8, pp. 71 - 80. (DOI) (Web link)
  
  
• 
  Avanzini, Martin; Moser, Georg; Schaper, Michael (2013): Small Polynomial Path Orders in TCT.
  In: Waldmann, Johannes: Proceedings of the 13th International Workshop on Termination (WST 2013). WST 2013, August 29-31, 2013, Bertinoro, Italy. published online / Internetpublikation., pp. 3 - 7. (Web link)
  
  
• 
  Gimenez, Stéphane; Moser, Georg (2013): The Structure of Interaction.
  In: Ronchi Della Rocca, Simona: Computer Science Logic 2013 (CSL 2013). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik (= Leibniz International Proceedings in Informatics (LIPICS), 23)., ISBN 978-3-939897-60-6, pp. 316 - 331. (DOI) (Web link)
  
  

(Co-)Edited Books

Proceedings (Editorship)

• 
  Moser, Georg (ed.) (2012): Proceedings of the 12th International Workshop on Termination (WST 2012). February 19–23, 2012, Obergurgl, Austria. Innsbruck: Eigenverlag - Universität Innsbruck. (Web link)
  
  

Contributions to Books / Journals

Proceedings Article

• 
  Avanzini, Martin; Eguchi, Naohi; Moser, Georg (2012): A New Path Order that Induces Tight Polynomial Derivation Lengths.
  In: Proceedings of the 3rd International Workshop on Developments in Implicit Complexity (DICE 2012). Tallinn: Tallinn University of Technology Press., elektronisch. (Web link)
  
  
• 
  Avanzini, Martin; Eguchi, Naoho; Moser, Georg (2012): A New Order-theoretic Characterisation of the Polytime Computable Functions.
  In: Jhala, Ranjit; Igarashi, Atsushi (Eds.): Programming Languages and Systems. 10th Asian Symposium, APLAS 2012, Kyoto, Japan, December 11-13, 2012, Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 7705)., ISBN 978-3-642-35181-5, pp. 280 - 295. (DOI)
  
  
• 
  Fard, Hamid Mohammadi; Prodan, Radu; Moser, Georg; Fahringer, Thomas (2012): A Bi-Criteria Truthful Mechanism for Scheduling of Workflows in Clouds.
  In: Proceedings of the 3rd IEEE International Conference on Cloud Computing Technology and Science (Cloudcom 2011). 29 November-1 December 2011, Athens, Greece. Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE)., ISBN 978-0-7695-4622-3, pp. 599 - 605. (DOI) (Web link)
  
  

Proceedings Article (Abstract)

• 
  Avanzini, Martin; Eguchi, Naohi; Moser, Georg (2012): On a Correspondence between Predicative Recursion and Register Machines.
  In: Moser, Georg (ed.): Proceedings of the 12th International Workshop on Termination (WST 2012). February 19–23, 2012, Obergurgl, Austria. Innsbruck: Eigenverlag - Universität Innsbruck., pp. 15 - 19. (Web link)
  
  
• 
  Moser, Georg; Schaper, Michael (2012): Termination Graphs Revisited.
  In: Moser, Georg (ed.): Proceedings of the 12th International Workshop on Termination (WST 2012). February 19–23, 2012, Obergurgl, Austria. Innsbruck: Eigenverlag - Universität Innsbruck., pp. 64 - 68. (Web link)
  
  

Contributions to Books / Journals

Journal Article (Original Paper)

• 
  Moser, Georg; Schnabl, Andreas (2011): The Derivational Complexity Induced by the Dependency Pair Method.
  In: Logical Methods in Computer Science 3/7, pp. 1 - 38. (Web link)
  
  

Proceedings Article

• 
  Avanzini, Martin; Eguchi, Naohi; Moser, Georg (2011): A Path Order for Rewrite Systems that Compute Exponential Time Functions.
  In: Schmidt-Schauß, Manfred (ed.): 22nd International Conference on Rewriting Techniques and Applications (RTA'11). May 30 - June 1, 2011, Novi Sad, Serbia. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik (= Leibniz International Proceedings in Informatics (LIPICS), 10)., ISBN 978-3-939897-30-9, pp. 123 - 138. (DOI)
  
  
• 
  Kovacs, Laura; Moser, Georg; Voronkov, Andrei (2011): On Transfinite Knuth-Bendix Orders.
  In: Bjørner, Nikolaj; Sofronie-Stokkermans, Viorica (Eds.): Automated Deduction - CADE 23. 23rd International Conference on Automated Deduction, Wrocław, Poland, July 31 - August 5, 2011. Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 6803)., ISBN 978-3-642-22437-9, Vol. 6803/2011, pp. 384 - 398. (DOI)
  
  
• 
  Middeldorp, Aart; Moser, Georg; Neurauter, Friedrich; Waldmann, Johannes; Zankl, Harald (2011): Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems.
  In: Winkler, Franz (Ed.): Algebraic Informatics. 4th International Conference, CAI 2011, Linz, Austria, June 21-24, 2011, Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 6742)., ISBN 978-3-642-21492-9, pp. 1 - 20. (DOI)
  
  
• 
  Moser, Georg; Schnabl, Andreas (2011): Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity.
  In: Schmidt-Schauß, Manfred (ed.): 22nd International Conference on Rewriting Techniques and Applications (RTA'11). May 30 - June 1, 2011, Novi Sad, Serbia. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik (= Leibniz International Proceedings in Informatics (LIPICS), 10)., ISBN 978-3-939897-30-9, pp. 235 - 250. (DOI)
  
  

(Book) Reviews

Journal Article (Book Review)

• 
  Moser, Georg (2011): Gordeev, L.(D-TBNG); Haeusler, E. H.(BR-PCRJ); Pereira, L. C.(BR-PCRJ): Propositional proof compressions and DNF logic. Log. J. IGPL 19 (2011), no. 1, 62–86.
  In: Mathematical Reviews, MR2770567. (Web link)
  
  
• 
  Moser, Georg (2011): Takai, Toshinori(J-NAISTTO-VS); Kaji, Yuichi(J-NSTGI); Seki, Hiroyuki(J-NSTGI): Right-linear finite path overlapping rewrite systems effectively preserve recognizability. Sci. Math. Jpn. 71 (2010), no. 2, 127–153.
  In: Mathematical Reviews 2011h/68089, MR2640469. (Web link)
  
  

Contributions to Books / Journals

Proceedings Article

• 
  Avanzini, Martin; Moser, Georg (2010): Closing the Gap Between Runtime Complexity and Polytime Computability.
  In: Lynch, Chris (ed.): Proceedings of the 21st International Conference on Rewriting Techniques and Applications. RTA’10, July 11–13, 2010, Edinburgh, UK. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik (= Leibniz International Proceedings in Informatics (LIPICS), 6)., ISBN 978-3-939897-18-7, pp. 33 - 48. (DOI)
  
  
• 
  Avanzini, Martin; Moser, Georg (2010): Complexity Analysis by Graph Rewriting.
  In: Blume, Matthias; Kobayashi, Naoki; Vidal, German (Eds.): Functional and Logic Programming. 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010, Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 6009)., ISBN 978-3-642-12250-7, pp. 257 - 271. (DOI)
  
  
• 
  Bonfante, Guillaume; Moser, Georg (2010): Characterising Space Complexity Classes via Knuth-Bendix Orders.
  In: Fermüller, Chris; Voronkov, Andrei (eds.): Logic for Programming, Artificial Intelligence, and Reasoning. 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 6397)., ISBN 978-3-642-16241-1, pp. 142 - 156. (DOI)
  
  

Proceedings Article (Abstract)

• 
  Schnabl, Andreas; Moser, Georg (2010): Dependency Graphs, Relative Rule Removal, the Subterm Criterion and Derivational Complexity.
  In: Schneider-Kamp, Peter (ed.): Proceedings of the 11th International Workshop on Termination (WST 2010). Edinburgh, July 14-15, 2010. Edinburgh: University of Edinburgh. (Web link)
  
  

(Book) Reviews

Journal Article (Book Review)

• 
  Moser, Georg (2010): Vágvölgyi, Sándor(H-SZEG-FC): Congruences generated by extended ground term rewrite systems. Fund. Inform. 95 (2009), no. 2-3, 381–399.
  In: Mathematical Reviews, MR2572211. (Web link)
  
  

Contributions to Books / Journals

Journal Article (Original Paper)

• 
  Moser, Georg (2009): The Hydra battle and Cichon’s principle.
  In: APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING 20/2, pp. 133 - 158. (DOI)
  
  

Proceedings Article

• 
  Avanzini, Martin; Moser, Georg (2009): Dependency Pairs and Polynomial Path Orders.
  In: Treinen, Ralf (ed.): Rewriting Techniques and Applications. 20th International Conference, RTA 2009, Brasilia, Brazil, June 29- July 1, 2009, Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 5595)., ISBN 978-3-642-02347-7, pp. 48 - 62. (DOI)
  
  
• 
  Moser, Georg; Schnabl, Andreas (2009): The Derivational Complexity Induced by the Dependency Pair Method.
  In: Treinen, Ralf (ed.): Rewriting Techniques and Applications. 20th International Conference, RTA 2009, Brasilia, Brazil, June 29- July 1, 2009, Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 5595)., ISBN 978-3-642-02347-7, pp. 255 - 269. (DOI)
  
  

Proceedings Article (Abstract)

• 
  Avanzini, Martin; Moser, Georg (2009): Polynomial Path Orders and the Rules of Predictive Recursion with Parameter Substitution.
  In: Geser, Alfons (ed.): 10th International Workshop on Termination (WST 2009), Proceedings. Eigenverlag., pp. 16 - 19. (Web link)
  
  
• 
  Hirokawa, Nao; Moser, Georg (2009): The Subterm Criterion in Complexity Analysis.
  In: Geser, Alfons (ed.): 10th International Workshop on Termination (WST 2009), Proceedings. Eigenverlag., pp. 47 - 50. (Web link)
  
  

Contributions to Books / Journals

Proceedings Article

• 
  Avanzini, Martin; Moser, Georg (2008): Complexity Analysis by Rewriting.
  In: Garrigue, Jacques (Hrsg.): 9th International Symposium on Functional and Logic Programming (FLOPS 2008). Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 4989)., ISBN 978-3-540-78968-0, Vol. 4989, pp. 130 - 146. (Web link)
  
  
• 
  Avanzini, Martin; Moser, Georg; Schnabl, Andreas (2008): Automated Implicit Computational Complexity Analysis.
  In: Armando, Alessandro; Baumgartner, Peter; Dowek, Gilles (Hrsg.): Automated Reasoning. 4th International Joint Conference, IJCAR 2008 Sydney, Australia, August 12-15, 2008 Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Artificial Intelligence, 5195)., ISBN 978-3-540-71069-1, pp. 132 - 138. (Web link)
  
  
• 
  Hirokawa, Nao; Moser, Georg (2008): Automated Complexity Analysis Based on the Dependency Pair Method.
  In: Armando, Alessandro; Baumgartner, Peter; Dowek, Gilles (Hrsg.): Automated Reasoning. 4th International Joint Conference, IJCAR 2008 Sydney, Australia, August 12-15, 2008 Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Artificial Intelligence, 5195)., ISBN 978-3-540-71069-1, pp. 364 - 379. (Web link)
  
  
• 
  Hirokawa, Nao; Moser, Georg (2008): Complexity, Graphs, and the Dependency Pair Method.
  In: Cervesato, Iliano; Veith, Helmut; Voronkov, Andrei: Logic for Programming, Artificial Intelligence, and Reasoning. 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Artificial Intelligence, 5330)., ISBN 978-3-540-89438-4, pp. 652 - 666. (Web link)
  
  
• 
  Moser, Georg; Schnabl, Andreas (2008): Proving Quadratic Derivational Complexities using Context Dependent Interpretations.
  In: Voronkov, Andrei (Hrsg.): Rewriting Techniques and Applications. Proceedings of the 19th International Conference on Rewriting Techniques and Applications, July 15-17, 2008, Hagenberg, Austria. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 5117)., ISBN 978-3-540-70588-8, pp. 276 - 290. (Web link)
  
  
• 
  Moser, Georg; Schnabl, Andreas; Waldmann, Johannes (2008): Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations.
  In: Hariharan, Ramesh; Mukund, Madhavan; Vinay, V (Eds.): Foundations of Software Technology and Theoretical Computer Science. International Conference, FSTTCS 2008, Bangalore, India, December 9-December 11, 2008. Proceedings. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik., ISBN 978-3-939897-08-8, pp. 304 - 315. (Web link)
  
  

Contributions to Books / Journals

Book Chapter (Original Paper)

• 
  Moser, Georg; Dershowitz, Nachum (2007): The Hydra Battle Revisited.
  In: Comon-Lundh, H.; Kirchner, C.; Kirchner, H. (Eds.): Rewriting, Computation and Proof. Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 4600)., ISBN 978-3540731467, pp. 1 - 27.
  
  

Contributions to Books / Journals

Journal Article (Original Paper)

• 
  Baaz, Matthias; Moser, Georg (2006): Herbrand's theorem and term induction.
  In: Archive for Mathematical Logic 45/4, pp. 447 - 503. (DOI) (Web link)
  
  
• 
  Moser, Georg (2006): Ackermann's substitution method (remixed).
  In: Annals of Pure and Applied Logic 142/1-3, pp. 1 - 18. (DOI) (Web link)
  
  
• 
  Moser, Georg; Zach, Richard (2006): The Epsilon Calculus and Herbrand Complexity.
  In: Studia Logica 82/1, pp. 133 - 155. (DOI) (Web link)
  
  

Proceedings Article

• 
  Moser, Georg (2006): Derivational Complexity of Knuth-Bendix Orders Revisited.
  In: Hermann, Miki; Voronkov, Andrei: Logic for Programming, Artificial Intelligence, and Reasoning. 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 4246)., ISBN 978-3540482819, pp. 75 - 89.
  
  

(Co-)Edited Journals and Book Series

(Co-)Editorship of Book Series and Journals

• 
  Moser, Georg: Guest editor - Annals of Pure and Applied Logic, 2004-06-01 - 2005-10-01.
  
  

Contributions to Books / Journals

Proceedings Article

• 
  Arai, Toshiyasu; Moser, Georg (2005): Proofs of Termination of Rewrite Systems for Polytime Functions.
  In: Ramanujam, Ramaswamy (ed.): FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science: 25th International Conference, Hyderabad, India, December 15-18, 2005. Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 3821)., ISBN 3-540-30495-9, pp. 529 - 540.
  
  

(Co-)Edited Journals and Book Series

(Co-)Editorship of Book Series and Journals

• 
  Moser, Georg: Guest editor - Annals of Pure and Applied Logic, 2004-06-01 - 2005-10-01.
  
  

Contributions to Books / Journals

Proceedings Article

• 
  Arai, Toshiyasu; Moser, Georg (2004): Slowgrowing and PTIME.
  In: Codish, Michael; Middeldorp, Aart (eds.): WST'04, 7th International Workshop on Termination. Eigenverlag., pp. 10 - 13.
  
  

(Book) Reviews

Journal Article (Book Review)

• 
  Moser, Georg (2004): Review: Three Papers by Andreas Weiermann.
  In: Bulletin of Symbolic Logic 10/4, pp. 588 - 590. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Kammar, Ohad Co-author(s): Moser, Georg: Semantic foundations of potential-synthesis for expected amortised-cost analysis.
  11th ACM SIGPLAN Workshop on Higher-Order Programming with Effects (HOPE@ICFP 2023), Seattle, 2023-09-04 (Online). (Web link)
  
  
• 
  Lecturer(s): Moser, Georg Co-author(s): Avanzini, Martin; Schaper, Michael: Automated Expected Value Analysis of Recursive Programs.
  PLDI 2023 - Programming Language Design and Implementation, Orlando, 2023-06-20. (Web link)
  
  

Lecture at Summer-/Winterschool

• 
  Lecturer(s): Moser, Georg: Cichon's Conjecture and other Fallacies.
  Autumn school "Proof and Computation", Herrsching, 2023-09-11. (Web link)
  
  

Guest Lectures

Guest Lecture

• 
  Lecturer(s): Moser, Georg: Automated Expected Cost Analysis of Splaying et al.
  Carnegie Mellon University, Pittsburgh, 2023-06-08. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Avanzini, Martin Co-author(s): Moser, Georg; Péchoux, Romain; Perdrix, Simon: Quantum Expectation Transformers for Cost Analysis.
  Quantum Physics and Logic (QPL 2022), Oxford, 2022-06-30. (Web link)
  
  
• 
  Lecturer(s): Leutgeb, Lorenz Co-author(s): Moser, Georg; Zuleger, Florian: Automated Expected Amortised Cost Analysis of Probabilistic Data Structures.
  34th International Conference on Computer Aided Verification (CAV 2022), Haifa, 2022-08-08. (Web link)
  
  
• 
  Lecturer(s): Schneckenreither, Manuel Co-author(s): Moser, Georg: Average Reward Adjusted Discounted Reinforcement Learning.
  Adaptive and Learning Agents Workshop (ALA 2022), Auckland, 2022-05-10. (Web link)
  
  
• 
  Lecturer(s): Zamdzhiev, Vladimir Co-author(s): Avanzini, Martin; Moser, Georg; Péchoux, Romain; Perdrix, Simon: Quantum Expectation Transformers for Cost Analysis.
  37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), Haifa, 2022-08-02. (Web link)
  
  

Lecture at Project Meeting / Research Cooperation Meeting

• 
  Lecturer(s): Frontull, Samuel: Machine Translation for a Low-Resource Language.
  Austauschworkshop: KI-Dienste der Allianz Private Krankenversicherungs-Aktiengesellschaft (APVK) und UIBK, München, 2022-08-03.
  
  
• 
  Lecturer(s): Hell, Tobias; Antholzer, Stephan; Nössig, Albert; Frontull, Samuel: Aktuelle Projektergebnisse, Herausforderungen, Diskussion.
  Austauschworkshop: KI-Dienste der Allianz Private Krankenversicherungs-Aktiengesellschaft (APVK) und UIBK, München, 2022-08-03.
  
  
• 
  Lecturer(s): Nössig, Albert: Rule Learning by Modularity.
  Austauschworkshop: KI-Dienste der Allianz Private Krankenversicherungs-Aktiengesellschaft (APVK) und UIBK, München, 2022-08-03.
  
  

Guest Lectures

Guest Lecture

• 
  Lecturer(s): Frontull, Samuel: Maschinelle Übersetzung für die ladinische Sprache.
  Universität Innsbruck - Institut für Translationswissenschaft, Innsbruck, 2022-06-13. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Automated Expected Cost Analysis of Splaying et al.
  The University of Edinburgh, Edinburgh, 2022-10-28. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Formal Methods for Quantum Programs.
  Theoriekolloquium des Instituts für Theoretische Physik, Innsbruck, 2022-03-23. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Leutgeb, Lorenz Co-author(s): Moser, Georg; Zuleger, Florian: ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures.
  33rd International Conference on Computer-Aided Verification (CAV 2021), Los Angeles (online), 2021-07-22. (Web link)
  
  

Guest Lectures

Guest Lecture

• 
  Lecturer(s): Moser, Georg: Automated Analysis of Splaying et al.
  Università di Bologna / University of Bologna / Universität Bologna, Bologna, 2021-05-18. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Herbrand Complexity and Hilbert's Epsilon Calculus.
  The Proof Society, 2021-01-20. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Moser, Georg Co-author(s): Avanzini, Martin; Schaper, Michael: A modular cost analysis for probabilistic programs.
  2020 ACM SIGPLAN International conference on Systems, Programming, Languages, and Applications: Software for Humanity (virtual), Chicago, 2020-11-21. (Web link)
  
  

Lecture at Summer-/Winterschool

• 
  Lecturer(s): Moser, Georg: Static Complexity Analysis.
  Caleidoscope: Complexity as a Kaleidoscope. Research school in computational complexity, Paris, 2020-06-15. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Lecture)

• 
  Lecturer(s): Avanzini, Martin Co-author(s): Moser, Georg; Dal Lago, Ugo: Higher-Order Complexity Analysis With First-Order Tools.
  10th International Workshop on Higher-Order Rewriting (HOR 2019), Dortmund, 2019-06-28. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Hibert's epsilon calculus with equality and Herbrand complexity.
  Workshop on Proof Theory, Modal Logic and Reflection Principles (WORMSHOP 2019), Barcelona, 2019-11-08. (Web link)
  
  

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Avanzini, Martin Co-author(s): Schaper, Michael; Moser, Georg: Modular Runtime Complexity Analysis of Probabilistic While Programs.
  Workshop on Developments in Implicit Computational complExity & Foundational & Practical Aspects of Resource Analysis (DICE-FOPARA 2019), Prag, 2019-04-07. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Higher-order Complexity Theory and its Applications.
  Shonan Meeting 151: Higher-order Complexity Theory and its Applications, Tokio, 2019-10-08. (Web link)
  
  
• 
  Lecturer(s): Winkler, Sarah Co-author(s): Moser, Georg: Smarter Features, Simpler Learning?
  2nd International ARCADE (Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements) Workshop, Natal, 2019-08-26. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Schneckenreither, Manuel Co-author(s): Moser, Georg: Automated Amortised Resource Analysis for Term Rewrite Systems.
  14th International Symposium on Functional and Logic Programming (FLOPS 2018), Nagoya, 2018-05-10. (Web link)
  
  
• 
  Lecturer(s): Winkler, Sarah Co-author(s): Moser, Georg: MaedMax: A Maximal Ordered Completion Tool.
  9th International Joint Conference on Automated Reasoning (IJCAR 2018), Oxford, 2018-07-17. (Web link)
  
  

Lecture at Project Meeting / Research Cooperation Meeting

• 
  Lecturer(s): Miyanoto, Kenji Co-author(s): Moser, Georg: The epsilon calculus with equality and Herbrand complexity.
  FISP Workshop (3rd FISP Meeting), Wien, 2018-12-08. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Plenary / Keynote Lecture)

• 
  Lecturer(s): Moser, Georg: Uniform Resource Analysis by Rewriting: Strengths and Weaknesses.
  2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017), Oxford, 2017-09-05. (Web link)
  
  

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Moser, Georg: Weighted Automata Theory for Resource Analysis of Rewrite Systems.
  Dagstuhl Seminar 17291: Resource Bound Analysis, Dagstuhl, 2017-07-20. (Web link)
  
  

Lecture at Summer-/Winterschool

• 
  Lecturer(s): Moser, Georg: Epsilon Calculus I.
  International Summer School for Proof Theory in First-Order Logic, Funchal, 2017-08-22. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Moser, Georg: Complexity of acyclic term graph rewriting.
  Workshop: Logic, Complexity and Automation (LCA / LC&A 2016), Obergurgl, 2016-09-05. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg Co-author(s): Avanzini, Martin: Complexity of Term Graph Rewriting.
  1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016), Porto, 2016-06-25. (Web link)
  
  
• 
  Lecturer(s): Schaper, Michael Co-author(s): Avanzini, Martin; Moser, Georg: TcT: Tyrolean Complexity Tool.
  22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2016), Eindhoven, 2016-04-05. (Web link)
  
  
• 
  Lecturer(s): Schett, Maria Co-author(s): Moser, Georg: Kruskal's Tree Theorem for Term Graphs.
  9th International Workshop Computing with Terms and Graphs (TERMGRAPH 2016), Eindhoven, 2016-04-08. (Web link)
  
  

Lecture at Summer-/Winterschool

• 
  Lecturer(s): Moser, Georg: Automatic resource analysis of programs.
  Twelfth International Tbilisi Summer School in Logic and Language 2016, Tblisi / Tiflis, 2016-09-15. (Web link)
  
  

Lecture at Project Meeting / Research Cooperation Meeting

• 
  Lecturer(s): Moser, Georg: The Embedding Lemma Revisited.
  The Fine Structure of Formal Proof Systems and their Computational Interpretations Kick-Off Meeting (FISP 2016), Innsbruck, 2016-11-17. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Lecture)

• 
  Lecturer(s): Moser, Georg: The Epsilon Theorems: Simple Things Made Simple.
  Workshop on EFFICIENT AND NATURAL PROOF SYSTEMS, Bath, 2015-12-16. (Web link)
  
  

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Hirokawa, Nao Co-author(s): Middeldorp, Aart; Moser, Georg: Leftmost Outermost Revisited.
  International Conference on Rewriting, Deduction, and Programming (RDP 2015), Warsaw/Warschau, 2015-06-30. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Why Ordinals are Sometimes Good for You.
  42nd TRS Meeting, Tokyo, 2015-02-08. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg Co-author(s): Hofmann, Martin: Multivariate Analysis.
  International Conference on Rewriting, Deduction, and Programming (RDP 2015), Warsaw/Warschau, 2015-07-02. (Web link)
  
  
• 
  Lecturer(s): Powell, Thomas Co-author(s): Moser, Georg: On the Computational Content of Termination Proofs.
  Computability in Europe (CiE 2015) - Evolving Computability, Bukarest / Bucharest, 2015-06-30. (Web link)
  
  

Lecture at Summer-/Winterschool

• 
  Lecturer(s): Moser, Georg: Termination and Complexity.
  8th International School on Rewriting (ISR 2015), Leipzig, 2015-08-10. (Web link)
  
  

Guest Lectures

Guest Lecture

• 
  Lecturer(s): Moser, Georg: Amortised Cost Analysis and Term Rewrite Systems.
  National Institute of Informatics, Tokyo, 2015-02-13. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg Co-author(s): Middeldorp, Aart; Zankl, Harald: Weighted Automata Theory of Complexity Analysis of Rewrite Systems.
  JAIST (Japan Advanced Institute for Science and Technology), Kanazawa, 2015-08-01. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg Co-author(s): Middeldorp, Aart; Zankl, Harald: Weighted Automata Theory for Complexity Analysis of Rewrite Systems.
  Max-Planck-Institut für Informatik, Saarbrücken, 2015-03-24. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Lecture)

• 
  Lecturer(s): Moser, Georg: Weighted Automata Theory for Complexity Analysis of Rewrite Systems.
  15th International Workshop on Logic and Computational Complexity (LCC'14), Wien, 2014-07-12. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Automated Complexity Analysis Based on the Dependency Pair Method.
  5th Workshop on Developments in Implicit Computational Complexity (DICE 2014), Grenoble, 2014-04-05. (Web link)
  
  

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Moser, Georg Co-author(s): Hirokawa, Nao: Automated Complexity Analysis Based on Context-Sensitive Rewriting.
  Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications (RTA & TLCA 2014), Wien, 2014-07-14. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg Co-author(s): Hofmann, M.: Amortised Resource Analysis and Typed Polynomial Interpretations.
  Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications (RTA & TLCA 2014), Wien, 2014-07-15. (Web link)
  
  
• 
  Lecturer(s): Schaper, Michael Co-author(s): Moser, Georg: A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems.
  Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 14), Wien, 2014-07-13. (Web link)
  
  

Session Chairperson / Discussant

• 
  Moser, Georg: Session Chair: Session 18F.
  Two Faces of Complexity (2FC 2014), Wien, 2014-07-12. (Web link)
  
  

Guest Lectures

Guest Lecture

• 
  Lecturer(s): Moser, Georg: Amortised Resource Analysis and Typed Polynomial Interpretations.
  Swansea University, Swansea, 2014-12-04. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Weighted Automata Theory for Complexity Analysis of Rewrite Systems.
  Ludwig-Maximilians-Universität München (LMU), München, 2014-11-07. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Avanzini, Martin Co-author(s): Moser, Georg: A Combination Framework for Complexity.
  24th International Conference on Rewriting Techniques and Applications (RTA 2013), Eindhoven, 2013-06-26. (Web link)
  
  
• 
  Lecturer(s): Avanzini, Martin Co-author(s): Moser, Georg: Tyrolean Complexity Tool: Features and Usage.
  24th International Conference on Rewriting Techniques and Applications (RTA 2013), Eindhoven, 2013-06-26. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Amortised Cost Analysis for Term Rewriting Systems.
  3rd Workshop on Proof Theory and Rewriting, Kanazawa, 2013-03-08. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg Co-author(s): Hofmann, Martin: Amortised resource analysis and typed term rewriting.
  Implicit Computational Complexity and applications: Resource control, security, real-number computation, Schonan, 2013-11-05. (Web link)
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Lecture)

• 
  Lecturer(s): Middeldorp, Aart Co-author(s): Moser, Georg; Neurauter, Friedrich; Waldmann, Johannes; Zankl, Harald: Matrix Interpretations for Polynomial Derivational Complexity of Rewrite Systems.
  18th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 18), Merida, 2012-03-11. (Web link)
  
  

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Avanzini, Martin Co-author(s): Eguchi, Naohi; Moser, Georg: A New Order-theoretic Characterisation of the Polytime Computable Functions.
  10th Asian Symposium on Programming Languages and Systems, Kyoto, 2012-12-12. (Web link)
  
  
• 
  Lecturer(s): Avanzini, Martin Co-author(s): Eguchi, Naohi; Moser, Georg: A New Order-Theoretic Characterisation of the Polytime Computable Functions.
  Logic in Computer Science (LICS 2012), Dubrovnik, 2012-06-25. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: KBOs, Ordinals, Subrecursive Hierarchies and All That.
  Concepts and Meaning - Workshop in honour of Alexander Leitsch's 60th Birthday, Wien, 2012-05-05. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg Co-author(s): Avanzini, Martin; Eguchi, Naohi: On a Correspondence between Predicative Recursion and Register Machines.
  12th International Workshop on Termination (WST 2012), Obergurgl, 2012-02-20. (Web link)
  
  
• 
  Lecturer(s): Schaper, Michael Co-author(s): Moser, Georg: Termination Graphs Revisited.
  12th International Workshop on Termination (WST 2012), Obergurgl, 2012-02-21. (Web link)
  
  

Session Chairperson / Discussant

• 
  Gimenez, Stephane; Moser, Georg; Thiemann, Rene; Zankl, Harald: Session Chairs.
  12th International Workshop on Termination (WST 2012), Obergurgl, 2012-02-20. (Web link)
  
  

Lecture at Summer-/Winterschool

• 
  Lecturer(s): Moser, Georg: Automated Complexity Analysis of Term Rewriting Systems.
  6th International School on Rewriting (ISR 2012), Valencia, 2012-07-16. (Web link)
  
  

Guest Lectures

Guest Lecture

• 
  Lecturer(s): Moser, Georg: Predicative Recursion and Register Machines.
  Ludwig-Maximilians-Universität München (LMU), München, 2012-02-06.
  
  

Presentations for the general public

Public Lecture

• 
  Felgenhauer, Bertram; Gimenez, Stephane; Kaliszyk, Cezary; Kop, Cynthia; Middeldorp, Aart; Moser, Georg: Gibt es logische Puzzles jenseits von Sudoku.
  BeSt (Berufs- und Studieninformationsmesse), Innsbruck, 2012-10-22 - 2012-10-24. (Web link)
  
  
• 
  Middeldorp, Aart; Moser, Georg; Kaliszyk, Cezary; Kop, Cynthia; Gimenez, Stephane; Felgenhauer, Bertram: Logikrätsel.
  BeSt (Berufs- und Studieninformationsmesse), Innsbruck, 2012-10-17 - 2012-10-19.
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Avanzini, Martin Co-author(s): Eguchi, Naohi; Moser, Georg: A Path Order for Rewrite Systems that Compute Exponential Time Functions.
  22nd International Conference on Rewriting Techniques and Applications (RTA 2011), Novi Sad, 2011-06-01. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg Co-author(s): Schnabl, Andreas: Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity.
  22nd International Conference on Rewriting Techniques and Applications (RTA 2011), Novi Sad, 2011-05-30. (Web link)
  
  
• 
  Lecturer(s): Voronkov, Andrei Co-author(s): Moser, Georg; Kovacs, Laura: On Transfinite Knuth-Bendix Orders.
  23rd International Conference on Automated Deduction (CADE 2011), Wrocław / Breslau, 2011-08-02. (Web link)
  
  

Session Chairperson / Discussant

• 
  Moser, Georg: Session Chair - Afternoon Session June 15, Morning Session June 16.
  Workshop Structural, Paris, 2011-06-15. (Web link)
  
  
• 
  Moser, Georg: Session Chair - Session 2.
  22nd International Conference on Rewriting Techniques and Applications (RTA 2011), Novi Sad, 2011-05-30. (Web link)
  
  
• 
  Moser, Georg: Session Chair.
  Two Faces of Complexity (2FC 2011), Novi Sad, 2011-05-29. (Web link)
  
  

Lecture at Summer-/Winterschool

• 
  Lecturer(s): Middeldorp, Aart; Moser, Georg: Termination and Complexity of Rewrite Systems.
  23rd European Summer School in Logic, Language and Information (ESSLLI 2011), Ljubljana, 2011-08-08. (Web link)
  
  

Lecture at Project Meeting / Research Cooperation Meeting

• 
  Lecturer(s): Moser, Georg: The Epsilon Theorems and Herbrand Complexity.
  Workshop Structural, Paris, 2011-06-16. (Web link)
  
  

Guest Lectures

Guest Lecture

• 
  Lecturer(s): Moser, Georg: Computation with Bounded Resources.
  University of Cape Town, Kapstadt, 2011-11-15.
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Lecture)

• 
  Lecturer(s): Moser, Georg: Complexity Analysis of Programs by Rewriting.
  IFIP Working Group 1.6 (Term Rewriting) - Meeting 2010, Edinburgh, 2010-07-10. (Web link)
  
  

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Avanzini, Martin Co-author(s): Moser, Georg: Closing the Gap Between Runtime Complexity and Polytime Computability.
  21st International Conference on Rewriting Techniques and Applications (RTA 2010), Edinburgh, 2010-07-13. (Web link)
  
  
• 
  Lecturer(s): Avanzini, Martin Co-author(s): Moser, Georg: Complexity Analysis by Graph Rewriting.
  10th International Symposium on Functional and Logic Programming (FLOPS 2010), Sendai, 2010-04-20. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg Co-author(s): Bonfante, Guillaume: Characterising Space Complexity Classes via Knuth-Bendix Orders.
  17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 17), Yogyakarta, 2010-10-14. (Web link)
  
  
• 
  Lecturer(s): Schnabl, Andreas Co-author(s): Moser, Georg: Dependency Graphs, Relative Rule Removal, the Subterm Criterion and Derivational Complexity.
  11th International Workshop on Termination (WST 2010), Edinburgh, 2010-07-15. (Web link)
  
  

Session Chairperson / Discussant

• 
  Middeldorp, Aart; Moser, Georg: Session Chair.
  17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 17), Yogyakarta, 2010-10-14. (Web link)
  
  
• 
  Moser, Georg: Session Chair, Session 1.
  21st International Conference on Rewriting Techniques and Applications (RTA 2010), Edinburgh, 2010-07-11. (Web link)
  
  
• 
  Moser, Georg: Session Chair.
  2nd Workshop on Proof Theory and Rewriting 2010, Obergurgl, 2010-03-28. (Web link)
  
  

Lecture at Summer-/Winterschool

• 
  Lecturer(s): Moser, Georg: Complexity Analysis of Term Rewrite Systems.
  5th International School on Rewriting (ISR 2010), Utrecht, 2010-07-07. (Web link)
  
  

Lecture at Project Meeting / Research Cooperation Meeting

• 
  Lecturer(s): Moser, Georg: Towards Complexity Analysis of Programs by Rewriting.
  3rd Austria-Japan Summer Workshop on Term Rewriting (AJSW 2010), Obergurgl, 2010-08-06. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Automated Complexity Analysis of Rewriting.
  Concerto - Final Meeting, Turin, 2010-06-10. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Primitive Recursion Revisited.
  Workshop Paris - Innsbruck - Tbilisi: Workshop of the PHC Amadeus project "Logic-Based Analysis of Computation" and the CNRS/GNSF project "Structura and computational properties of logics", Paris, 2010-05-20. (Web link)
  
  

Guest Lectures

Guest Lecture

• 
  Lecturer(s): Moser, Georg: Automated Complexity Analysis Based on the Dependency Pair Method.
  Max-Planck-Institut für Informatik, Saarbrücken, 2010-10-26.
  
  

Presentations for the general public

Public Lecture

• 
  Moser, Georg; Schnabl, Andreas; Winkler, Sarah: Das Informatikstudium in Innsbruck.
  BeSt (Berufs- und Studieninformationsmesse), Innsbruck, 2010-10-20 - 2010-10-22. (Web link)
  
  
• 
  Moser, Georg; Winkler, Sarah: Algorithmen vs. Kochrezepte.
  UniCamp 2010, Innsbruck, 2010-08-10.
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Lecture)

• 
  Lecturer(s): Moser, Georg: Complexity Analysis of Term Rewrite Systems.
  IFIP Working Group 1.6 (Term Rewriting) - Meeting 2009, Brasilia, 2009-07-02. (Web link)
  
  

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Moser, Georg: The Hydra Battle and Cichon's Principle.
  Research Workshop in Proof Theory and Constructivism, Leeds, 2009-07-09. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Dependency Pairs and Polynomial Path Orders.
  31st TRS Meeting, Ishikawa, 2009-02-23. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: The Hydra Battle and Cichon's Principle.
  5th Rewriting Seminar, Ishikawa, 2009-02-20.
  
  

Session Chairperson / Discussant

• 
  Moser, Georg: Session Chair.
  Research Workshop in Proof Theory and Constructivism, Leeds, 2009-07-09.
  
  
• 
  Moser, Georg: Session Chair, Session 2.
  10th International Workshop on Termination (WST 2009), Leipzig, 2009-06-05. (Web link)
  
  
• 
  Moser, Georg: Session Chair.
  31st TRS Meeting, Ishikawa, 2009-02-24. (Web link)
  
  

Lecture at Project Meeting / Research Cooperation Meeting

• 
  Lecturer(s): Moser, Georg: Proof Theory at Work: Complexity Analysis of Term Rewrite Systems.
  3rd Meeting of COMPLICE, Nancy, 2009-10-23. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Complexity of Term Rewrite Systems.
  Workshop Paris - Innsbruck, Paris, 2009-09-15. (Web link)
  
  

Guest Lectures

Guest Lecture

• 
  Lecturer(s): Moser, Georg: Complexity Analysis of Term Rewrite Systems.
  Technische Universität Darmstadt, Darmstadt, 2009-04-28. (Web link)
  
  

Presentations for the general public

Public Lecture

• 
  Avanzini, Martin; Korp, Martin; Moser, Georg; Neurauter, Friedrich; Schnabl, Andreas; Sternagel, Christian; Thiemann, Rene; Winkler, Sarah; Zankl, Harald: Was ist schwieriger als Sudoku?
  Lange Nacht der Forschung, Innsbruck, 2009-11-07.
  
  
• 
  Avanzini, Martin; Korp, Martin; Moser, Georg; Neurauter, Friedrich; Schnabl, Andreas; Sternagel, Christian; Thiemann, Rene; Winkler, Sarah; Zankl, Harald: Was ist schwieriger als Sudoku?
  Junge Uni, Innsbruck, 2009-11-06.
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Lecture)

• 
  Lecturer(s): Moser, Georg: The Epsilon Theorems and Herbrand Complexity.
  4th International Workshop on Analytic Proof Systems, Doha, 2008-11-22. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Matrix Interpretations May Induce Polynomial Complexity.
  1st Mini-Workshop on Rewriting Techniques, Ishikawa, 2008-08-01. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: The Epsilon Calculus and Herbrand Complexity.
  International conference Logical models of reasoning and computation (LMRC2008), Moskau, 2008-05-07.
  
  

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Moser, Georg: Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations.
  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008), Bangalore, 2008-12-09. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Complexity, Graphs, and the Dependency Pair Method.
  15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2008), Doha, 2008-11-27. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Automated Implicit Computational Complexity Analysis.
  4th International Joint Conference on Automated Reasoning (IJCAR 2008), Sydney, 2008-08-12. (Web link)
  
  
• 
  Lecturer(s): Moser, Georg: Complexity Analysis by Rewriting.
  9th International Symposium on Functional and Logic Programming (FLOPS 2008), Ise, 2008-04-15. (Web link)
  
  

Session Chairperson / Discussant

• 
  Moser, Georg: Session Chair, Session Rewriting 2.
  15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2008), Doha, 2008-11-27. (Web link)
  
  
• 
  Moser, Georg: Session Chair, Session 3.
  8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2008), Hagenberg, 2008-07-14. (Web link)
  
  

Guest Lectures

Guest Lecture

• 
  Lecturer(s): Moser, Georg: Term Induction.
  JAIST (Japan Advanced Institute for Science and Technology), Kanazawa, 2008-08-07.
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Lecture)

• 
  Lecturer(s): Moser, Georg: Proving Termination of Scheme Programs by Rewriting.
  Moscow-Vienna Workshop on Logic and Computation 2007, Wien, 2007-07-02. (Web link)
  
  

Guest Lectures

Guest Lecture

• 
  Lecturer(s): Moser, Georg: The Hydra Battle and Cichon's Principle.
  Kobe University, Kobe, 2007-11-20.
  
  
• 
  Lecturer(s): Moser, Georg: Complexity Analysis by Rewriting.
  JAIST (Japan Advanced Institute for Science and Technology), Kanazawa, 2007-11-07.
  
  

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Lecture)

• 
  Lecturer(s): Moser, Georg: Ackermann's Substitution Method (remixed).
  Collegium Logicum: Cut-Elimination, Wien, 2005-07-06.
  
  

Conference Lecture (Upon Registration)

• 
  Lecturer(s): Moser, Georg: Tiered Recursion and Strategies.
  5th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'05), Nara, 2005-04-22.