Bruno Grenet

According to our database, Bruno Grenet authored at least 30 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Communication Optimal Unbalanced Private Set Union.

Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche

CoRR, 2024

Fast interpolation and multiplication of unbalanced polynomials.

Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche

Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

In-place fast polynomial modular remainder.

Jean-Guillaume Dumas, Bruno Grenet

Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

In-place accumulation of fast multiplication formulae.

Jean-Guillaume Dumas, Bruno Grenet

Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

2023

Polynomial modular product verification and its implications.

Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray

J. Symb. Comput., 2023

Fast in-place accumulated bilinear formulae.

Jean-Guillaume Dumas, Bruno Grenet

CoRR, 2023

2022

Random primes in arithmetic progressions.

Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche

IACR Cryptol. ePrint Arch., 2022

Sparse Polynomial Interpolation and Division in Soft-linear Time.

Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

Random Primes without Primality Testing.

Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

Computing the multilinear factors of lacunary polynomials without heights.

Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki

J. Symb. Comput., 2021

On Exact Division and Divisibility Testing for Sparse Polynomials.

Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020

One (more) line on the most Ancient Algorithm in History.

Bruno Grenet, Ilya Volkovich

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Fast in-place algorithms for polynomial operations: division, evaluation, interpolation.

Pascal Giorgi, Bruno Grenet, Daniel S. Roche

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Essentially optimal sparse polynomial multiplication.

Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019

Generic Reductions for In-place Polynomial Multiplication.

Pascal Giorgi, Bruno Grenet, Daniel S. Roche

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2016

Bounded-degree factors of lacunary multivariate polynomials.

Bruno Grenet

J. Symb. Comput., 2016

Deterministic root finding over finite fields using Graeffe transforms.

Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf

Appl. Algebra Eng. Commun. Comput., 2016

2015

Lacunaryx: computing bounded-degree factors of lacunary polynomials.

Bruno Grenet

ACM Commun. Comput. Algebra, 2015

Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms.

Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014

Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach.

Bruno Grenet

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013

On the complexity of the multivariate resultant.

Bruno Grenet, Pascal Koiran, Natacha Portier

J. Complex., 2013

Factoring bivariate lacunary polynomials without heights.

Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

Représentations des polynômes, algorithmes et bornes inférieures. (Representations of polynomials, algorithms and lower bounds).

Bruno Grenet

PhD thesis, 2012

Symmetric Determinantal Representations in Characteristic 2

Bruno Grenet, Thierry Monteil, Stéphan Thomassé

CoRR, 2012

2011

Symmetric Determinantal Representation of Weakly-Skew Circuits.

Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent.

Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits

Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier

CoRR, 2010

Acceptable Complexity Measures of Theorems.

Bruno Grenet

Complex Syst., 2010

The Multivariate Resultant Is NP-hard in Any Characteristic.

Bruno Grenet, Pascal Koiran, Natacha Portier

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

The multivariate resultant lies between NP and AM

Bruno Grenet, Pascal Koiran, Natacha Portier

CoRR, 2009