Martin Avanzini

According to our database1, Martin Avanzini authored at least 31 papers between 2008 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On probabilistic term rewriting.
Sci. Comput. Program., 2020

A modular cost analysis for probabilistic programs.
Proc. ACM Program. Lang., 2020

2019
Modular Runtime Complexity Analysis of Probabilistic While Programs.
CoRR, 2019

Type-Based Complexity Analysis of Probabilistic Functional Programs.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018
On sharing, memoization, and polynomial time.
Inf. Comput., 2018

2017
Automating sized-type inference for complexity analysis.
Proc. ACM Program. Lang., 2017

GUBS Upper Bound Solver (Extended Abstract).
Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

Automating Sized Type Inference for Complexity Analysis (Technical Report).
CoRR, 2017

Automated Sized-Type Inference and Complexity Analysis.
Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

2016
A combination framework for complexity.
Inf. Comput., 2016

TcT: Tyrolean Complexity Tool.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Complexity of Acyclic Term Graph Rewriting.
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

2015
A new order-theoretic characterisation of the polytime computable functions.
Theor. Comput. Sci., 2015

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version).
CoRR, 2015

On Sharing, Memoization, and Polynomial Time (Long Version).
CoRR, 2015

Certification of Complexity Proofs using CeTA.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Analysing the complexity of functional programs: higher-order meets first-order.
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

2013
A Haskell Library for Term Rewriting.
CoRR, 2013

Polynomial Path Orders.
Log. Methods Comput. Sci., 2013

A New Term Rewriting Characterisation of ETIME functions.
CoRR, 2013

Tyrolean Complexity Tool: Features and Usage.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

2012
Polynomial Path Orders: A Maximal Model
CoRR, 2012

2011
A Path Order for Rewrite Systems that Compute Exponential Time Functions.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2010
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)
CoRR, 2010

Efficient Implementation of Rewriting Revisited Technical Report
CoRR, 2010

Closing the Gap Between Runtime Complexity and Polytime Computability.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Complexity Analysis by Graph Rewriting.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
Dependency Pairs and Polynomial Path Orders.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

POP* and Semantic Labeling Using SAT.
Proceedings of the Interfaces: Explorations in Logic, Language and Computation, 2009

2008
Complexity Analysis by Rewriting.
Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

Automated Implicit Computational Complexity Analysis (System Description).
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008


  Loading...