Edit Profile (opens in new tab) Bonfante, Guillaume Co-Author Distance Author ID: bonfante.guillaume Published as: Bonfante, Guillaume; Bonfante, G. Documents Indexed: 25 Publications since 1999 2 Contributions as Editor Co-Authors: 22 Co-Authors with 26 Joint Publications 529 Co-Co-Authors all top 5 Co-Authors 1 single-authored 12 Marion, Jean-Yves 4 Deloup, Florian L. 3 Kahle, Reinhard 3 Moyen, Jean-Yves 3 Oitavem, Isabel 2 Cichon, Adam 2 Guillaume, Bruno 2 Guiraud, Yves 2 Kaczmarek, Matthieu 2 Péchoux, Romain 2 Touzet, Hélène 1 Dal Lago, Ugo 1 de Groote, Philippe 1 El-Aqqad, Mohamed 1 Garcia-Alfaro, Joaquin 1 Greenbaum, Benjamin D. 1 Henrot, Antoine 1 Hoyrup, Mathieu 1 Kranakis, Evangelos Konstantinou 1 Le Roux, Joseph 1 Moser, Georg 1 Perrier, Guy all top 5 Serials 3 Theoretical Computer Science 3 MSCS. Mathematical Structures in Computer Science 1 Information and Computation 1 Journal of Functional Programming 1 Lecture Notes in Computer Science 1 Logical Methods in Computer Science all top 5 Fields 26 Computer science (68-XX) 8 Mathematical logic and foundations (03-XX) 2 General and overarching topics; collections (00-XX) 2 Information and communication theory, circuits (94-XX) 1 Combinatorics (05-XX) 1 Algebraic geometry (14-XX) Publications by Year all cited Publications top 5 cited Publications 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 all cited Publications top 5 cited Publications all top 5 Cited by 70 Authors 8 Moser, Georg 7 Péchoux, Romain 6 Avanzini, Martin 6 Bonfante, Guillaume 6 Dal Lago, Ugo 5 Baillot, Patrick 5 Hainry, Emmanuel 5 Marion, Jean-Yves 4 Eguchi, Naohi 4 Kop, Cynthia 4 Lucas, Salvador 4 Simonsen, Jakob Grue 3 Bhaskar, Siddharth 3 Middeldorp, Aart 2 Amadio, Roberto M. 2 Deloup, Florian L. 2 Emmes, Fabian 2 Geser, Alfons 2 Ghyselen, Alexis 2 Giesl, Jürgen 2 Hoyrup, Mathieu 2 Kapron, Bruce M. 2 Moyen, Jean-Yves 2 Noschinski, Lars 2 Ohlebusch, Enno 2 Oitavem, Isabel 2 Schnabl, Andreas 2 Zantema, Hans 1 Albert, Elvira 1 Arenas, Puri 1 Aubert, Clément 1 Bagnol, Marc 1 Blanqui, Frédéric 1 Boudol, Gérard 1 Boussinot, Frédéric 1 Castellani, Ilaria 1 Contejean, Evelyne 1 Dal Zilio, Silvano 1 de Naurois, Jacobé Paulin 1 Dershowitz, Nachum 1 El-Aqqad, Mohamed 1 Férée, Hugo 1 Gaboardi, Marco 1 Genaim, Samir 1 Greenbaum, Benjamin D. 1 Guiraud, Yves 1 Guo, Liye 1 Gutiérrez, Raúl 1 Hadzihasanovic, Amar 1 Henrot, Antoine 1 Hirokawa, Nao 1 Jeandel, Emmanuel 1 Jones, Neil D. 1 Jouannaud, Jean-Pierre 1 Kahle, Reinhard 1 Kessler, Diana 1 Leivant, Daniel M. 1 Marché, Claude 1 Niggl, Karl-Heinz 1 Parisen Toldin, Paolo 1 Puebla, Germán 1 Ramyaa, Ramyaa 1 Schett, Maria A. 1 Schöpp, Ulrich 1 Sternagel, Thomas 1 Tomás, Ana Paula 1 Urbain, Xavier 1 Vale, Deivid 1 Wunderlich, Henning 1 Zeyen, Olivier all top 5 Cited in 12 Serials 8 Information and Computation 7 Theoretical Computer Science 5 Journal of Automated Reasoning 4 Logical Methods in Computer Science 2 MSCS. Mathematical Structures in Computer Science 2 Journal of Functional Programming 1 Annals of Pure and Applied Logic 1 Applicable Algebra in Engineering, Communication and Computing 1 Mathematical Logic Quarterly (MLQ) 1 Theory of Computing Systems 1 The Journal of Logic and Algebraic Programming 1 Journal of Logical and Algebraic Methods in Programming Cited in 5 Fields 59 Computer science (68-XX) 20 Mathematical logic and foundations (03-XX) 2 Combinatorics (05-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Algebraic geometry (14-XX) Citations by Year