Publications Note: the links below are to research reports on a web archive and correspond to long versions of the papers. Deterministic pushdown automata can compress some normal sequences With Olivier Carton Logical Methods in Computer Science (to appear) Article here. Cyclotomic Identity Testing and Applications With Nikhil Balaji, Mahsa Shirmohammadi and James Worrell International Symposium on Symbolic and Algebraic Computation (ISSAC'21), 2021 Article here. Non-commutative computations: lower bounds and polynomial identity testing With Guillaume Lagarde and Guillaume Malod In Chicago Journal on Theoretical Computer Science, 2019 Article here. Lempel-Ziv: a "one-bit catastrophe" but not a tragedy With Guillaume Lagarde ACM-SIAM Symposium on Discrete Algorithms (SODA'18), 2018 Article here. On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant With Hervé Fournier and Rémi de Verclos In Information and Computation, volume 240, 2015 (Conference version in Mathematical Foundations of Computer Science (MFCS'13), volume 8087 of LNCS, pages 433-444) Article here. Separating multilinear branching programs and formulas With Zeev Dvir, Guillaume Malod and Amir Yehudayoff Proceedings of the 44th ACM Symposium on Theory of Computing (STOC'12), pages 615-624, 2012 Article here. Interpolation in Valiant's theory With Pascal Koiran In Computational Complexity, volume 20, number 1, pages 1-20, 2011 Article here. Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable With Elvira Mayordomo and Philippe Moser In Theory of Computing Systems, volume 48, pages 731-766, 2011 Article here. VPSPACE and a transfer theorem over the reals With Pascal Koiran In Computational Complexity, volume 18, number 4, pages 551-575, 2009 (Conference version in Symposium on Theoretical Aspects of Computer Science (STACS'07), volume 4393 of LNCS, pages 417-428) Article here. A superpolynomial lower bound on the size of uniform non-constant-depth threshold circuits for the permanent With Pascal Koiran IEEE Conference on Computational Complexity, pages 35-40, 2009 Article here. VPSPACE and a transfer theorem over the complex field With Pascal Koiran In Theoretical Computer Science volume 410, number 50, pages 5244-5251, 2009 (Conference version in Mathematical Foundations of Computer Science (MFCS'07), volume 4708 of LNCS, pages 359-370) Article here. On the construction of a family of transversal subspaces over finite fields With Alexander Chistov, Hervé Fournier, Pascal Koiran In Linear Algebra and its Applications, volume 429(2-3), pages 589-600, 2008 Article here. Finding a vector orthogonal to roughly half a collection of vectors With Pierre Charbit, Emmanuel Jeandel, Pascal Koiran and Stéphan Thomassé In Journal of complexity, volume 24(1), pages 39-53, 2008 Article here. Pushdown compression With Pilar Albert, Elvira Mayordomo, Philippe Moser Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science (STACS 2008), pages 39-48, 2008 Article here. The complexity of two problems on arithmetic circuits With Pascal Koiran In Theoretical Computer Science, volume 389, pages 172-181, 2007 Article here. Symmetry of information and nonuniform lower bounds Computer Science in Russia (CSR 2007), volume 4649 of LNCS, pages 315-327, 2007 Article here. Valiant's model: from exponential sums to exponential products With Pascal Koiran Mathematical Foundations of Computer Science (MFCS 2006), volume 4162 of LNCS, pages 596-607, 2006 Article here. PhD Thesis (in French) Problèmes de décision et d'évaluation en complexité algébrique Thèse soutenue le 6 décembre 2007 à l'ENS Lyon, encadrée par Pascal Koiran Manuscrit de thèse en pdf.