×

Bonfante, Guillaume

Author ID: bonfante.guillaume Recent zbMATH articles by "Bonfante, Guillaume"
Published as: Bonfante, Guillaume; Bonfante, G.

Publications by Year

Citations contained in zbMATH Open

16 Publications have been cited 92 times in 59 Documents Cited by Year
Algorithms with polynomial interpretation termination proof. Zbl 0987.68042
Bonfante, G.; Cichon, A.; Marion, J.-Y.; Touzet, H.
23
2001
Quasi-interpretations. A way to control resources. Zbl 1230.68077
Bonfante, G.; Marion, J.-Y.; Moyen, J.-Y.
21
2011
On lexicographic termination ordering with space bound certifications. Zbl 1073.68561
Bonfante, Guillaume; Marion, Jean-Yves; Moyen, Jean-Yves
10
2001
Complexity classes and rewrite systems with polynomial interpretation. Zbl 0934.03052
Bonfante, G.; Cichon, A.; Marion, J. Y.; Touzet, H.
5
1999
Quasi-interpretations and small space bounds. Zbl 1078.68041
Bonfante, Guillaume; Marion, Jean-Yves; Moyen, Jean-Yves
5
2005
Towards an implicit characterization of NC\(^{k}\). Zbl 1225.68091
Bonfante, G.; Kahle, R.; Marion, J.-Y.; Oitavem, I.
5
2006
Some programming languages for Logspace and Ptime. Zbl 1236.68074
Bonfante, Guillaume
5
2006
Quasi-interpretation synthesis by decomposition. An application to higher-order programs. Zbl 1147.68431
Bonfante, Guillaume; Marion, Jean-Yves; Péchoux, Romain
4
2007
A characterization of alternating log time by first order functional programs. Zbl 1138.68357
Bonfante, Guillaume; Marion, Jean-Yves; Péchoux, Romain
3
2006
Recursion schemata for NC\(^{k }\). Zbl 1157.03019
Bonfante, Guillaume; Kahle, Reinhard; Marion, Jean-Yves; Oitavem, Isabel
3
2008
Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits. Zbl 1339.68096
Bonfante, Guillaume; Kahle, Reinhard; Marion, Jean-Yves; Oitavem, Isabel
2
2016
Non-simplifying graph rewriting termination. Zbl 1464.68136
Bonfante, Guillaume; Guillaume, Bruno
2
2013
Polygraphic programs and polynomial-time functions. Zbl 1163.68016
Bonfante, Guillaume; Guiraud, Yves
1
2009
A classification of viruses through recursion theorems. Zbl 1151.68364
Bonfante, Guillaume; Kaczmarek, Matthieu; Marion, Jean-Yves
1
2007
The genus of regular languages. Zbl 1382.68132
Bonfante, Guillaume; Deloup, Florian
1
2018
Intensional properties of polygraphs. Zbl 1279.68076
Bonfante, Guillaume; Guiraud, Yves
1
2008
The genus of regular languages. Zbl 1382.68132
Bonfante, Guillaume; Deloup, Florian
1
2018
Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits. Zbl 1339.68096
Bonfante, Guillaume; Kahle, Reinhard; Marion, Jean-Yves; Oitavem, Isabel
2
2016
Non-simplifying graph rewriting termination. Zbl 1464.68136
Bonfante, Guillaume; Guillaume, Bruno
2
2013
Quasi-interpretations. A way to control resources. Zbl 1230.68077
Bonfante, G.; Marion, J.-Y.; Moyen, J.-Y.
21
2011
Polygraphic programs and polynomial-time functions. Zbl 1163.68016
Bonfante, Guillaume; Guiraud, Yves
1
2009
Recursion schemata for NC\(^{k }\). Zbl 1157.03019
Bonfante, Guillaume; Kahle, Reinhard; Marion, Jean-Yves; Oitavem, Isabel
3
2008
Intensional properties of polygraphs. Zbl 1279.68076
Bonfante, Guillaume; Guiraud, Yves
1
2008
Quasi-interpretation synthesis by decomposition. An application to higher-order programs. Zbl 1147.68431
Bonfante, Guillaume; Marion, Jean-Yves; Péchoux, Romain
4
2007
A classification of viruses through recursion theorems. Zbl 1151.68364
Bonfante, Guillaume; Kaczmarek, Matthieu; Marion, Jean-Yves
1
2007
Towards an implicit characterization of NC\(^{k}\). Zbl 1225.68091
Bonfante, G.; Kahle, R.; Marion, J.-Y.; Oitavem, I.
5
2006
Some programming languages for Logspace and Ptime. Zbl 1236.68074
Bonfante, Guillaume
5
2006
A characterization of alternating log time by first order functional programs. Zbl 1138.68357
Bonfante, Guillaume; Marion, Jean-Yves; Péchoux, Romain
3
2006
Quasi-interpretations and small space bounds. Zbl 1078.68041
Bonfante, Guillaume; Marion, Jean-Yves; Moyen, Jean-Yves
5
2005
Algorithms with polynomial interpretation termination proof. Zbl 0987.68042
Bonfante, G.; Cichon, A.; Marion, J.-Y.; Touzet, H.
23
2001
On lexicographic termination ordering with space bound certifications. Zbl 1073.68561
Bonfante, Guillaume; Marion, Jean-Yves; Moyen, Jean-Yves
10
2001
Complexity classes and rewrite systems with polynomial interpretation. Zbl 0934.03052
Bonfante, G.; Cichon, A.; Marion, J. Y.; Touzet, H.
5
1999

Citations by Year