Publisher
Open Publishing Association
Reference19 articles.
1. Some programming languages for LOGSPACE and PTIME;Guillaume Bonfante,2006
2. Algorithms with polynomial interpretation termination proof;Guillaume Bonfante;J. Funct. Program.,2001
3. Quasi-interpretations: a way to control resources;Guillaume Bonfante;Theoretical Computer Science,2009
4. Characterizations of pushdown machines in terms of time-bounded computers;Stephen Cook;Journal of the ACM,1971
5. Orderings for term-rewriting systems;Nachum Dershowitz;Theoretical Computer Science,1982