- 15
- 10
- 2
- 1
- 1
- 1
Bruno Grenet
Maître de conférences – Université Grenoble-Alpes
30
Documents
Identifiants chercheurs
- brunogrenet
- Arxiv : grenet_b_1
- IdRef : 166151467
- 0000-0003-2057-5429
Site web
- https://membres-ljk.imag.fr/Bruno.Grenet/
Publications
- 7
- 7
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
Symmetric Determinantal Representation of Formulas and Weakly Skew CircuitsLeonid Gurvits, Philippe Pebay, J. Maurice Rojas, David Thompson. Randomization, Relaxation, and Complexity in Polynomial Equation Solving, Amer. Math. Soc., pp.61-96, 2011, Contemporary Mathematics, 978-0-8218-5228-6. ⟨10.1090/conm/556⟩
Chapitre d'ouvrage
ensl-00504925v4
|
|
Random Primes without Primality TestingISSAC 2022 - 47th International Symposium on Symbolic and Algebraic Computation, Jul 2022, Lille, France. pp.207-215, ⟨10.1145/3476446.3536191⟩
Communication dans un congrès
lirmm-03784821v1
|
|
Sparse Polynomial Interpolation and Division in Soft-linear TimeISSAC 2022 - 47th International Symposium on Symbolic and Algebraic Computation, Jul 2022, Lille, France. pp.459-468, ⟨10.1145/3476446.3536173⟩
Communication dans un congrès
lirmm-03784815v1
|
On exact division and divisibility testing for sparse polynomialsISSAC 2021 - 46th International Symposium on Symbolic and Algebraic Computation, Jul 2021, Saint-Pétersbourg, Russia. pp.163-170, ⟨10.1145/3452143.3465539⟩
Communication dans un congrès
hal-03136945v1
|
|
|
One (more) line on the most Ancient Algorithm in HistorySOSA 2020 - 1st Symposium on Simplicity in Algorithms, Jan 2020, Salt Lake City, United States. ⟨10.1137/1.9781611976014.3⟩
Communication dans un congrès
lirmm-02335368v1
|
|
Fast in-place algorithms for polynomial operations: division, evaluation, interpolationISSAC 2020 - 45th International Symposium on Symbolic and Algebraic Computation, Jul 2020, Kalamata, Greece. pp.210-217, ⟨10.1145/3373207.3404061⟩
Communication dans un congrès
lirmm-02493066v3
|
|
Essentially optimal sparse polynomial multiplicationISSAC 2020 - 45th International Symposium on Symbolic and Algebraic Computation, Jul 2020, Kalamata, Greece. pp.202-209, ⟨10.1145/3373207.3404026⟩
Communication dans un congrès
hal-02476609v2
|
|
Generic reductions for in-place polynomial multiplicationISSAC 2019 - 44th International Symposium on Symbolic and Algebraic Computation, Jul 2019, Beijing, China. pp.187-194, ⟨10.1145/3326229.3326249⟩
Communication dans un congrès
lirmm-02003089v2
|
Randomized Root Finding over Finite FFT-fields using Tangent Graeffe TransformsISSAC 2015 - 40th International Symposium on Symbolic and Algebraic Computation, Steve Linton, Jul 2015, Bath, United Kingdom. pp.197-204, ⟨10.1145/2755996.2756647⟩
Communication dans un congrès
lirmm-01327996v1
|
|
Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach39th International Symposium on Symbolic and Algebraic Computation, Jul 2014, Kobe, Japan. p224-231, ⟨10.1145/2608628.2608649⟩
Communication dans un congrès
hal-00936319v1
|
|
Factoring bivariate lacunary polynomials without heights38th International Symposium on Symbolic and Algebraic Computation, ACM, Boston, United States. p 141-148, ⟨10.1145/2465506.2465932⟩
Communication dans un congrès
ensl-00738542v1
|
|
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the PermanentIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), Indian Association for Research in Computing Science, Dec 2011, Mumbai, India. pp.16, ⟨10.4230/LIPIcs.FSTTCS.2011.127⟩
Communication dans un congrès
ensl-00607154v1
|
|
|
Symmetric Determinantal Representation of Weakly-Skew CircuitsSymposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.543-554, ⟨10.4230/LIPIcs.STACS.2011.543⟩
Communication dans un congrès
hal-00573631v1
|
|
The Multivariate Resultant is NP-hard in any CharacteristicMathematical Foundations of Computer Science 2010, Aug 2010, Brno, Czech Republic. pp.477-488, ⟨10.1007/978-3-642-15155-2_42⟩
Communication dans un congrès
ensl-00440842v3
|
|
Communication Optimal Unbalanced Private Set Union2024
Pré-publication, Document de travail
hal-04475604v1
|
|
Deterministic root finding over finite fields using Graeffe transforms2015
Pré-publication, Document de travail
hal-01104251v1
|
|
Randomized root finding over finite fields using tangent Graeffe transforms2015
Pré-publication, Document de travail
hal-01104279v1
|
|
Représentations des polynômes, algorithmes et bornes inférieuresAutre [cs.OH]. Ecole normale supérieure de lyon - ENS LYON, 2012. Français. ⟨NNT : 2012ENSL0769⟩
Thèse
tel-00770148v1
|
|
In-place fast polynomial modular remainderUniv. Grenoble Alpes. 2024
Rapport
hal-03979016v6
|
|
In-place accumulation of fast multiplication formulaeUniv. Grenoble Alpes. 2024
Rapport
hal-04167499v3
|
|
Difficulté du résultant et des grands déterminants[Rapport de recherche] RRLIP2009-32, Laboratoire de l'Informatique du Parallélisme. 2009
Rapport
ensl-00431714v1
|
|
Algorithmique avancée – Bloc 5 du DIU « Enseignement de l’Informatique au Lycée » à l'Université de MontpellierLicence. France. 2020
Cours
hal-02942042v1
|
|
Algorithme du demi-pgcdMaster. France. 2018
Cours
hal-02942054v1
|