default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorg Moser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Kenji Miyamoto
, Georg Moser:
Herbrand complexity and the epsilon calculus with equality. Arch. Math. Log. 63(1-2): 89-118 (2024)- [j18]Albert Nössig, Tobias Hell, Georg Moser:
Rule learning by modularity. Mach. Learn. 113(10): 7479-7508 (2024) - [j17]Martin Avanzini, Gilles Barthe, Benjamin Grégoire, Georg Moser, Gabriele Vanoni:
Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs. Proc. ACM Program. Lang. 8(OOPSLA1): 784-809 (2024) - [c54]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix:
On the Hardness of Analyzing Quantum Programs Quantitatively. ESOP (2) 2024: 31-58 - [c53]Albert Nössig, Tobias Hell, Georg Moser:
A Voting Approach for Explainable Classification with Rule Learning. AIAI (4) 2024: 155-169 - [c52]Arnold Beckmann, Georg Moser:
On Complexity of Confluence and Church-Rosser Proofs. MFCS 2024: 21:1-21:16 - [i26]Samuel Frontull, Georg Moser:
Rule-Based, Neural and LLM Back-Translation: Comparative Insights from a Variant of Ladin. CoRR abs/2407.08819 (2024) - 2023
- [j16]Martin Avanzini, Georg Moser, Michael Schaper:
Automated Expected Value Analysis of Recursive Programs. Proc. ACM Program. Lang. 7(PLDI): 1050-1072 (2023) - [c51]Samuel Frontull, Georg Moser, Vincent van Oostrom:
α-Avoidance. FSCD 2023: 22:1-22:22 - [i25]Martin Avanzini, Georg Moser, Michael Schaper:
Automated Expected Value Analysis of Recursive Programs. CoRR abs/2304.01284 (2023) - [i24]Albert Nössig, Tobias Hell, Georg Moser:
A Voting Approach for Explainable Classification with Rule Learning. CoRR abs/2311.07323 (2023) - [i23]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix:
On the Hardness of Analyzing Quantum Programs Quantitatively. CoRR abs/2312.13657 (2023) - 2022
- [j15]Martin Hofmann, Lorenz Leutgeb, David Obwaller, Georg Moser, Florian Zuleger:
Type-based analysis of logarithmic amortised complexity. Math. Struct. Comput. Sci. 32(6): 794-826 (2022) - [c50]Lorenz Leutgeb, Georg Moser, Florian Zuleger:
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. CAV (2) 2022: 70-91 - [c49]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev:
Quantum Expectation Transformers for Cost Analysis. LICS 2022: 10:1-10:13 - [i22]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev:
Quantum Expectation Transformers for Cost Analysis. CoRR abs/2201.09361 (2022) - [i21]Lorenz Leutgeb, Georg Moser, Florian Zuleger:
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. CoRR abs/2206.03537 (2022) - [i20]Albert Nössig, Tobias Hell, Georg Moser:
Rule Learning by Modularity. CoRR abs/2212.12335 (2022) - 2021
- [c48]Lorenz Leutgeb, Georg Moser, Florian Zuleger:
ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures. CAV (2) 2021: 99-122 - [c47]Georg Moser, Raoul Vallon, Mario Bernhart, Thomas Grechenig:
Teaching Software Quality Assurance with Gamification and Continuous Feedback Techniques. EDUCON 2021: 505-509 - [i19]Martin Hofmann, Lorenz Leutgeb, Georg Moser, David Obwaller, Florian Zuleger:
Type-Based Analysis of Logarithmic Amortised Complexity. CoRR abs/2101.12029 (2021) - 2020
- [j14]Martin Avanzini, Georg Moser, Michael Schaper:
A modular cost analysis for probabilistic programs. Proc. ACM Program. Lang. 4(OOPSLA): 172:1-172:30 (2020) - [j13]Georg Moser, Manuel Schneckenreither:
Automated amortised resource analysis for term rewrite systems. Sci. Comput. Program. 185 (2020) - [c46]Sarah Winkler, Georg Moser:
Runtime Complexity Analysis of Logically Constrained Rewriting. LOPSTR 2020: 37-55 - [i18]Sarah Winkler, Georg Moser:
Runtime Complexity Analysis of Logically Constrained Rewriting. CoRR abs/2012.06370 (2020)
2010 – 2019
- 2019
- [c45]Sarah Winkler, Georg Moser:
Smarter Features, Simpler Learning? ARCADE@CADE 2019: 25-31 - [i17]Kenji Miyamoto, Georg Moser:
The Epsilon Calculus with Equality and Herbrand Complexity. CoRR abs/1904.11304 (2019) - [i16]Martin Avanzini, Michael Schaper, Georg Moser:
Modular Runtime Complexity Analysis of Probabilistic While Programs. CoRR abs/1908.11343 (2019) - 2018
- [j12]Georg Moser, Michael Schaper:
From Jinja bytecode to term rewriting: A complexity reflecting transformation. Inf. Comput. 261: 116-143 (2018) - [c44]Sarah Winkler, Georg Moser:
MædMax: A Maximal Ordered Completion Tool. IJCAR 2018: 472-480 - [c43]Georg Moser, Manuel Schneckenreither:
Automated Amortised Resource Analysis for Term Rewrite Systems. FLOPS 2018: 214-229 - [i15]Martin Hofmann, Georg Moser:
Analysis of Logarithmic Amortised Complexity. CoRR abs/1807.08242 (2018) - [i14]Georg Moser, Manuel Schneckenreither:
Automated Amortised Resource Analysis for Term Rewrite Systems. CoRR abs/1811.09071 (2018) - 2017
- [j11]Georg Moser:
KBOs, ordinals, subrecursive hierarchies and all that. J. Log. Comput. 27(2): 469-495 (2017) - [c42]Josef Lindsberger, Alexander Maringele, Georg Moser:
Quantified Boolean Formulas: Call the Plumber! LPAR 2017: 162-170 - [c41]Georg Moser:
Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk). FSCD 2017: 2:1-2:10 - [e1]Guillaume Bonfante, Georg Moser:
Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, DICE-FOPARA@ETAPS 2017, Uppsala, Sweden, April 22-23, 2017. EPTCS 248, 2017 [contents] - 2016
- [j10]Martin Avanzini, Georg Moser:
A combination framework for complexity. Inf. Comput. 248: 22-55 (2016) - [c40]Stéphane Gimenez, Georg Moser:
The complexity of interaction. POPL 2016: 243-255 - [c39]Martin Avanzini, Georg Moser:
Complexity of Acyclic Term Graph Rewriting. FSCD 2016: 10:1-10:18 - [c38]Martin Avanzini, Georg Moser, Michael Schaper:
TcT: Tyrolean Complexity Tool. TACAS 2016: 407-423 - [c37]Georg Moser, Maria Anna Schett:
Kruskal's Tree Theorem for Acyclic Term Graphs. TERMGRAPH 2016: 25-34 - 2015
- [j9]Martin Avanzini, Naohi Eguchi, Georg Moser:
A new order-theoretic characterisation of the polytime computable functions. Theor. Comput. Sci. 585: 3-24 (2015) - [c36]Georg Moser, Thomas Powell:
On the Computational Content of Termination Proofs. CiE 2015: 276-285 - [c35]Martin Avanzini, Ugo Dal Lago, Georg Moser:
Analysing the complexity of functional programs: higher-order meets first-order. ICFP 2015: 152-164 - [c34]Nao Hirokawa, Aart Middeldorp, Georg Moser:
Leftmost Outermost Revisited. RTA 2015: 209-222 - [c33]Martin Hofmann, Georg Moser:
Multivariate Amortised Resource Analysis for Term Rewrite Systems. TLCA 2015: 241-256 - [i13]Martin Avanzini, Ugo Dal Lago, Georg Moser:
Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version). CoRR abs/1506.05043 (2015) - [i12]Stéphane Gimenez, Georg Moser:
The Complexity of Interaction (Long Version). CoRR abs/1511.01838 (2015) - 2014
- [c32]Nao Hirokawa, Georg Moser:
Automated Complexity Analysis Based on Context-Sensitive Rewriting. RTA-TLCA 2014: 257-271 - [c31]Martin Hofmann, Georg Moser:
Amortised Resource Analysis and Typed Polynomial Interpretations. RTA-TLCA 2014: 272-286 - [i11]Martin Hofmann, Georg Moser:
Amortised Resource Analysis and Typed Polynomial Interpretations (extended version). CoRR abs/1402.1922 (2014) - 2013
- [j8]Martin Avanzini, Georg Moser:
Polynomial Path Orders. Log. Methods Comput. Sci. 9(4) (2013) - [c30]Stéphane Gimenez, Georg Moser:
The Structure of Interaction. CSL 2013: 316-331 - [c29]Martin Avanzini, Georg Moser:
A Combination Framework for Complexity. RTA 2013: 55-70 - [c28]Martin Avanzini, Georg Moser:
Tyrolean Complexity Tool: Features and Usage. RTA 2013: 71-80 - [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. Log. Methods Comput. Sci. 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)
2000 – 2009
- 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. Log. 142(1-3): 1-18 (2006) - [j3]Georg Moser, Richard Zach:
The Epsilon Calculus and Herbrand Complexity. Stud 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. Log. 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]Matthias Baaz, Georg Gottlob, 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 OCC1Ng=. LPAR 2000: 114-130
1990 – 1999
- 1999
- [c1]Matthias Baaz, Alexander Leitsch, Georg Moser:
System Description: CutRes 0.1: Cut Elimination by Resolution. CADE 1999: 212-216
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
