Computation with Bounded Resources
Research Group


Computation with Bounded Resources Group,
Computational Logic Group,
Institute of Computer Science



Our workshop 2FC'14 takes place on Saturday, July 12. Starting time: 14:30. See the website for further information.
New Member

As of June 1, 2014, Alexander Maringele joins our team. Alexander works on automated reasoining and soon will provide our group with its first fully fledged automated theorem prover for predicate logic with equality.
Special Issues of DICE 2012 and 2013

Our papers "A New Order-theoretic Characterisation of the Polytime Computable Functions" (Avanzini, Eguchi, Moser) and "A Combination Framework for Complexity" (Avanzini, Moser) will appear with special issues of TCS and IC respectively. The final versions can be found on our publication page.
Two Papers at RTA-TLCA 2014

The papers "Amortised Resource Analysis and Typed Polynomial Interpretations" and "Automated Complexity Analysis Based on Context-Sensitive Rewriting", co-authored by our group, have been accepted at RTA-TLCA. The papers can be found on our publication page.
New Publication

Our publication ""KBOs, Ordinals, Subrecursive Hierarchies and All That" will appear in a special issue of the Journal of Logic and Computation entitled "Concepts and Meaning". The final versions can be found on our publication page.
Old and New Members

Martin will leave us for Bolognia to work with Ugo dal Lago on the complexity analysis of higher-order rewrite systems. His corresponding fellowship, project number J-3563 has been accepted. Congratulations! Furthermore, in October Thomas Powell will join our group.
New Publication

Our journal publication "Polynomial Path Orders" has been accepted at LMCS. The paper can also be found on our publication page.
New Publication

Our publication "The Structure of Interaction" has been accepted at CSL'13, Torino, Italy. A preprint of the paper can be soon found on our publication page.
New Project

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.
New Papers

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 our publications page.
New Member

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.
Collegium Logicum announcement

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

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.
Complexity Competition

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

Homepage of 'Computations with Bounded Resources' is online.
News archive



University of Innsbruck
Technikerstrasse 21a, 2. OG
A-6020 Innsbruck, Austria


email: {firstname.lastname}