A Characterisation of Multiply Recursive Functions with Higman's Lemma
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
An upper bound on the derivational complexity of Knuth--Bendix orderings
Information and Computation - Special issue: ICC '99
Pumping and counting on the regular post embedding problem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Multiply-recursive upper bounds with Higman's Lemma
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
The power of well-structured systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 5.23 |