33 citations · 206 across the 29 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LO2013★ 14 cited
Polynomial Path Orders
Martin Avanzini, Georg Moser
This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with m…
cs.CC2013★ 23 cited
A Combination Framework for Complexity
Martin Avanzini, Georg Moser
In this paper we present a combination framework for polynomial complexity analysis of term rewrite systems. The framework covers both derivational and runtime complexity analysis.…