List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Modular complexity analysis for term rewriting Logical Methods in Computer Science | 2014-04-09 | Paper |
| Modular complexity analysis via relative complexity | 2012-04-25 | Paper |
| Match-bounds revisited Information and Computation | 2009-11-27 | Paper |
| Beyond Dependency Graphs Automated Deduction – CADE-22 | 2009-07-28 | Paper |
| Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems Language and Automata Theory and Applications | 2008-11-20 | Paper |
| Proving Termination of Rewrite Systems Using Bounds Lecture Notes in Computer Science | 2008-01-02 | Paper |
Research outcomes over time
This page was built for person: Martin Korp
