Georg Moser

According to our database1, Georg Moser authored at least 68 papers between 1999 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Type-Based Analysis of Logarithmic Amortised Complexity.
CoRR, 2021

2020
Automated amortised resource analysis for term rewrite systems.
Sci. Comput. Program., 2020

A modular cost analysis for probabilistic programs.
Proc. ACM Program. Lang., 2020

Runtime Complexity Analysis of Logically Constrained Rewriting.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2020

2019
Smarter Features, Simpler Learning?
Proceedings of the Second International Workshop on Automated Reasoning: Challenges, 2019

Modular Runtime Complexity Analysis of Probabilistic While Programs.
CoRR, 2019

The Epsilon Calculus with Equality and Herbrand Complexity.
CoRR, 2019

2018
From Jinja bytecode to term rewriting: A complexity reflecting transformation.
Inf. Comput., 2018

Analysis of Logarithmic Amortised Complexity.
CoRR, 2018

MædMax: A Maximal Ordered Completion Tool.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
KBOs, ordinals, subrecursive hierarchies and all that.
J. Log. Comput., 2017

Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk).
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Quantified Boolean Formulas: Call the Plumber!
Proceedings of the LPAR-21, 2017

2016
A combination framework for complexity.
Inf. Comput., 2016

Kruskal's Tree Theorem for Acyclic Term Graphs.
Proceedings of the Proceedings 9th International Workshop on Computing with Terms and Graphs, 2016

TcT: Tyrolean Complexity Tool.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Complexity of Acyclic Term Graph Rewriting.
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

The complexity of interaction.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2015
A new order-theoretic characterisation of the polytime computable functions.
Theor. Comput. Sci., 2015

The Complexity of Interaction (Long Version).
CoRR, 2015

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version).
CoRR, 2015

Multivariate Amortised Resource Analysis for Term Rewrite Systems.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

Leftmost Outermost Revisited.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Analysing the complexity of functional programs: higher-order meets first-order.
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

On the Computational Content of Termination Proofs.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
Amortised Resource Analysis and Typed Polynomial Interpretations (extended version).
CoRR, 2014

Automated Complexity Analysis Based on Context-Sensitive Rewriting.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Amortised Resource Analysis and Typed Polynomial Interpretations.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013
Polynomial Path Orders.
Log. Methods Comput. Sci., 2013

Tyrolean Complexity Tool: Features and Usage.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

The Structure of Interaction.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012
Polynomial Path Orders: A Maximal Model
CoRR, 2012

A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems
CoRR, 2012

2011
The Derivational Complexity Induced by the Dependency Pair Method
Log. Methods Comput. Sci., 2011

Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

A Path Order for Rewrite Systems that Compute Exponential Time Functions.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

A Bi-Criteria Truthful Mechanism for Scheduling of Workflows in Clouds.
Proceedings of the IEEE 3rd International Conference on Cloud Computing Technology and Science, 2011

Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems.
Proceedings of the Algebraic Informatics - 4th International Conference, 2011

On Transfinite Knuth-Bendix Orders.
Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

2010
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)
CoRR, 2010

Efficient Implementation of Rewriting Revisited Technical Report
CoRR, 2010

Closing the Gap Between Runtime Complexity and Polytime Computability.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Characterising Space Complexity Classes via Knuth-Bendix Orders.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Complexity Analysis by Graph Rewriting.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
Proof Theory at Work: Complexity Analysis of Term Rewrite Systems
CoRR, 2009

The Hydra battle and Cichon's principle.
Appl. Algebra Eng. Commun. Comput., 2009

Dependency Pairs and Polynomial Path Orders.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Complexity, Graphs, and the Dependency Pair Method.
Proceedings of the Logic for Programming, 2008

Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Complexity Analysis by Rewriting.
Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

Automated Complexity Analysis Based on the Dependency Pair Method.
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

Automated Implicit Computational Complexity Analysis (System Description).
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007
The Hydra Battle Revisited.
Proceedings of the Rewriting, 2007

2006
The Epsilon Calculus and Herbrand Complexity.
Stud Logica, 2006

Ackermann's substitution method (remixed).
Ann. Pure Appl. Log., 2006

Herbrand's theorem and term induction.
Arch. Math. Log., 2006

Derivational Complexity of Knuth-Bendix Orders Revisited.
Proceedings of the Logic for Programming, 2006

2005
Preface.
Ann. Pure Appl. Log., 2005

Proofs of Termination of Rewrite Systems for Polytime Functions.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2003
Relating Derivation Lengths with the Slow-Growing Hierarchy Directly.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

The Epsilon Calculus (Tutorial).
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
Foreword.
Theor. Comput. Sci., 2002

On Generalizations of Semi-terms of Particularly Simple Form.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
Tableaux for Reasoning About Atomic Updates.
Proceedings of the Logic for Programming, 2001

On a Generalisation of Herbrand's Theorem.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000
Have Spass with OCC1N<sub>g</sub><sup>=</sup>.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999
System Description: CutRes 0.1: Cut Elimination by Resolution.
Proceedings of the Automated Deduction, 1999


  Loading...