Bruno Grenet
- Calcul Algébrique et Symbolique, Sécurité, Systèmes Complexes, Codes et Cryptologie (CASC)
Publications
Publications
|
|
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⟩ |
|
|
Optimal Communication Unbalanced Private Set Union23rd International Conference on Applied Cryptography and Network Security, Jun 2025, Munich, Germany. pp.107-135, ⟨10.1007/978-3-031-95764-2_5⟩ |
|
|
In-place fast polynomial modular remainderProceedings of the 49th International Symposium on Symbolic and Algebraic Computation (ISSAC'24), ACM SIGSAM, Jul 2024, Raleigh, NC, United States. pp.26-35, ⟨10.1145/3666000.3669672⟩ |
|
|
Fast interpolation and multiplication of unbalanced polynomialsISSAC 2024 - International Symposium on Symbolic and Algebraic Computation, Jul 2024, Raleigh, NC, United States. pp.437-446, ⟨10.1145/3666000.3669717⟩ |
|
|
In-place accumulation of fast multiplication formulaeProceedings of the 49th International Symposium on Symbolic and Algebraic Computation (ISSAC'24), ACM SIGSAM, Jul 2024, Raleigh, NC, United States. pp.16-25, ⟨10.1145/3666000.3669671⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
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⟩ |
|
|
|
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⟩ |
|
|
Factoring bivariate lacunary polynomials without heights38th International Symposium on Symbolic and Algebraic Computation, ACM, Jun 2013, Boston, United States. p 141-148, ⟨10.1145/2465506.2465932⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
Algorithms for the local and the global postage stamp problem2026 |
|
|
Randomized root finding over finite fields using tangent Graeffe transforms2015 |
|
|
Deterministic root finding over finite fields using Graeffe transforms2015 |
|
|
Fast polynomial computations with space constraintsSymbolic Computation [cs.SC]. Université Grenoble Alpes, 2025 |
|
|
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⟩ |
|
|
Difficulté du résultant et des grands déterminants[Rapport de recherche] RRLIP2009-32, Laboratoire de l'Informatique du Parallélisme. 2009 |
|
|
Algorithmique avancée – Bloc 5 du DIU « Enseignement de l’Informatique au Lycée » à l'Université de MontpellierLicence. France. 2020 |
|
|
Algorithme du demi-pgcdMaster. France. 2018 |