default search action
Maurice Mignotte
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j29]Maurice Mignotte, Paul Voutier:
A kit for linear forms in three logarithms. Math. Comput. 93(348): 1903-1951 (2023)
2010 – 2019
- 2017
- [j28]Prashant Batra, Maurice Mignotte, Doru Stefanescu:
Improvements of Lagrange's bound for polynomial roots. J. Symb. Comput. 82: 19-25 (2017) - 2011
- [j27]Mihai Cipu, Ismaïla Diouf, Maurice Mignotte:
Testing degenerate polynomials. Appl. Algebra Eng. Commun. Comput. 22(4): 289-300 (2011) - 2010
- [j26]Joachim von zur Gathen, Maurice Mignotte, Igor E. Shparlinski:
Approximate polynomial GCD: Small degree and small height perturbations. J. Symb. Comput. 45(8): 879-886 (2010)
2000 – 2009
- 2008
- [c8]Abderrahim Ghadi, Driss Mammass, Maurice Mignotte, Alain Sartout:
Formalism of the Access Control Model Based on the Marqued Petri Nets. FGCN (2) 2008: 201-204 - 2003
- [j25]Maurice Mignotte, Doru Stefanescu:
Linear recurrent sequences and polynomial roots. J. Symb. Comput. 35(6): 637-649 (2003) - 2001
- [j24]Maurice Mignotte, Doru Stefanescu:
Estimates for Polynomial Roots. Appl. Algebra Eng. Commun. Comput. 12(6): 437-453 (2001) - 2000
- [j23]Maurice Mignotte:
Bounds for the Roots of Lacunary Polynomials. J. Symb. Comput. 30(3): 325-327 (2000) - [j22]Eric Kern, Maurice Mignotte:
Applications of the representation of finite fields by matrices. Theor. Comput. Sci. 244(1-2): 263-265 (2000)
1990 – 1999
- 1998
- [j21]Edward G. Belaga, Maurice Mignotte:
Embedding the 3x + 1 Conjecture in a 3x + d Context. Exp. Math. 7(2): 145-151 (1998) - 1997
- [c7]Maurice Mignotte, Christophe Collet, Patrick Pérez, Patrick Bouthemy:
Unsupervised Segmentation Applied on Sonar Images. EMMCVPR 1997: 491-506 - 1996
- [j20]Maurice Mignotte, Attila Pethö, Ralf Roth:
Complete solutions of a family of quartic Thue and index form equations. Math. Comput. 65(213): 341-354 (1996) - 1995
- [j19]Maurice Mignotte:
On the distance between the roots of a polynomial. Appl. Algebra Eng. Commun. Comput. 6(6): 327-332 (1995) - [j18]Maurice Mignotte, Yves Roy:
Catalan's Equation Has No New Solution with Either Exponent Less Than 10651. Exp. Math. 4(4): 259-268 (1995) - 1994
- [j17]Maurice Mignotte, Philippe H. Glesser:
On the Smallest Divisor of a Polynomial. J. Symb. Comput. 17(3): 277-282 (1994) - [j16]Maurice Mignotte, Philippe H. Glesser:
Landau's Inequality via Hadamard's. J. Symb. Comput. 18(4): 379-383 (1994) - [j15]Maurice Mignotte:
Sur l'équation de Catalan, II. Theor. Comput. Sci. 123(1): 145-149 (1994) - 1992
- [b1]Maurice Mignotte:
Mathematics for computer algebra. Springer 1992, ISBN 978-3-540-97675-2, pp. I-XIV, 1-346 - [j14]Maurice Mignotte:
On the Product of the Largest Roots of a Polynomial. J. Symb. Comput. 13(6): 605-612 (1992) - 1990
- [c6]Philippe H. Glesser, Maurice Mignotte:
An Inequality about Irreducible Factors of Integer Polynominals (II). AAECC 1990: 260-266
1980 – 1989
- 1988
- [j13]Maurice Mignotte:
Sur les Entiers qui s'Ecrivent Simplement en Différentes Bases. Eur. J. Comb. 9(4): 307-316 (1988) - [j12]Dennis S. Arnon, Maurice Mignotte:
On Mechanical Quantifier Elimination for Elementary Algebra and Geometry. J. Symb. Comput. 5(1/2): 237-259 (1988) - 1987
- [j11]Maurice Mignotte:
Inequalities about factors of integer polynomials. SIGSAM Bull. 21(4): 24 (1987) - [j10]L. Cerlienco, Maurice Mignotte, F. Piras:
Computing the Measure of a Polynomial. J. Symb. Comput. 4(1): 21-33 (1987) - 1984
- [c5]Maurice Mignotte:
On the Automatic Resolution of Certain Diophantine Equations. EUROSAM 1984: 378-385 - 1982
- [j9]Maurice Mignotte:
Identification of Algebraic Numbers. J. Algorithms 3(3): 197-204 (1982) - [c4]Maurice Mignotte:
How to Share a Secret? EUROCRYPT 1982: 371-375 - 1981
- [c3]Maurice Mignotte:
Some inequalities about univariate polynomials. SYMSACC 1981: 195-199 - 1980
- [j8]Maurice Mignotte:
Tests for polynomials. SIGSAM Bull. 14(1): 21-22 (1980) - [j7]Maurice Mignotte:
Factorization of univariate polynomials: a statistical study. SIGSAM Bull. 14(4): 41-44 (1980) - [j6]Maurice Mignotte:
Tests de Primalite. Theor. Comput. Sci. 12: 109-117 (1980)
1970 – 1979
- 1978
- [j5]Maurice Mignotte:
How to find algebraic integers whose conjugates lie near the unit circle? ACM Commun. Comput. Algebra 11-12(4-1): 9-10 (1978) - [j4]Maurice Mignotte:
Intersection des Images de Certaines Suites Récurrentes Linéaires. Theor. Comput. Sci. 7: 117-122 (1978) - [c2]Maurice Mignotte:
Some Effective Results About Linear Recursive Sequences. ICALP 1978: 322-329 - 1976
- [j3]Maurice Mignotte:
On the separation of the roots of a polynomial (extended abstract). SIGSAM Bull. 10(2): 8-9 (1976) - [j2]Maurice Mignotte:
Sur la Complexité de Certains Algorithmes ou Intervient la Séparation des Racines d'un Polynome. RAIRO Theor. Informatics Appl. 10(2): 51-55 (1976) - [j1]Maurice Mignotte:
Algorithmes rélatifs á la décomposition dds oolynômes. Theor. Comput. Sci. 1(3): 227-235 (1976) - [c1]Maurice Mignotte:
Some problems about polynomials. SYMSACC 1976: 227-228
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-09 23:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint