Martin Avanzini
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
- [i12]Martin Avanzini, Ugo Dal Lago, Akihisa Yamada:
On Probabilistic Term Rewriting. CoRR abs/1802.09774 (2018) - 2017
- [j4]Martin Avanzini, Ugo Dal Lago:
Automating sized-type inference for complexity analysis. PACMPL 1(ICFP): 43:1-43:29 (2017) - [c17]Martin Avanzini, Ugo Dal Lago:
Automated Sized-Type Inference and Complexity Analysis. DICE-FOPARA@ETAPS 2017: 7-16 - [c16]Martin Avanzini, Michael Schaper:
GUBS Upper Bound Solver (Extended Abstract). DICE-FOPARA@ETAPS 2017: 17-23 - [i11]Martin Avanzini, Ugo Dal Lago:
Automating Sized Type Inference for Complexity Analysis (Technical Report). CoRR abs/1706.09169 (2017) - 2016
- [j3]Martin Avanzini, Georg Moser:
A combination framework for complexity. Inf. Comput. 248: 22-55 (2016) - [c15]
- [c14]
- 2015
- [j2]Martin Avanzini, Naohi Eguchi, Georg Moser:
A new order-theoretic characterisation of the polytime computable functions. Theor. Comput. Sci. 585: 3-24 (2015) - [c13]Martin Avanzini, Ugo Dal Lago, Georg Moser:
Analysing the complexity of functional programs: higher-order meets first-order. ICFP 2015: 152-164 - [c12]Martin Avanzini, Christian Sternagel, René Thiemann:
Certification of Complexity Proofs using CeTA. RTA 2015: 23-39 - [c11]
- [i10]Martin Avanzini, Ugo Dal Lago:
On Sharing, Memoization, and Polynomial Time (Long Version). CoRR abs/1501.00894 (2015) - [i9]Martin Avanzini, Ugo Dal Lago, Georg Moser:
Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version). CoRR abs/1506.05043 (2015) - 2013
- [j1]Martin Avanzini, Georg Moser:
Polynomial Path Orders. Logical Methods in Computer Science 9(4) (2013) - [c10]
- [c9]
- [i8]
- [i7]Bertram Felgenhauer, Martin Avanzini, Christian Sternagel:
A Haskell Library for Term Rewriting. CoRR abs/1307.2328 (2013) - [i6]Martin Avanzini, Naohi Eguchi:
A New Term Rewriting Characterisation of ETIME functions. CoRR abs/1312.7284 (2013) - 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]
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-03-15 23:35 CET by the dblp team