default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruno Grenet
Person information
- affiliation: Université Grenoble Alpes, France
- affiliation (former): Université de Montpellier, France
- affiliation (former): ENS Lyon, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Jean-Guillaume Dumas
, Bruno Grenet:
In-place accumulation of fast multiplication formulae. ISSAC 2024: 16-25- [c15]Jean-Guillaume Dumas, Bruno Grenet:
In-place fast polynomial modular remainder. ISSAC 2024: 26-35 - [c14]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Fast interpolation and multiplication of unbalanced polynomials. ISSAC 2024: 437-446 - [i24]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Fast interpolation and multiplication of unbalanced polynomials. CoRR abs/2402.10139 (2024) - [i23]Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche:
Communication Optimal Unbalanced Private Set Union. CoRR abs/2402.16393 (2024) - 2023
- [j7]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray:
Polynomial modular product verification and its implications. J. Symb. Comput. 116: 98-129 (2023) - [i22]Jean-Guillaume Dumas, Bruno Grenet:
In-place fast polynomial modular remainder. CoRR abs/2302.13600 (2023) - [i21]Jean-Guillaume Dumas, Bruno Grenet:
Fast in-place accumulated bilinear formulae. CoRR abs/2307.12712 (2023) - 2022
- [c13]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Random Primes without Primality Testing. ISSAC 2022: 207-215 - [c12]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Sparse Polynomial Interpolation and Division in Soft-linear Time. ISSAC 2022: 459-468 - [i20]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Random primes in arithmetic progressions. CoRR abs/2202.05955 (2022) - [i19]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Sparse polynomial interpolation and division in soft-linear time. CoRR abs/2202.08106 (2022) - [i18]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Random primes without primality testing. CoRR abs/2202.12073 (2022) - [i17]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Random primes in arithmetic progressions. IACR Cryptol. ePrint Arch. 2022: 160 (2022) - 2021
- [j6]Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Computing the multilinear factors of lacunary polynomials without heights. J. Symb. Comput. 104: 183-206 (2021) - [c11]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray:
On Exact Division and Divisibility Testing for Sparse Polynomials. ISSAC 2021: 163-170 - [i16]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray:
Polynomial modular product verification and its implications. CoRR abs/2101.02142 (2021) - [i15]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray:
On exact division and divisibility testing for sparse polynomials. CoRR abs/2102.04826 (2021) - 2020
- [c10]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray:
Essentially optimal sparse polynomial multiplication. ISSAC 2020: 202-209 - [c9]Pascal Giorgi, Bruno Grenet, Daniel S. Roche:
Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. ISSAC 2020: 210-217 - [c8]Bruno Grenet, Ilya Volkovich:
One (more) line on the most Ancient Algorithm in History. SOSA 2020: 15-17 - [i14]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray:
Essentially optimal sparse polynomial multiplication. CoRR abs/2001.11959 (2020) - [i13]Pascal Giorgi, Bruno Grenet, Daniel S. Roche:
Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. CoRR abs/2002.10304 (2020)
2010 – 2019
- 2019
- [c7]Pascal Giorgi, Bruno Grenet, Daniel S. Roche:
Generic Reductions for In-place Polynomial Multiplication. ISSAC 2019: 187-194 - [i12]Pascal Giorgi, Bruno Grenet, Daniel S. Roche:
Generic reductions for in-place polynomial multiplication. CoRR abs/1902.02967 (2019) - 2016
- [j5]Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf:
Deterministic root finding over finite fields using Graeffe transforms. Appl. Algebra Eng. Commun. Comput. 27(3): 237-257 (2016) - [j4]Bruno Grenet:
Bounded-degree factors of lacunary multivariate polynomials. J. Symb. Comput. 75: 171-192 (2016) - 2015
- [j3]Bruno Grenet:
Lacunaryx: computing bounded-degree factors of lacunary polynomials. ACM Commun. Comput. Algebra 49(4): 121-124 (2015) - [c6]Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf:
Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms. ISSAC 2015: 197-204 - [i11]Bruno Grenet:
Lacunaryx: Computing bounded-degree factors of lacunary polynomials. CoRR abs/1506.03726 (2015) - 2014
- [c5]Bruno Grenet:
Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach. ISSAC 2014: 224-231 - [i10]Bruno Grenet:
Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach. CoRR abs/1401.4720 (2014) - [i9]Bruno Grenet:
Bounded-degree factors of lacunary multivariate polynomials. CoRR abs/1412.3570 (2014) - 2013
- [j2]Bruno Grenet, Pascal Koiran, Natacha Portier:
On the complexity of the multivariate resultant. J. Complex. 29(2): 142-157 (2013) - [c4]Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Factoring bivariate lacunary polynomials without heights. ISSAC 2013: 141-148 - [i8]Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Computing the multilinear factors of lacunary polynomials without heights. CoRR abs/1311.5694 (2013) - 2012
- [b1]Bruno Grenet:
Représentations des polynômes, algorithmes et bornes inférieures. (Representations of polynomials, algorithms and lower bounds). École normale supérieure de Lyon, France, 2012 - [i7]Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Factoring bivariate lacunary polynomials without heights. CoRR abs/1206.4224 (2012) - [i6]Bruno Grenet, Pascal Koiran, Natacha Portier:
On the Complexity of the Multivariate Resultant. CoRR abs/1210.1451 (2012) - [i5]Bruno Grenet, Thierry Monteil, Stéphan Thomassé:
Symmetric Determinantal Representations in Characteristic 2. CoRR abs/1210.5879 (2012) - 2011
- [c3]Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. FSTTCS 2011: 127-139 - [c2]Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier:
Symmetric Determinantal Representation of Weakly-Skew Circuits. STACS 2011: 543-554 - [i4]Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. CoRR abs/1107.1434 (2011) - 2010
- [j1]Bruno Grenet:
Acceptable Complexity Measures of Theorems. Complex Syst. 18(4) (2010) - [c1]Bruno Grenet, Pascal Koiran, Natacha Portier:
The Multivariate Resultant Is NP-hard in Any Characteristic. MFCS 2010: 477-488 - [i3]Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier:
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits. CoRR abs/1007.3804 (2010)
2000 – 2009
- 2009
- [i2]Bruno Grenet:
Acceptable Complexity Measures of Theorems. CoRR abs/0910.0045 (2009) - [i1]Bruno Grenet, Pascal Koiran, Natacha Portier:
The multivariate resultant lies between NP and AM. CoRR abs/0912.2607 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
