Travelled to:1 × Australia
1 × Brazil
1 × Canada
1 × France
1 × Serbia
1 × Spain
1 × The Netherlands
2 × Italy
2 × Japan
2 × United Kingdom
3 × Austria
3 × Poland
Collaborated with:M.Avanzini A.Schnabl N.Hirokawa M.Baaz S.Gimenez M.Hofmann R.Zach A.Weiermann S.Winkler U.D.Lago A.Middeldorp L.Kovács A.Voronkov N.Eguchi A.Leitsch
Talks about:complex (13) analysi (6) order (6) rewrit (5) depend (5) deriv (4) pair (4) system (3) comput (3) autom (3)
Person: Georg Moser
DBLP: Moser:Georg
Contributed to:
2015
2015
20152014
20132013
20112011
2010201020092008
20082008200320032002200119992018
2016Wrote 25 papers:
- ICFP-2015-AvanziniLM #complexity #first-order #functional #higher-order #source code
- Analysing the complexity of functional programs: higher-order meets first-order (MA, UDL, GM), pp. 152–164.
- RTA-2015-HirokawaMM #revisited
- Leftmost Outermost Revisited (NH, AM, GM), pp. 209–222.
- TLCA-2015-HofmannM #analysis #multi #term rewriting
- Multivariate Amortised Resource Analysis for Term Rewrite Systems (MH, GM), pp. 241–256.
- RTA-TLCA-2014-HirokawaM #analysis #automation #complexity
- Automated Complexity Analysis Based on Context-Sensitive Rewriting (NH, GM), pp. 257–271.
- CSL-2013-GimenezM #interactive
- The Structure of Interaction (SG, GM), pp. 316–331.
- RTA-2013-AvanziniM #complexity #framework
- A Combination Framework for Complexity (MA, GM), pp. 55–70.
- RTA-2013-AvanziniM13a #complexity
- Tyrolean Complexity Tool: Features and Usage (MA, GM), pp. 71–80.
- CADE-2011-KovacsMV #on the #order
- On Transfinite Knuth-Bendix Orders (LK, GM, AV), pp. 384–399.
- RTA-2011-AvanziniEM #exponential #order #term rewriting
- A Path Order for Rewrite Systems that Compute Exponential Time Functions (MA, NE, GM), pp. 123–138.
- RTA-2011-MoserS #complexity #dependence #framework #multi #proving #recursion #termination
- Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity (GM, AS), pp. 235–250.
- FLOPS-2010-AvanziniM #analysis #complexity #graph grammar
- Complexity Analysis by Graph Rewriting (MA, GM), pp. 257–271.
- RTA-2010-AvanziniM #complexity #runtime
- Closing the Gap Between Runtime Complexity and Polytime Computability (MA, GM), pp. 33–48.
- RTA-2009-AvanziniM #dependence #order #polynomial
- Dependency Pairs and Polynomial Path Orders (MA, GM), pp. 48–62.
- RTA-2009-MoserS #complexity #dependence
- The Derivational Complexity Induced by the Dependency Pair Method (GM, AS), pp. 255–269.
- FLOPS-2008-AvanziniM #analysis #complexity
- Complexity Analysis by Rewriting (MA, GM), pp. 130–146.
- IJCAR-2008-AvanziniMS #analysis #automation #complexity
- Automated Implicit Computational Complexity Analysis (MA, GM, AS), pp. 132–138.
- IJCAR-2008-HirokawaM #analysis #automation #complexity #dependence
- Automated Complexity Analysis Based on the Dependency Pair Method (NH, GM), pp. 364–379.
- RTA-2008-MoserS #polynomial #proving #using
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (GM, AS), pp. 276–290.
- CSL-2003-MoserZ #calculus
- The Epsilon Calculus (GM, RZ), p. 455.
- RTA-2003-MoserW
- Relating Derivation Lengths with the Slow-Growing Hierarchy Directly (GM, AW), pp. 296–310.
- CSL-2002-BaazM #on the
- On Generalizations of Semi-terms of Particularly Simple Form (MB, GM), pp. 382–396.
- CSL-2001-BaazM #on the #theorem
- On a Generalisation of Herbrand’s Theorem (MB, GM), pp. 469–483.
- CADE-1999-BaazLM
- System Description: CutRes 0.1: Cut Elimination by Resolution (MB, AL, GM), pp. 212–216.
- IJCAR-2018-WinklerM #named #order
- MædMax: A Maximal Ordered Completion Tool (SW, GM), pp. 472–480.
- POPL-2016-GimenezM #complexity #interactive
- The complexity of interaction (SG, GM), pp. 243–255.