Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Martin Avanzini
2010 – today
- 2013
[i6]- 2012
- [c8]Martin Avanzini, Naohi Eguchi, Georg Moser: A New Order-Theoretic Characterisation of the Polytime Computable Functions. APLAS 2012: 280-295
- [i5]Martin Avanzini, Naohi Eguchi, Georg Moser: A New Order-theoretic Characterisation of the Polytime Computable Functions. CoRR abs/1201.2553 (2012)
- [i4]
- 2011
- [c7]Martin Avanzini, Naohi Eguchi, Georg Moser: A Path Order for Rewrite Systems that Compute Exponential Time Functions. RTA 2011: 123-138
- 2010
- [c6]
- [c5]Martin Avanzini, Georg Moser: Closing the Gap Between Runtime Complexity and Polytime Computability. RTA 2010: 33-48
- [i3]Martin Avanzini, Georg Moser: Efficient Implementation of Rewriting Revisited Technical Report. CoRR abs/1001.5404 (2010)
- [i2]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
- [c4]
- [c3]
- [i1]Martin Avanzini, Georg Moser: Dependency Pairs and Polynomial Path Orders. CoRR abs/0904.0981 (2009)
- 2008
- [c2]Martin Avanzini, Georg Moser, Andreas Schnabl: Automated Implicit Computational Complexity Analysis (System Description). IJCAR 2008: 132-138
- [c1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-02 19:26 CET by the dblp team