| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Complexity of Acyclic Term Graph Rewriting | Avanzini, Martin et al. | 2016 |
| 2 | Certification of Complexity Proofs using CeTA | Avanzini, Martin et al. | 2015 |
| 3 | On Sharing, Memoization, and Polynomial Time | Avanzini, Martin et al. | 2015 |
| 4 | A Combination Framework for Complexity | Avanzini, Martin et al. | 2013 |
| 5 | Tyrolean Complexity Tool: Features and Usage | Avanzini, Martin et al. | 2013 |
| 6 | A Path Order for Rewrite Systems that Compute Exponential Time Functions | Avanzini, Martin et al. | 2011 |
| 7 | Closing the Gap Between Runtime Complexity and Polytime Computability | Avanzini, Martin et al. | 2010 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |