Publications 2009

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 (Full Paper)

• 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)
  
  

Lectures 2009

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.
  
  

Projects, scholarships and other third-party funds 2009

Research Projects

• Moser, Georg: Derivationskomplexitätsanalyse.
  Fonds zur Förderung der wissenschaftlichen Forschung (FWF), Einzelprojekt
  2007-10-01 - 2011-08-31
  
  

Scholarships

• Moser, Georg: Mobititätsförderung für Logikbasierte Analyse von Berechnungen.
  OeAD-GsmbH (Österreichische Austauschdienst) - Austrian Agency for International Cooperation in Education and Research
  2009-01-01 - 2010-12-31
  
  

Academic Activities and Achievements 2009

Doctoral Theses / Postdoctoral Qualifications

• Moser, Georg: Erteilung der Lehrbefugnis für das Fach "Informatik" (2009). (Web link)
  
  

Supervision of Student Theses

• Moser, Georg: Avanzini, Martin: Verifying Polytime Computability Automatically (2009 - 2013).
  
  
• Moser, Georg: Schnabl, Andreas: Derivational Complexity Analysis Revisited (2009 - 2012).
  
  
• Moser, Georg: Avanzini, Martin: Automation of Polynomial Path Orders (2008 - 2009).