dblp.uni-trier.dewww.uni-trier.de

Georg Moser Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
27EEGeorg Moser, Andreas Schnabl: The Derivational Complexity Induced by the Dependency Pair Method. RTA 2009: 255-269
26EEMartin Avanzini, Georg Moser: Dependency Pairs and Polynomial Path Orders. RTA 2009: 48-62
25EEGeorg Moser: The Hydra battle and Cichon's principle. Appl. Algebra Eng. Commun. Comput. 20(2): 133-158 (2009)
24EEGeorg Moser, Andreas Schnabl: The Derivational Complexity Induced by the Dependency Pair Method CoRR abs/0904.0570: (2009)
23EEMartin Avanzini, Georg Moser: Dependency Pairs and Polynomial Path Orders CoRR abs/0904.0981: (2009)
22EEGeorg Moser: Proof Theory at Work: Complexity Analysis of Term Rewrite Systems CoRR abs/0907.5527: (2009)
2008
21EEMartin Avanzini, Georg Moser: Complexity Analysis by Rewriting. FLOPS 2008: 130-146
20EEGeorg Moser, Andreas Schnabl, Johannes Waldmann: Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. FSTTCS 2008
19EEMartin Avanzini, Georg Moser, Andreas Schnabl: Automated Implicit Computational Complexity Analysis (System Description). IJCAR 2008: 132-138
18EENao Hirokawa, Georg Moser: Automated Complexity Analysis Based on the Dependency Pair Method. IJCAR 2008: 364-379
17EENao Hirokawa, Georg Moser: Complexity, Graphs, and the Dependency Pair Method. LPAR 2008: 652-666
16EEGeorg Moser, Andreas Schnabl: Proving Quadratic Derivational Complexities Using Context Dependent Interpretations. RTA 2008: 276-290
2007
15EENachum Dershowitz, Georg Moser: The Hydra Battle Revisited. Rewriting, Computation and Proof 2007: 1-27
2006
14EEGeorg Moser: Derivational Complexity of Knuth-Bendix Orders Revisited. LPAR 2006: 75-89
13EEGeorg Moser: Ackermann's substitution method (remixed). Ann. Pure Appl. Logic 142(1-3): 1-18 (2006)
12EEMatthias Baaz, Georg Moser: Herbrand's theorem and term induction. Arch. Math. Log. 45(4): 447-503 (2006)
11EEGeorg Moser, Richard Zach: The Epsilon Calculus and Herbrand Complexity. Studia Logica 82(1): 133-155 (2006)
2005
10EEToshiyasu Arai, Georg Moser: Proofs of Termination of Rewrite Systems for Polytime Functions. FSTTCS 2005: 529-540
9EEArnold Beckmann, Jeremy Avigad, Georg Moser: Preface. Ann. Pure Appl. Logic 136(1-2): 1-2 (2005)
2003
8EEGeorg Moser, Richard Zach: The Epsilon Calculus (Tutorial). CSL 2003: 455
7EEGeorg Moser, Andreas Weiermann: Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. RTA 2003: 296-310
2002
6EEMatthias Baaz, Georg Moser: On Generalizations of Semi-terms of Particularly Simple Form. CSL 2002: 382-396
5 Georg Moser: Foreword. Theor. Comput. Sci. 288(1): 1 (2002)
2001
4EEMatthias Baaz, Georg Moser: On a Generalisation of Herbrand's Theorem. CSL 2001: 469-483
3EEChristian G. Fermüller, Georg Moser, Richard Zach: Tableaux for Reasoning About Atomic Updates. LPAR 2001: 639-653
2000
2EEChristian G. Fermüller, Georg Moser: Have Spass with OCC1Ng=. LPAR 2000: 114-130
1999
1EEMatthias Baaz, Alexander Leitsch, Georg Moser: System Description: CutRes 0.1: Cut Elimination by Resolution. CADE 1999: 212-216

Coauthor Index

1Toshiyasu Arai [10]
2Martin Avanzini [19] [21] [23] [26]
3Jeremy Avigad [9]
4Matthias Baaz [1] [4] [6] [12]
5Arnold Beckmann [9]
6Nachum Dershowitz [15]
7Christian G. Fermüller [2] [3]
8Nao Hirokawa [17] [18]
9Alexander Leitsch [1]
10Andreas Schnabl [16] [19] [20] [24] [27]
11Johannes Waldmann [20]
12Andreas Weiermann [7]
13Richard Zach [3] [8] [11]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)