Georg Moser

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
i10		Martin Avanzini, Georg Moser: A Combination Framework for Complexity. CoRR abs/1302.0973 (2013)
	2012
c27		Martin Avanzini, Naohi Eguchi, Georg Moser: A New Order-Theoretic Characterisation of the Polytime Computable Functions. APLAS 2012: 280-295
i9		Martin Avanzini, Naohi Eguchi, Georg Moser: A New Order-theoretic Characterisation of the Polytime Computable Functions. CoRR abs/1201.2553 (2012)
i8		Georg Moser, Michael Schaper: A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems. CoRR abs/1204.1568 (2012)
i7		Martin Avanzini, Georg Moser: Polynomial Path Orders: A Maximal Model. CoRR abs/1209.3793 (2012)
	2011
j7		Georg Moser, Andreas Schnabl: The Derivational Complexity Induced by the Dependency Pair Method. Logical Methods in Computer Science 7(3) (2011)
c26		Laura Kovács, Georg Moser, Andrei Voronkov: On Transfinite Knuth-Bendix Orders. CADE 2011: 384-399
c25		Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl: Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI 2011: 1-20
c24		Hamid Mohammadi Fard, Radu Prodan, Georg Moser, Thomas Fahringer: A Bi-Criteria Truthful Mechanism for Scheduling of Workflows in Clouds. CloudCom 2011: 599-605
c23		Martin Avanzini, Naohi Eguchi, Georg Moser: A Path Order for Rewrite Systems that Compute Exponential Time Functions. RTA 2011: 123-138
c22		Georg Moser, Andreas Schnabl: Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity. RTA 2011: 235-250
i6		Nao Hirokawa, Georg Moser: Automated Complexity Analysis Based on the Dependency Pair Method. CoRR abs/1102.3129 (2011)
i5		Georg Moser, Andreas Schnabl: Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity. CoRR abs/1103.5082 (2011)
	2010
c21		Martin Avanzini, Georg Moser: Complexity Analysis by Graph Rewriting. FLOPS 2010: 257-271
c20		Guillaume Bonfante, Georg Moser: Characterising Space Complexity Classes via Knuth-Bendix Orders. LPAR (Yogyakarta) 2010: 142-156
c19		Martin Avanzini, Georg Moser: Closing the Gap Between Runtime Complexity and Polytime Computability. RTA 2010: 33-48
i4		Martin Avanzini, Georg Moser: Efficient Implementation of Rewriting Revisited Technical Report. CoRR abs/1001.5404 (2010)
i3		Martin Avanzini, Naohi Eguchi, Georg Moser: A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report). CoRR abs/1010.1128 (2010)
	2009
j6		Georg Moser: The Hydra battle and Cichon's principle. Appl. Algebra Eng. Commun. Comput. 20(2): 133-158 (2009)
c18		Martin Avanzini, Georg Moser: Dependency Pairs and Polynomial Path Orders. RTA 2009: 48-62
c17		Georg Moser, Andreas Schnabl: The Derivational Complexity Induced by the Dependency Pair Method. RTA 2009: 255-269
i2		Martin Avanzini, Georg Moser: Dependency Pairs and Polynomial Path Orders. CoRR abs/0904.0981 (2009)
i1		Georg Moser: Proof Theory at Work: Complexity Analysis of Term Rewrite Systems. CoRR abs/0907.5527 (2009)
	2008
c16		Martin Avanzini, Georg Moser, Andreas Schnabl: Automated Implicit Computational Complexity Analysis (System Description). IJCAR 2008: 132-138
c15		Nao Hirokawa, Georg Moser: Automated Complexity Analysis Based on the Dependency Pair Method. IJCAR 2008: 364-379
c14		Martin Avanzini, Georg Moser: Complexity Analysis by Rewriting. FLOPS 2008: 130-146
c13		Georg Moser, Andreas Schnabl, Johannes Waldmann: Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. FSTTCS 2008: 304-315
c12		Nao Hirokawa, Georg Moser: Complexity, Graphs, and the Dependency Pair Method. LPAR 2008: 652-666
c11		Georg Moser, Andreas Schnabl: Proving Quadratic Derivational Complexities Using Context Dependent Interpretations. RTA 2008: 276-290
	2007
c10		Nachum Dershowitz, Georg Moser: The Hydra Battle Revisited. Rewriting, Computation and Proof 2007: 1-27
	2006
j5		Matthias Baaz, Georg Moser: Herbrand's theorem and term induction. Arch. Math. Log. 45(4): 447-503 (2006)
j4		Georg Moser: Ackermann's substitution method (remixed). Ann. Pure Appl. Logic 142(1-3): 1-18 (2006)
j3		Georg Moser, Richard Zach: The Epsilon Calculus and Herbrand Complexity. Studia Logica 82(1): 133-155 (2006)
c9		Georg Moser: Derivational Complexity of Knuth-Bendix Orders Revisited. LPAR 2006: 75-89
	2005
j2		Arnold Beckmann, Jeremy Avigad, Georg Moser: Preface. Ann. Pure Appl. Logic 136(1-2): 1-2 (2005)
c8		Toshiyasu Arai, Georg Moser: Proofs of Termination of Rewrite Systems for Polytime Functions. FSTTCS 2005: 529-540
	2003
c7		Georg Moser, Richard Zach: The Epsilon Calculus (Tutorial). CSL 2003: 455
c6		Georg Moser, Andreas Weiermann: Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. RTA 2003: 296-310
	2002
j1		Georg Moser: Foreword. Theor. Comput. Sci. 288(1): 1 (2002)
c5		Matthias Baaz, Georg Moser: On Generalizations of Semi-terms of Particularly Simple Form. CSL 2002: 382-396
	2001
c4		Matthias Baaz, Georg Moser: On a Generalisation of Herbrand's Theorem. CSL 2001: 469-483
c3		Christian G. Fermüller, Georg Moser, Richard Zach: Tableaux for Reasoning About Atomic Updates. LPAR 2001: 639-653
	2000
c2		Christian G. Fermüller, Georg Moser: Have Spass with OCC1N_g⁼. LPAR 2000: 114-130
	1999
c1		Matthias Baaz, Alexander Leitsch, Georg Moser: System Description: CutRes 0.1: Cut Elimination by Resolution. CADE 1999: 212-216

Coauthor Index

1	Toshiyasu Arai	[c8]
2	Martin Avanzini	[i10] [c27] [i9] [i7] [c23] [c21] [c19] [i4] [i3] [c18] [i2] [c16] [c14]
3	Jeremy Avigad	[j2]
4	Matthias Baaz	[j5] [c5] [c4] [c1]
5	Arnold Beckmann	[j2]
6	Guillaume Bonfante	[c20]
7	Nachum Dershowitz	[c10]
8	Naohi Eguchi	[c27] [i9] [c23] [i3]
9	Thomas Fahringer	[c24]
10	Hamid Mohammadi Fard	[c24]
11	Christian G. Fermüller	[c3] [c2]
12	Nao Hirokawa	[i6] [c15] [c12]
13	Laura Kovács (Laura Ildikó Kovács)	[c26]
14	Alexander Leitsch	[c1]
15	Aart Middeldorp	[c25]
16	Friedrich Neurauter	[c25]
17	Radu Prodan	[c24]
18	Michael Schaper	[i8]
19	Andreas Schnabl	[j7] [c22] [i5] [c17] [c16] [c13] [c11]
20	Andrei Voronkov	[c26]
21	Johannes Waldmann	[c25] [c13]
22	Andreas Weiermann	[c6]
23	Richard Zach	[j3] [c7] [c3]
24	Harald Zankl	[c25]

Colors in the list of coauthors

Last update Sun May 19 09:06:10 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page