Maurice Mignotte

According to our database1, Maurice Mignotte authored at least 37 papers between 1976 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Improvements of Lagrange's bound for polynomial roots.
J. Symb. Comput., 2017

2011
Testing degenerate polynomials.
Appl. Algebra Eng. Commun. Comput., 2011

2010
Approximate polynomial GCD: Small degree and small height perturbations.
J. Symb. Comput., 2010

2008
Formalism of the Access Control Model Based on the Marqued Petri Nets.
Proceedings of the Second International Conference on Future Generation Communication and Networking, 2008

2003
Linear recurrent sequences and polynomial roots.
J. Symb. Comput., 2003

2001
Estimates for Polynomial Roots.
Appl. Algebra Eng. Commun. Comput., 2001

2000
Applications of the representation of finite fields by matrices.
Theor. Comput. Sci., 2000

Bounds for the Roots of Lacunary Polynomials.
J. Symb. Comput., 2000

1998
Embedding the 3x + 1 Conjecture in a 3x + d Context.
Exp. Math., 1998

1997
Unsupervised Segmentation Applied on Sonar Images.
Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 1997

1996
Complete solutions of a family of quartic Thue and index form equations.
Math. Comput., 1996

1995
Catalan's Equation Has No New Solution with Either Exponent Less Than 10651.
Exp. Math., 1995

On the distance between the roots of a polynomial.
Appl. Algebra Eng. Commun. Comput., 1995

1994
Sur l'équation de Catalan, II.
Theor. Comput. Sci., 1994

Landau's Inequality via Hadamard's.
J. Symb. Comput., 1994

On the Smallest Divisor of a Polynomial.
J. Symb. Comput., 1994

1992
On the Product of the Largest Roots of a Polynomial.
J. Symb. Comput., 1992

Mathematics for computer algebra.
Springer, ISBN: 978-3-540-97675-2, 1992

1990
An Inequality about Irreducible Factors of Integer Polynominals (II).
Proceedings of the Applied Algebra, 1990

1988
On Mechanical Quantifier Elimination for Elementary Algebra and Geometry.
J. Symb. Comput., 1988

Sur les Entiers qui s'Ecrivent Simplement en Différentes Bases.
Eur. J. Comb., 1988

1987
Computing the Measure of a Polynomial.
J. Symb. Comput., 1987

Inequalities about factors of integer polynomials.
SIGSAM Bull., 1987

1984
On the Automatic Resolution of Certain Diophantine Equations.
Proceedings of the EUROSAM 84, 1984

1982
Identification of Algebraic Numbers.
J. Algorithms, 1982

How to Share a Secret?
Proceedings of the Cryptography, Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29, 1982

1981
Some inequalities about univariate polynomials.
Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1981

1980
Tests de Primalite.
Theor. Comput. Sci., 1980

Factorization of univariate polynomials: a statistical study.
SIGSAM Bull., 1980

Tests for polynomials.
SIGSAM Bull., 1980

1978
Intersection des Images de Certaines Suites Récurrentes Linéaires.
Theor. Comput. Sci., 1978

How to find algebraic integers whose conjugates lie near the unit circle?
ACM Commun. Comput. Algebra, 1978

Some Effective Results About Linear Recursive Sequences.
Proceedings of the Automata, 1978

1976
Algorithmes rélatifs á la décomposition dds oolynômes.
Theor. Comput. Sci., 1976

Sur la Complexité de Certains Algorithmes ou Intervient la Séparation des Racines d'un Polynome.
RAIRO Theor. Informatics Appl., 1976

On the separation of the roots of a polynomial (extended abstract).
SIGSAM Bull., 1976

Some problems about polynomials.
Proceedings of the third ACM Symposium on Symbolic and Algebraic Manipulation, 1976


  Loading...