Georg Moser

Available identifiers

zbMath Open moser.georgMaRDI QIDQ276250

List of research outcomes

Publication	Date of Publication	Type
Herbrand complexity and the epsilon calculus with equality	2024-01-18	Paper
Type-based analysis of logarithmic amortised complexity	2023-02-06	Paper
ATLAS: automated amortised complexity analysis of self-adjusting data structures	2022-03-25	Paper
Runtime complexity analysis of logically constrained rewriting	2022-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q5015375	2021-12-07	Paper
The Epsilon Calculus with Equality and Herbrand Complexity	2019-04-25	Paper
MædMax: a maximal ordered completion tool	2018-10-18	Paper
Automated amortised resource analysis for term rewrite systems	2018-07-09	Paper
From Jinja bytecode to term rewriting: a complexity reflecting transformation	2018-06-14	Paper
https://portal.mardi4nfdi.de/entity/Q5369475	2017-10-17	Paper
https://portal.mardi4nfdi.de/entity/Q5277843	2017-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q5277880	2017-07-12	Paper
KBOs, ordinals, subrecursive hierarchies and all that	2017-05-17	Paper
Analysing the complexity of functional programs: higher-order meets first-order	2017-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q2958530	2017-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q2958374	2017-02-01	Paper
https://portal.mardi4nfdi.de/entity/Q2958375	2017-02-01	Paper
The complexity of interaction	2016-10-24	Paper
A combination framework for complexity	2016-05-03	Paper
A new order-theoretic characterisation of the polytime computable functions	2015-05-26	Paper
Automated Complexity Analysis Based on Context-Sensitive Rewriting	2014-07-24	Paper
Amortised Resource Analysis and Typed Polynomial Interpretations	2014-07-24	Paper
Polynomial Path Orders	2013-11-28	Paper
https://portal.mardi4nfdi.de/entity/Q3165968	2012-10-19	Paper
https://portal.mardi4nfdi.de/entity/Q5389134	2012-04-25	Paper
https://portal.mardi4nfdi.de/entity/Q5389077	2012-04-24	Paper
https://portal.mardi4nfdi.de/entity/Q5389084	2012-04-24	Paper
The Derivational Complexity Induced by the Dependency Pair Method	2012-04-02	Paper
On Transfinite Knuth-Bendix Orders	2011-07-29	Paper
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems	2011-07-08	Paper
Tableaux for Reasoning about Atomic Updates	2011-05-06	Paper
Characterising Space Complexity Classes via Knuth-Bendix Orders	2010-10-12	Paper
Complexity Analysis by Graph Rewriting	2010-05-04	Paper
The Hydra battle and Cichon's principle	2009-10-19	Paper
Dependency Pairs and Polynomial Path Orders	2009-06-30	Paper
The Derivational Complexity Induced by the Dependency Pair Method	2009-06-30	Paper
The Hydra Battle Revisited	2009-03-06	Paper
Complexity, Graphs, and the Dependency Pair Method	2009-01-27	Paper
Automated Implicit Computational Complexity Analysis (System Description)	2008-11-27	Paper
Automated Complexity Analysis Based on the Dependency Pair Method	2008-11-27	Paper
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations	2008-08-28	Paper
Derivational Complexity of Knuth-Bendix Orders Revisited	2008-05-27	Paper
Complexity Analysis by Rewriting	2008-04-11	Paper
Computer Science Logic	2007-06-21	Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science	2006-11-14	Paper
Ackermann's substitution method (remixed)	2006-09-14	Paper
Herbrand's theorem and term induction	2006-05-26	Paper
The epsilon calculus and Herbrand complexity	2006-03-17	Paper
https://portal.mardi4nfdi.de/entity/Q4447240	2004-02-16	Paper
https://portal.mardi4nfdi.de/entity/Q4411836	2003-07-10	Paper
https://portal.mardi4nfdi.de/entity/Q4783326	2002-12-04	Paper
https://portal.mardi4nfdi.de/entity/Q2767012	2002-07-22	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Georg Moser