Andreas Schnabl

According to our database, Andreas Schnabl authored at least 7 papers between 2008 and 2011.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2011

The Derivational Complexity Induced by the Dependency Pair Method

Georg Moser, Andreas Schnabl

Log. Methods Comput. Sci., 2011

Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity.

Georg Moser, Andreas Schnabl

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

The Exact Hardness of Deciding Derivational and Runtime Complexity.

Andreas Schnabl, Jakob Grue Simonsen

Proceedings of the Computer Science Logic, 2011

2009

Cdiprover3: A Tool for Proving Derivational Complexities of Term Rewriting Systems.

Andreas Schnabl

Proceedings of the Interfaces: Explorations in Logic, Language and Computation, 2009

2008

Proving Quadratic Derivational Complexities Using Context Dependent Interpretations.

Georg Moser, Andreas Schnabl

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations.

Georg Moser, Andreas Schnabl, Johannes Waldmann

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Automated Implicit Computational Complexity Analysis (System Description).

Martin Avanzini, Georg Moser, Andreas Schnabl

Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008