I agree that this site is using cookies. You can find further informations here.
X
Grenet, Bruno
166  results:
Search for persons X
?
1

Polynomial modular product verification and its implication:

Giorgi, Pascal ; Grenet, Bruno ; Perret du Cray, Armelle
Journal of Symbolic Computation.  116 (2023)  - p. 98-129 , 2023
Link: https://doi.org/10.1016/..
 
?
2

Random Primes without Primality Testing:

, In: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation,
Giorgi, Pascal ; Grenet, Bruno ; Perret du Cray, Armelle. - p. 207-215 , 2022
Link: https://dl.acm.org/doi/1..
 
?
3

Sparse Polynomial Interpolation and Division in Soft-linear..:

, In: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation,
Giorgi, Pascal ; Grenet, Bruno ; Perret du Cray, Armelle. - p. 459-468 , 2022
Link: https://dl.acm.org/doi/1..
 
?
4

On Exact Division and Divisibility Testing for Sparse Polyn..:

, In: Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation,
Giorgi, Pascal ; Grenet, Bruno ; Perret du Cray, Armelle - p. 163-170 , 2021
Link: https://dl.acm.org/doi/1..
 
?
5

Computing the multilinear factors of lacunary polynomials w..:

Chattopadhyay, Arkadev ; Grenet, Bruno ; Koiran, Pascal..
Journal of Symbolic Computation.  104 (2021)  - p. 183-206 , 2021
Link: https://doi.org/10.1016/..
 
?
6

Fast in-place algorithms for polynomial operations : div..:

, In: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation,
Giorgi, Pascal ; Grenet, Bruno ; Roche, Daniel S. - p. 210-217 , 2020
Link: https://dl.acm.org/doi/1..
 
?
7

Essentially optimal sparse polynomial multiplication:

, In: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation,
Giorgi, Pascal ; Grenet, Bruno ; Cray, Armelle Perret du - p. 202-209 , 2020
Link: https://dl.acm.org/doi/1..
 
?
8

Generic Reductions for In-place Polynomial Multiplication:

, In: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation,
Giorgi, Pascal ; Grenet, Bruno ; Roche, Daniel S. - p. 187-194 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

Lacunaryx : computing bounded-degree factors of lacunary..:

Grenet, Bruno
ACM Communications in Computer Algebra.  49 (2016)  4 - p. 121-124 , 2016
Link: https://dl.acm.org/doi/1..
 
?
10

Bounded-degree factors of lacunary multivariate polynomials:

Grenet, Bruno
Journal of Symbolic Computation.  75 (2016)  - p. 171-192 , 2016
Link: https://doi.org/10.1016/..
 
?
11

Lacunaryx: computing bounded-degree factors of lacunary pol..:

Grenet, Bruno
ACM Communications in Computer Algebra.  49 (2016)  4 - p. 121-124 , 2016
Link: https://doi.org/10.1145/..
 
?
12

Randomized Root Finding over Finite FFT-fields using Tangen..:

, In: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation,
Grenet, Bruno ; van der Hoeven, Joris ; Lecerf, Grégoire - p. 197-204 , 2015
Link: https://dl.acm.org/doi/1..
 
?
13

Deterministic root finding over finite fields using Graeffe..:

Grenet, Bruno ; van der Hoeven, Joris ; Lecerf, Grégoire
Applicable Algebra in Engineering, Communication and Computing.  27 (2015)  3 - p. 237-257 , 2015
Link: https://doi.org/10.1007/..
 
?
14

Computing low-degree factors of lacunary polynomials : a..:

, In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation,
Grenet, Bruno - p. 224-231 , 2014
Link: https://dl.acm.org/doi/1..
 
?
15

Factoring bivariate lacunary polynomials without heights:

, In: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation,
Chattopadhyay, Arkadev ; Grenet, Bruno ; Koiran, Pascal.. - p. 141-148 , 2013
Link: https://dl.acm.org/doi/1..
 
1-15