Robin Larrieu. Arithmétique Rapide pour des Corps Finis. PhD thesis, École polytechnique, Université Paris-Saclay, 2019.
Links: http://www.theses.fr/2019SACLX073, [PDF], [BibTeX].

Joris van der Hoeven and Robin Larrieu. Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals. Applicable Algebra in Engineering, Communication and Computing (AAECC), December 2019. Also presented as an ISSAC 2018 poster.
Links: [Published version], [Preliminary version], [BibTeX]. Poster (extended abstract): [PDF].

Robin Larrieu. Computing generic bivariate Gröbner bases with Mathemagix. ACM SIGSAM Communications in Computer Algebra, November 2019. ISSAC 2019 software demonstrations.
Links: [Published version], [BibTeX], extended abstract: [PDF].

Joris van der Hoeven and Robin Larrieu. Fast reduction of bivariate polynomials with respect to sufficiently regular Gröbner bases. In International Symposium on Symbolic and Algebraic Computation (ISSAC), 2018.
Links: [Published version], [Preliminary version], [BibTeX].

Joris van der Hoeven, Robin Larrieu, and Grégoire Lecerf. Implementing Fast Carryless Multiplication. In Mathematical Aspects of Computer and Information Sciences (MACIS), 2017.
Links: [Published version], [Preliminary version], [BibTeX].

Joris van der Hoeven and Robin Larrieu. The Frobenius FFT. In International Symposium on Symbolic and Algebraic Computation (ISSAC), 2017.
Links: [Published version], [Preliminary version], [BibTeX].

Robin Larrieu. The Truncated Fourier Transform for mixed radices. In International Symposium on Symbolic and Algebraic Computation (ISSAC), 2017.
Links: [Published version], [Preliminary version], [BibTeX].

Robin Larrieu and Natarajan Shankar. A framework for high-assurance quasi-synchronous systems. In IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE), 2014.
Links: [Published version], [BibTeX].