Romain Lebreton

Orcid: 0000-0002-0880-1190

According to our database1, Romain Lebreton authored at least 20 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Simultaneous Rational Function Reconstruction with errors: Handling multiplicities and poles.
J. Symb. Comput., 2023

Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder Codes.
Proceedings of the IEEE Information Theory Workshop, 2023

2021
Polynomial Linear System Solving with Random Errors: New Bounds and Early Termination Technique.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Enhancing simultaneous rational function recovery: adaptive error correction capability and new bounds for applications.
CoRR, 2020

On the uniqueness of simultaneous rational function reconstruction.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019
Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Simultaneous Conversions with the Residue Number System Using Linear Algebra.
ACM Trans. Math. Softw., 2018

2017
Algorithms for Structured Linear Systems Solving and Their Implementation.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016
A simple and fast online power series multiplication and its analysis.
J. Symb. Comput., 2016

2015
Relaxed Hensel lifting of triangular sets.
J. Symb. Comput., 2015

2014
Online order basis algorithm and its impact on the block Wiedemann algorithm.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013
Relaxing order basis computation.
ACM Commun. Comput. Algebra, 2013

On the complexity of solving bivariate systems: the case of non-singular solutions.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Structured FFT and TFT: symmetric and lattice polynomials.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
Contributions à l'algorithmique détendue et à la résolution des systèmes polynomiaux. (Contributions to relaxed algorithms and polynomial system solving).
PhD thesis, 2012

On the complexity of computing certain resultants.
ACM Commun. Comput. Algebra, 2012

Algorithms for the universal decomposition algebra.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Power series solutions of singular (q)-differential equations.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Relaxed p-adic Hensel lifting for algebraic systems.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
Root lifting techniques and applications to list decoding.
ACM Commun. Comput. Algebra, 2011


  Loading...