Bruno Grenet

53 papers A 1B 13Journal 35Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Algorithms for the local and the global postage stamp problem.
CoRR
Léo Colisson Palais, Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan
2026 J jnl
Fast in-place accumulation.
J. Symb. Comput.
Jean-Guillaume Dumas, Bruno Grenet
2026 J jnl
Oblivious Ciphertext Compression via Linear Codes.
IACR Cryptol. ePrint Arch.
Pascal Giorgi, Bruno Grenet, Mark Simkin
2025 J jnl
Fast polynomial computations with space constraints.
CoRR
Bruno Grenet
2025 — conf
Optimal Communication Unbalanced Private Set Union.
ACNS (2)
Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche
2024 J jnl
Communication Optimal Unbalanced Private Set Union.
CoRR
Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche
2024 B conf
Fast interpolation and multiplication of unbalanced polynomials.
ISSAC
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2024 J jnl
Fast interpolation and multiplication of unbalanced polynomials.
CoRR
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2024 B conf
In-place accumulation of fast multiplication formulae.
ISSAC
Jean-Guillaume Dumas, Bruno Grenet
2024 B conf
In-place fast polynomial modular remainder.
ISSAC
Jean-Guillaume Dumas, Bruno Grenet
2023 J jnl
Fast in-place accumulated bilinear formulae.
CoRR
Jean-Guillaume Dumas, Bruno Grenet
2023 J jnl
In-place fast polynomial modular remainder.
CoRR
Jean-Guillaume Dumas, Bruno Grenet
2023 J jnl
Polynomial modular product verification and its implications.
J. Symb. Comput.
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray
2022 B conf
Random Primes without Primality Testing.
ISSAC
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2022 J jnl
Random primes in arithmetic progressions.
CoRR
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2022 J jnl
Random primes in arithmetic progressions.
IACR Cryptol. ePrint Arch.
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2022 J jnl
Random primes without primality testing.
CoRR
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2022 B conf
Sparse Polynomial Interpolation and Division in Soft-linear Time.
ISSAC
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2022 J jnl
Sparse polynomial interpolation and division in soft-linear time.
CoRR
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2021 J jnl
Computing the multilinear factors of lacunary polynomials without heights.
J. Symb. Comput.
Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2021 B conf
On Exact Division and Divisibility Testing for Sparse Polynomials.
ISSAC
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray
2021 J jnl
On exact division and divisibility testing for sparse polynomials.
CoRR
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray
2021 J jnl
Polynomial modular product verification and its implications.
CoRR
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray
2020 B conf
Essentially optimal sparse polynomial multiplication.
ISSAC
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray
2020 J jnl
Essentially optimal sparse polynomial multiplication.
CoRR
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray
2020 B conf
Fast in-place algorithms for polynomial operations: division, evaluation, interpolation.
ISSAC
Pascal Giorgi, Bruno Grenet, Daniel S. Roche
2020 J jnl
Fast in-place algorithms for polynomial operations: division, evaluation, interpolation.
CoRR
Pascal Giorgi, Bruno Grenet, Daniel S. Roche
2020 — conf
One (more) line on the most Ancient Algorithm in History.
SOSA
Bruno Grenet, Ilya Volkovich
2019 B conf
Generic Reductions for In-place Polynomial Multiplication.
ISSAC
Pascal Giorgi, Bruno Grenet, Daniel S. Roche
2019 J jnl
Generic reductions for in-place polynomial multiplication.
CoRR
Pascal Giorgi, Bruno Grenet, Daniel S. Roche
2016 J jnl
Bounded-degree factors of lacunary multivariate polynomials.
J. Symb. Comput.
Bruno Grenet
2016 J jnl
Deterministic root finding over finite fields using Graeffe transforms.
Appl. Algebra Eng. Commun. Comput.
Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf
2015 J jnl
Lacunaryx: Computing bounded-degree factors of lacunary polynomials.
CoRR
Bruno Grenet
2015 J jnl
Lacunaryx: computing bounded-degree factors of lacunary polynomials.
ACM Commun. Comput. Algebra
Bruno Grenet
2015 B conf
Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms.
ISSAC
Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf
2014 J jnl
Bounded-degree factors of lacunary multivariate polynomials.
CoRR
Bruno Grenet
2014 B conf
Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach.
ISSAC
Bruno Grenet
2014 J jnl
Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach.
CoRR
Bruno Grenet
2013 J jnl
Computing the multilinear factors of lacunary polynomials without heights.
CoRR
Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2013 B conf
Factoring bivariate lacunary polynomials without heights.
ISSAC
Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2013 J jnl
On the complexity of the multivariate resultant.
J. Complex.
Bruno Grenet, Pascal Koiran, Natacha Portier
2012 J jnl
Factoring bivariate lacunary polynomials without heights
CoRR
Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2012 J jnl
On the Complexity of the Multivariate Resultant
CoRR
Bruno Grenet, Pascal Koiran, Natacha Portier
2012 — —
Représentations des polynômes, algorithmes et bornes inférieures. (Representations of polynomials, algorithms and lower bounds).
Bruno Grenet
2012 J jnl
Symmetric Determinantal Representations in Characteristic 2
CoRR
Bruno Grenet, Thierry Monteil, Stéphan Thomassé
2011 A conf
Symmetric Determinantal Representation of Weakly-Skew Circuits.
STACS
Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier
2011 J jnl
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent
CoRR
Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2011 — conf
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent.
FSTTCS
Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2010 J jnl
Acceptable Complexity Measures of Theorems.
Complex Syst.
Bruno Grenet
2010 J jnl
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits
CoRR
Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier
2010 B conf
The Multivariate Resultant Is NP-hard in Any Characteristic.
MFCS
Bruno Grenet, Pascal Koiran, Natacha Portier
2009 J jnl
Acceptable Complexity Measures of Theorems
CoRR
Bruno Grenet
2009 J jnl
The multivariate resultant lies between NP and AM
CoRR
Bruno Grenet, Pascal Koiran, Natacha Portier