|
Search the dblp DataBase
Georg Moser:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- Matthias Baaz, Georg Moser
On a Generalisation of Herbrand's Theorem. [Citation Graph (0, 0)][DBLP] CSL, 2001, pp:469-483 [Conf]
- Matthias Baaz, Georg Moser
On Generalizations of Semi-terms of Particularly Simple Form. [Citation Graph (0, 0)][DBLP] CSL, 2002, pp:382-396 [Conf]
- Georg Moser, Richard Zach
The Epsilon Calculus (Tutorial). [Citation Graph (0, 0)][DBLP] CSL, 2003, pp:455- [Conf]
- Toshiyasu Arai, Georg Moser
Proofs of Termination of Rewrite Systems for Polytime Functions. [Citation Graph (0, 0)][DBLP] FSTTCS, 2005, pp:529-540 [Conf]
- Christian G. Fermüller, Georg Moser
Have Spass with OCC1Ng=. [Citation Graph (0, 0)][DBLP] LPAR, 2000, pp:114-130 [Conf]
- 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]
- Georg Moser
Derivational Complexity of Knuth-Bendix Orders Revisited. [Citation Graph (0, 0)][DBLP] LPAR, 2006, pp:75-89 [Conf]
- Georg Moser, Andreas Weiermann
Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. [Citation Graph (0, 0)][DBLP] RTA, 2003, pp:296-310 [Conf]
- 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]
- 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]
- 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]
- 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]
- Georg Moser
Foreword. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:288, n:1, pp:1- [Journal]
- Nachum Dershowitz, Georg Moser
The Hydra Battle Revisited. [Citation Graph (0, 0)][DBLP] Rewriting, Computation and Proof, 2007, pp:1-27 [Conf]
Automated Complexity Analysis Based on the Dependency Pair Method. [Citation Graph (, )][DBLP]
Automated Implicit Computational Complexity Analysis (System Description). [Citation Graph (, )][DBLP]
Complexity Analysis by Rewriting. [Citation Graph (, )][DBLP]
Complexity Analysis by Graph Rewriting. [Citation Graph (, )][DBLP]
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. [Citation Graph (, )][DBLP]
Complexity, Graphs, and the Dependency Pair Method. [Citation Graph (, )][DBLP]
The Derivational Complexity Induced by the Dependency Pair Method. [Citation Graph (, )][DBLP]
Dependency Pairs and Polynomial Path Orders. [Citation Graph (, )][DBLP]
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations. [Citation Graph (, )][DBLP]
Closing the Gap Between Runtime Complexity and Polytime Computability. [Citation Graph (, )][DBLP]
The Hydra battle and Cichon's principle. [Citation Graph (, )][DBLP]
The Derivational Complexity Induced by the Dependency Pair Method [Citation Graph (, )][DBLP]
Dependency Pairs and Polynomial Path Orders [Citation Graph (, )][DBLP]
Proof Theory at Work: Complexity Analysis of Term Rewrite Systems [Citation Graph (, )][DBLP]
Efficient Implementation of Rewriting Revisited Technical Report [Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs
|