The project ACAT aims at automated runtime complexity analysis of declarative and imperative programs via transformations; it is funded by the Austrian Science Fund (FWF) and has a duration of 3 years.

Our papers "A Combination Framework for Complexity" and "Tyrolean Complexity Tool: Features and Usage" have been accepted at 24th RTA, Eindhoven, Netherlands. Preprints of these papers can be found on the publications page.

As of April 2013, Naohi Eguichi will visit our group till September 2014. Naohi's stay is funded by the Japanese Society for the Promotion of Science.

The next workshop about Structural Proof Theory will place on November 16 and 17 at LIX, Ecole Polytechnique, Palaiseau.

Our paper "A New Order-theoretic Characterisation of the Polytime Computable Functions" has beed accepted at 10th APLAS, Kyoto, Japan. A preprint can be found on the publications page.

The ComplexityWiki at termination-portal has been moved to the CBR page and can now be found here.

Homepage of 'Computations with Bounded Resources' is online.