The SCEAS System
Navigation Menu

Search the dblp DataBase


Georg Moser: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Matthias Baaz, Alexander Leitsch, Georg Moser
    System Description: CutRes 0.1: Cut Elimination by Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 1999, pp:212-216 [Conf]
  2. Matthias Baaz, Georg Moser
    On a Generalisation of Herbrand's Theorem. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:469-483 [Conf]
  3. Matthias Baaz, Georg Moser
    On Generalizations of Semi-terms of Particularly Simple Form. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:382-396 [Conf]
  4. Georg Moser, Richard Zach
    The Epsilon Calculus (Tutorial). [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:455- [Conf]
  5. Toshiyasu Arai, Georg Moser
    Proofs of Termination of Rewrite Systems for Polytime Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:529-540 [Conf]
  6. Christian G. Fermüller, Georg Moser
    Have Spass with OCC1Ng=. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:114-130 [Conf]
  7. Christian G. Fermüller, Georg Moser, Richard Zach
    Tableaux for Reasoning About Atomic Updates. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:639-653 [Conf]
  8. Georg Moser
    Derivational Complexity of Knuth-Bendix Orders Revisited. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:75-89 [Conf]
  9. Georg Moser, Andreas Weiermann
    Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. [Citation Graph (0, 0)][DBLP]
    RTA, 2003, pp:296-310 [Conf]
  10. Matthias Baaz, Georg Moser
    Herbrand's theorem and term induction. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2006, v:45, n:4, pp:447-503 [Journal]
  11. Arnold Beckmann, Jeremy Avigad, Georg Moser
    Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:136, n:1-2, pp:1-2 [Journal]
  12. Georg Moser
    Ackermann's substitution method (remixed). [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:1-18 [Journal]
  13. Georg Moser, Richard Zach
    The Epsilon Calculus and Herbrand Complexity. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2006, v:82, n:1, pp:133-155 [Journal]
  14. Georg Moser
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:288, n:1, pp:1- [Journal]
  15. Nachum Dershowitz, Georg Moser
    The Hydra Battle Revisited. [Citation Graph (0, 0)][DBLP]
    Rewriting, Computation and Proof, 2007, pp:1-27 [Conf]

  16. Automated Complexity Analysis Based on the Dependency Pair Method. [Citation Graph (, )][DBLP]

  17. Automated Implicit Computational Complexity Analysis (System Description). [Citation Graph (, )][DBLP]

  18. Complexity Analysis by Rewriting. [Citation Graph (, )][DBLP]

  19. Complexity Analysis by Graph Rewriting. [Citation Graph (, )][DBLP]

  20. Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. [Citation Graph (, )][DBLP]

  21. Complexity, Graphs, and the Dependency Pair Method. [Citation Graph (, )][DBLP]

  22. The Derivational Complexity Induced by the Dependency Pair Method. [Citation Graph (, )][DBLP]

  23. Dependency Pairs and Polynomial Path Orders. [Citation Graph (, )][DBLP]

  24. Proving Quadratic Derivational Complexities Using Context Dependent Interpretations. [Citation Graph (, )][DBLP]

  25. Closing the Gap Between Runtime Complexity and Polytime Computability. [Citation Graph (, )][DBLP]

  26. The Hydra battle and Cichon's principle. [Citation Graph (, )][DBLP]

  27. The Derivational Complexity Induced by the Dependency Pair Method [Citation Graph (, )][DBLP]

  28. Dependency Pairs and Polynomial Path Orders [Citation Graph (, )][DBLP]

  29. Proof Theory at Work: Complexity Analysis of Term Rewrite Systems [Citation Graph (, )][DBLP]

  30. Efficient Implementation of Rewriting Revisited Technical Report [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002