Georg Moser - RankMe

106 papers A* 2A 7B 15C 4Misc 3Journal 48Unranked 26

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Average reward adjusted discounted reinforcement learning. Neural Comput. Appl. Manuel Schneckenreither, Georg Moser
2025	—	`conf`	Data-Driven Runtime Complexity Analysis. FroCoS Samuel Frontull, Manuel Meitinger, Georg Moser
2025	—	`conf`	LaTeXMT: Machine Translation for LaTeX Documents. EMNLP (System Demonstrations) Calvin Hoy, Samuel Frontull, Georg Moser
2025	B	`conf`	Modular abstract syntax trees (MAST): substitution tensors with second-class sorts. MFPS Marcelo P. Fiore, Ohad Kammar, Georg Moser, Sam Staton
2025	J	`jnl`	To Zip Through the Cost Analysis of Probabilistic Programs. CoRR Matthias Hetzenberger, Georg Moser, Florian Zuleger
2024	—	`conf`	A Voting Approach for Explainable Classification with Rule Learning. AIAI (4) Albert Nössig, Tobias Hell, Georg Moser
2024	J	`jnl`	Herbrand complexity and the epsilon calculus with equality. Arch. Math. Log. Kenji Miyamoto, Georg Moser
2024	J	`jnl`	Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs. Proc. ACM Program. Lang. Martin Avanzini, Gilles Barthe, Benjamin Grégoire, Georg Moser, Gabriele Vanoni
2024	B	`conf`	On Complexity of Confluence and Church-Rosser Proofs. MFCS Arnold Beckmann, Georg Moser
2024	—	`conf`	On the Hardness of Analyzing Quantum Programs Quantitatively. ESOP (2) Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix
2024	J	`jnl`	Rule by Rule: Learning with Confidence through Vocabulary Expansion. CoRR Albert Nössig, Tobias Hell, Georg Moser
2024	J	`jnl`	Rule learning by modularity. Mach. Learn. Albert Nössig, Tobias Hell, Georg Moser
2024	J	`jnl`	Rule-Based, Neural and LLM Back-Translation: Comparative Insights from a Variant of Ladin. CoRR Samuel Frontull, Georg Moser
2023	J	`jnl`	A Voting Approach for Explainable Classification with Rule Learning. CoRR Albert Nössig, Tobias Hell, Georg Moser
2023	J	`jnl`	Automated Expected Value Analysis of Recursive Programs. CoRR Martin Avanzini, Georg Moser, Michael Schaper
2023	J	`jnl`	Automated Expected Value Analysis of Recursive Programs. Proc. ACM Program. Lang. Martin Avanzini, Georg Moser, Michael Schaper
2023	J	`jnl`	On the Hardness of Analyzing Quantum Programs Quantitatively. CoRR Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix
2023	B	`conf`	α-Avoidance. FSCD Samuel Frontull, Georg Moser, Vincent van Oostrom
2022	—	`conf`	Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. CAV (2) Lorenz Leutgeb, Georg Moser, Florian Zuleger
2022	J	`jnl`	Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. CoRR Lorenz Leutgeb, Georg Moser, Florian Zuleger
2022	A*	`conf`	Quantum Expectation Transformers for Cost Analysis. LICS Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
2022	J	`jnl`	Quantum Expectation Transformers for Cost Analysis. CoRR Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
2022	J	`jnl`	Rule Learning by Modularity. CoRR Albert Nössig, Tobias Hell, Georg Moser
2022	J	`jnl`	Type-based analysis of logarithmic amortised complexity. Math. Struct. Comput. Sci. Martin Hofmann, Lorenz Leutgeb, David Obwaller, Georg Moser, Florian Zuleger
2021	—	`conf`	ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures. CAV (2) Lorenz Leutgeb, Georg Moser, Florian Zuleger
2021	C	`conf`	Teaching Software Quality Assurance with Gamification and Continuous Feedback Techniques. EDUCON Georg Moser, Raoul Vallon, Mario Bernhart, Thomas Grechenig
2021	J	`jnl`	Type-Based Analysis of Logarithmic Amortised Complexity. CoRR Martin Hofmann, Lorenz Leutgeb, Georg Moser, David Obwaller, Florian Zuleger
2020	J	`jnl`	A modular cost analysis for probabilistic programs. Proc. ACM Program. Lang. Martin Avanzini, Georg Moser, Michael Schaper
2020	J	`jnl`	Automated amortised resource analysis for term rewrite systems. Sci. Comput. Program. Georg Moser, Manuel Schneckenreither
2020	C	`conf`	Runtime Complexity Analysis of Logically Constrained Rewriting. LOPSTR Sarah Winkler, Georg Moser
2020	J	`jnl`	Runtime Complexity Analysis of Logically Constrained Rewriting. CoRR Sarah Winkler, Georg Moser
2019	J	`jnl`	Modular Runtime Complexity Analysis of Probabilistic While Programs. CoRR Martin Avanzini, Michael Schaper, Georg Moser
2019	—	`conf`	Smarter Features, Simpler Learning? ARCADE@CADE Sarah Winkler, Georg Moser
2019	J	`jnl`	The Epsilon Calculus with Equality and Herbrand Complexity. CoRR Kenji Miyamoto, Georg Moser
2018	J	`jnl`	Analysis of Logarithmic Amortised Complexity. CoRR Martin Hofmann, Georg Moser
2018	Misc	`conf`	Automated Amortised Resource Analysis for Term Rewrite Systems. FLOPS Georg Moser, Manuel Schneckenreither
2018	J	`jnl`	Automated Amortised Resource Analysis for Term Rewrite Systems. CoRR Georg Moser, Manuel Schneckenreither
2018	J	`jnl`	From Jinja bytecode to term rewriting: A complexity reflecting transformation. Inf. Comput. Georg Moser, Michael Schaper
2018	A	`conf`	MædMax: A Maximal Ordered Completion Tool. IJCAR Sarah Winkler, Georg Moser
2017	J	`jnl`	KBOs, ordinals, subrecursive hierarchies and all that. J. Log. Comput. Georg Moser
2017	—	`ed.`	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. DICE-FOPARA@ETAPS Guillaume Bonfante, Georg Moser
2017	B	`conf`	Quantified Boolean Formulas: Call the Plumber! LPAR Josef Lindsberger, Alexander Maringele, Georg Moser
2017	B	`conf`	Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk). FSCD Georg Moser
2016	J	`jnl`	A combination framework for complexity. Inf. Comput. Martin Avanzini, Georg Moser
2016	B	`conf`	Complexity of Acyclic Term Graph Rewriting. FSCD Martin Avanzini, Georg Moser
2016	—	`conf`	Kruskal's Tree Theorem for Acyclic Term Graphs. TERMGRAPH Georg Moser, Maria Anna Schett
2016	A	`conf`	TcT: Tyrolean Complexity Tool. TACAS Martin Avanzini, Georg Moser, Michael Schaper
2016	A*	`conf`	The complexity of interaction. POPL Stéphane Gimenez, Georg Moser
2015	J	`jnl`	A new order-theoretic characterisation of the polytime computable functions. Theor. Comput. Sci. Martin Avanzini, Naohi Eguchi, Georg Moser
2015	J	`jnl`	Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version). CoRR Martin Avanzini, Ugo Dal Lago, Georg Moser
2015	A	`conf`	Analysing the complexity of functional programs: higher-order meets first-order. ICFP Martin Avanzini, Ugo Dal Lago, Georg Moser
2015	—	`conf`	Leftmost Outermost Revisited. RTA Nao Hirokawa, Aart Middeldorp, Georg Moser
2015	—	`conf`	Multivariate Amortised Resource Analysis for Term Rewrite Systems. TLCA Martin Hofmann, Georg Moser
2015	C	`conf`	On the Computational Content of Termination Proofs. CiE Georg Moser, Thomas Powell
2015	J	`jnl`	The Complexity of Interaction (Long Version). CoRR Stéphane Gimenez, Georg Moser
2014	J	`jnl`	Amortised Resource Analysis and Typed Polynomial Interpretations (extended version). CoRR Martin Hofmann, Georg Moser
2014	—	`conf`	Amortised Resource Analysis and Typed Polynomial Interpretations. RTA-TLCA Martin Hofmann, Georg Moser
2014	—	`conf`	Automated Complexity Analysis Based on Context-Sensitive Rewriting. RTA-TLCA Nao Hirokawa, Georg Moser
2013	J	`jnl`	A Combination Framework for Complexity CoRR Martin Avanzini, Georg Moser
2013	—	`conf`	A Combination Framework for Complexity. RTA Martin Avanzini, Georg Moser
2013	J	`jnl`	Polynomial Path Orders. Log. Methods Comput. Sci. Martin Avanzini, Georg Moser
2013	B	`conf`	The Structure of Interaction. CSL Stéphane Gimenez, Georg Moser
2013	—	`conf`	Tyrolean Complexity Tool: Features and Usage. RTA Martin Avanzini, Georg Moser
2012	J	`jnl`	A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems CoRR Georg Moser, Michael Schaper
2012	B	`conf`	A New Order-Theoretic Characterisation of the Polytime Computable Functions. APLAS Martin Avanzini, Naohi Eguchi, Georg Moser
2012	J	`jnl`	A New Order-theoretic Characterisation of the Polytime Computable Functions CoRR Martin Avanzini, Naohi Eguchi, Georg Moser
2012	J	`jnl`	Polynomial Path Orders: A Maximal Model CoRR Martin Avanzini, Georg Moser
2011	C	`conf`	A Bi-Criteria Truthful Mechanism for Scheduling of Workflows in Clouds. CloudCom Hamid Mohammadi Fard, Radu Prodan, Georg Moser, Thomas Fahringer
2011	—	`conf`	A Path Order for Rewrite Systems that Compute Exponential Time Functions. RTA Martin Avanzini, Naohi Eguchi, Georg Moser
2011	J	`jnl`	Automated Complexity Analysis Based on the Dependency Pair Method CoRR Nao Hirokawa, Georg Moser
2011	—	`conf`	Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl
2011	A	`conf`	On Transfinite Knuth-Bendix Orders. CADE Laura Kovács, Georg Moser, Andrei Voronkov
2011	J	`jnl`	Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity CoRR Georg Moser, Andreas Schnabl
2011	—	`conf`	Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity. RTA Georg Moser, Andreas Schnabl
2011	J	`jnl`	The Derivational Complexity Induced by the Dependency Pair Method Log. Methods Comput. Sci. Georg Moser, Andreas Schnabl
2010	J	`jnl`	A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) CoRR Martin Avanzini, Naohi Eguchi, Georg Moser
2010	—	`conf`	Characterising Space Complexity Classes via Knuth-Bendix Orders. LPAR (Yogyakarta) Guillaume Bonfante, Georg Moser
2010	—	`conf`	Closing the Gap Between Runtime Complexity and Polytime Computability. RTA Martin Avanzini, Georg Moser
2010	Misc	`conf`	Complexity Analysis by Graph Rewriting. FLOPS Martin Avanzini, Georg Moser
2010	J	`jnl`	Efficient Implementation of Rewriting Revisited Technical Report CoRR Martin Avanzini, Georg Moser
2009	J	`jnl`	Dependency Pairs and Polynomial Path Orders CoRR Martin Avanzini, Georg Moser
2009	—	`conf`	Dependency Pairs and Polynomial Path Orders. RTA Martin Avanzini, Georg Moser
2009	J	`jnl`	Proof Theory at Work: Complexity Analysis of Term Rewrite Systems CoRR Georg Moser
2009	—	`conf`	The Derivational Complexity Induced by the Dependency Pair Method. RTA Georg Moser, Andreas Schnabl
2009	J	`jnl`	The Hydra battle and Cichon's principle. Appl. Algebra Eng. Commun. Comput. Georg Moser
2008	A	`conf`	Automated Complexity Analysis Based on the Dependency Pair Method. IJCAR Nao Hirokawa, Georg Moser
2008	A	`conf`	Automated Implicit Computational Complexity Analysis (System Description). IJCAR Martin Avanzini, Georg Moser, Andreas Schnabl
2008	Misc	`conf`	Complexity Analysis by Rewriting. FLOPS Martin Avanzini, Georg Moser
2008	—	`conf`	Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. FSTTCS Georg Moser, Andreas Schnabl, Johannes Waldmann
2008	B	`conf`	Complexity, Graphs, and the Dependency Pair Method. LPAR Nao Hirokawa, Georg Moser
2008	—	`conf`	Proving Quadratic Derivational Complexities Using Context Dependent Interpretations. RTA Georg Moser, Andreas Schnabl
2007	—	`conf`	The Hydra Battle Revisited. Rewriting, Computation and Proof Nachum Dershowitz, Georg Moser
2006	J	`jnl`	Ackermann's substitution method (remixed). Ann. Pure Appl. Log. Georg Moser
2006	B	`conf`	Derivational Complexity of Knuth-Bendix Orders Revisited. LPAR Georg Moser
2006	J	`jnl`	Herbrand's theorem and term induction. Arch. Math. Log. Matthias Baaz, Georg Moser
2006	J	`jnl`	The Epsilon Calculus and Herbrand Complexity. Stud Logica Georg Moser, Richard Zach
2005	J	`jnl`	Preface. Ann. Pure Appl. Log. Arnold Beckmann, Jeremy Avigad, Georg Moser
2005	—	`conf`	Proofs of Termination of Rewrite Systems for Polytime Functions. FSTTCS Toshiyasu Arai, Georg Moser
2003	—	`conf`	Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. RTA Georg Moser, Andreas Weiermann
2003	B	`conf`	The Epsilon Calculus (Tutorial). CSL Georg Moser, Richard Zach
2002	J	`jnl`	Foreword. Theor. Comput. Sci. Matthias Baaz, Georg Gottlob, Georg Moser
2002	B	`conf`	On Generalizations of Semi-terms of Particularly Simple Form. CSL Matthias Baaz, Georg Moser
2001	B	`conf`	On a Generalisation of Herbrand's Theorem. CSL Matthias Baaz, Georg Moser
2001	B	`conf`	Tableaux for Reasoning About Atomic Updates. LPAR Christian G. Fermüller, Georg Moser, Richard Zach
2000	B	`conf`	Have Spass with OCC1N LPAR Christian G. Fermüller, Georg Moser
1999	A	`conf`	System Description: CutRes 0.1: Cut Elimination by Resolution. CADE Matthias Baaz, Alexander Leitsch, Georg Moser