Theoretical Computer Science
Home Mission Research Teaching Software Events Projects Vacancies Former Members
Category
All Publications Lectures Projects Academic Achievements
Year
2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004

Publications 2011

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

Lectures 2011

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.

Projects, scholarships and other third-party funds 2011

Research Projects

  • Moser, Georg: Structural. Structural and Computational Proof Theory.
    Fonds zur Förderung der wissenschaftlichen Forschung (FWF), Joint Projects
    2011-02-01 - 2014-03-31

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

Academic Activities and Achievements 2011

Supervision of Student Theses

  • Middeldorp, Aart; Moser, Georg: Felgenhauer, Bertram: Confluence of Term Rewriting: Theory and Automation (2011 - 2015).

  • Moser, Georg: Avanzini, Martin: Verifying Polytime Computability Automatically (2009 - 2013).

  • Moser, Georg: Schnabl, Andreas: Derivational Complexity Analysis Revisited (2009 - 2012).