Travelled to:1 × Australia
1 × Brazil
1 × Canada
1 × Poland
1 × Serbia
1 × The Netherlands
1 × United Kingdom
2 × Japan
Collaborated with:G.Moser U.D.Lago C.Sternagel R.Thiemann N.Eguchi A.Schnabl
Talks about:complex (8) order (4) analysi (3) rewrit (3) comput (3) function (2) path (2) framework (1) exponenti (1) tyrolean (1)
Person: Martin Avanzini
DBLP: Avanzini:Martin
Contributed to:
2015
201520132011
2010201020092008
2008Wrote 10 papers:
- ICFP-2015-AvanziniLM #complexity #first-order #functional #higher-order #source code
- Analysing the complexity of functional programs: higher-order meets first-order (MA, UDL, GM), pp. 152–164.
- RTA-2015-AvanziniST #certification #complexity #proving #using
- Certification of Complexity Proofs using CeTA (MA, CS, RT), pp. 23–39.
- RTA-2013-AvanziniM #complexity #framework
- A Combination Framework for Complexity (MA, GM), pp. 55–70.
- RTA-2013-AvanziniM13a #complexity
- Tyrolean Complexity Tool: Features and Usage (MA, GM), pp. 71–80.
- RTA-2011-AvanziniEM #exponential #order #term rewriting
- A Path Order for Rewrite Systems that Compute Exponential Time Functions (MA, NE, GM), pp. 123–138.
- FLOPS-2010-AvanziniM #analysis #complexity #graph grammar
- Complexity Analysis by Graph Rewriting (MA, GM), pp. 257–271.
- RTA-2010-AvanziniM #complexity #runtime
- Closing the Gap Between Runtime Complexity and Polytime Computability (MA, GM), pp. 33–48.
- RTA-2009-AvanziniM #dependence #order #polynomial
- Dependency Pairs and Polynomial Path Orders (MA, GM), pp. 48–62.
- FLOPS-2008-AvanziniM #analysis #complexity
- Complexity Analysis by Rewriting (MA, GM), pp. 130–146.
- IJCAR-2008-AvanziniMS #analysis #automation #complexity
- Automated Implicit Computational Complexity Analysis (MA, GM, AS), pp. 132–138.