Marc Rybowicz

Towards a Symbolic-Numeric Method to Compute Puiseux Series: The Modular Part pdf

Adrien Poteaux, Marc Rybowicz, A. Poteaux, 2008, ArXiv.

Complexity bounds for the rational Newton-Puiseux algorithm over finite fields

Adrien Poteaux, Marc Rybowicz, A. Poteaux, 2011, Applicable Algebra in Engineering, Communication and Computing.

Maple V release 4

Marc Rybowicz, Jean-Pierre Massias, 1997 .

An algorithms for computing integral bases of an algebraic function field

Marc Rybowicz, M. Rybowicz, 1991, ISSAC '91.

On the normalization of numbers and functions defined by radicals

Marc Rybowicz, M. Rybowicz, 2003, J. Symb. Comput..

Good reduction of Puiseux series and applications

Adrien Poteaux, Marc Rybowicz, A. Poteaux, 2012, J. Symb. Comput..

Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields

Adrien Poteaux, Marc Rybowicz, A. Poteaux, 2008, ISSAC '08.

Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields

Adrien Poteaux, Marc Rybowicz, A. Poteaux, 2015, ISSAC.

Search of primitive polynomials over finite fields

Marc Rybowicz, M. Rybowicz, 1990 .