Linear Ramified Higher Type Recursion and Parallel Complexity
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
On the computational complexity of imperative programming languages
Theoretical Computer Science - Implicit computational complexity
Recursion schemata for slowly growing depth circuit classes
Computational Complexity
A characterization of NCk by first order functional programs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A characterization of alternating log time by first order functional programs
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Towards an implicit characterization of NCk
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |