, Generic ideals and Moreno-Soc??as conjucture, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.21-23, 2001.
DOI : 10.1145/384101.384105
, The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in Drosophila melanogaster, Journal of Theoretical Biology, vol.223, issue.1, pp.1-18, 2003.
DOI : 10.1016/S0022-5193(03)00035-3
, Comparison between XL and Gröbner basis algorithms, Advances in Cryptology?ASIACRYPT 2004, pp.157-167, 2004.
DOI : 10.1007/978-3-540-30539-2_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.4696
, Introduction to Commutative Algebra, 1969.
, On the Theories of Triangular Sets, Journal of Symbolic Computation, vol.28, issue.1-2, pp.105-124, 1999.
DOI : 10.1006/jsco.1999.0269
URL : https://hal.archives-ouvertes.fr/hal-01148870
, Triangular Sets for Solving Polynomial Systems: a Comparative Implementation of Four Methods, Journal of Symbolic Computation, vol.28, issue.1-2, pp.125-154, 1999.
DOI : 10.1006/jsco.1999.0270
URL : https://hal.archives-ouvertes.fr/hal-01148862
, Using Galois Ideals for Computing Relative Resolvents, Journal of Symbolic Computation, vol.30, issue.6, pp.635-651, 2000.
DOI : 10.1006/jsco.2000.0376
URL : https://hal.archives-ouvertes.fr/inria-00099277
, Algorithmic Thomas decomposition of algebraic and differential systems, Journal of Symbolic Computation, vol.47, issue.10, pp.471233-1266, 2012.
DOI : 10.1016/j.jsc.2011.12.043
, Algebraic cryptanalysis [10] M. Bardet. ´ Etude des systèmes algébriques surdéterminés. Applications aux codes correcteurs etàetà la cryptographie, 2004.
DOI : 10.1007/978-0-387-88757-9
, On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations, International Conference on Polynomial System Solving -ICPSS, pp.71-75, 2004.
, Changing the ordering of Gröbner bases with LLL: Case of two variables, Proceedings of ISSAC 2003, pp.23-29, 2003.
, The shape of the Shape Lemma, Proceedings of the international symposium on Symbolic and algebraic computation , ISSAC '94, pp.129-133, 1994.
DOI : 10.1145/190347.190382
, Gröbner Bases: a Computational Approach to Commutative Algebra, Graduate Texts in Mathematics, 1993.
, Solving polynomial systems over finite fields, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.67-74, 2012.
DOI : 10.1145/2442829.2442843
URL : https://hal.archives-ouvertes.fr/hal-00776070
, Well known theorems on triangular systems and the D5 principle, Proceedings of Transgressive Computing, pp.79-91, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00137158
, The Correction Capability of the Berlekamp???Massey???Sakata Algorithm with Majority Voting, Applicable Algebra in Engineering, Communication and Computing, vol.34, issue.5, part 2, pp.315-335, 2006.
DOI : 10.1007/s00200-006-0015-8
, Fast solution of toeplitz systems of equations and computation of Pad?? approximants, Journal of Algorithms, vol.1, issue.3, pp.259-295, 1980.
DOI : 10.1016/0196-6774(80)90013-9
, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal, 1965.
, A criterion for detecting unnecessary reductions in the construction of Gröbner-bases. Symbolic and Algebraic Computation, pp.3-21, 1979.
, Gröbner bases: An algorithmic method in polynomial ideal theory, Multidimensional Systems Theory, pp.184-232
, A zero-dimensional Gröbner basis for AES-128, LNCS, vol.4047, pp.78-88, 2006.
, A characteristic set method for solving boolean equations and applications in cryptanalysis of stream ciphers*, Journal of Systems Science and Complexity, vol.26, issue.4, pp.191-208, 2008.
DOI : 10.1007/s11424-008-9103-0
, Use of Grobner bases to decode binary cyclic codes up to the true minimum distance, IEEE Transactions on Information Theory, vol.40, issue.5, pp.1654-1661, 1994.
DOI : 10.1109/18.333885
, Mechanical Geometry Theorem Proving, 1988.
DOI : 10.1007/978-94-009-4037-6
, Ritt-Wu's decomposition algorithm and geometry theorem proving, 10th International Conference on Automated Deduction, pp.207-220, 1990.
DOI : 10.1007/3-540-52885-7_89
, Automated reasoning in differential geometry and mechanics using the characteristic set method, Journal of Automated Reasoning, vol.3, issue.2, pp.173-189, 1993.
DOI : 10.1007/BF00881835
, Generic initial ideal for complete intersections of embedding dimension three with strong Lefschetz property, Bulletin Mathématique de la Société des Sciences Mathématiques de Roumanie, pp.33-66, 2007.
, Converting bases with the Gröbner walk, Journal of Symbolic Computation, vol.24, pp.3-4465, 1997.
, Polynomial real root isolation using Descarte's rule of signs, Proceedings of the third ACM symposium on Symbolic and algebraic computation , SYMSAC '76, pp.272-275, 1976.
DOI : 10.1145/800205.806346
, Buchberger algorithm and integer programming, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp.130-139, 1991.
DOI : 10.1007/3-540-54522-0_102
, Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, Advances in Cryptology ? EUROCRYPT, pp.392-407, 2000.
DOI : 10.1007/3-540-45539-6_27
, Cryptanalysis of Block Ciphers with Overdefined Systems of Equations, Advances in Cryptology ? ASI- ACRYPT 2002, pp.267-287, 2002.
DOI : 10.1007/3-540-36178-2_17
, Algebraic Cryptanalysis of the Data Encryption Standard, Cryptography and Coding, pp.152-169
DOI : 10.1007/978-3-540-77272-9_10
, Ideals, Varieties, and Algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra Undergraduate Texts in Mathematics, 1997.
, Using Algebraic Geometry, 1998.
DOI : 10.1007/978-1-4757-6911-1
, Lifting techniques for triangular decompositions, Proceedings of the 2005 international symposium on Symbolic and algebraic computation , ISSAC '05, pp.108-115
DOI : 10.1145/1073884.1073901
, On the complexity of the D5 principle, Transgressive Computing, pp.149-168, 2006.
DOI : 10.1145/1113439.1113457
, Factorization over finitely generated fields, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation , SYMSAC '81, pp.200-205, 1981.
DOI : 10.1145/800206.806396
, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.
DOI : 10.1145/368273.368557
, Singular 3- 1-4 ? A computer algebra system for polynomial computations, 2012.
, About a new method for computing in algebraic number fields, EUROCAL'85, pp.289-290, 1985.
, DM Wang simple systems and dynamic constructible closure, pp.2000-2016, 2000.
, Algebraic Numbers: An Example of Dynamic Evaluation, Journal of Symbolic Computation, vol.18, issue.5, pp.429-445, 1994.
DOI : 10.1006/jsco.1994.1057
, F5C: A variant of Faug??re???s F5 algorithm with reduced Gr??bner bases, Journal of Symbolic Computation, vol.45, issue.12, pp.1442-1458, 2010.
DOI : 10.1016/j.jsc.2010.06.019
, An extensible SAT-solver, Theory and Applications of Satisfiability Testing, pp.333-336, 2004.
, List decoding for noisy channels, 1957.
, A new efficient algorithm for computing Gröbner bases (F 4 ), Journal of Pure and Applied Algebra, vol.139, pp.1-361, 1999.
, A new efficient algorithm for computing Gröbner bases without reduction to zero (F 5 ), Proceedings of ISSAC 2002, pp.75-83, 2002.
, Fast change of ordering with exponent ??, ACM Communications in Computer Algebra, vol.46, issue.3/4, pp.92-93, 2012.
DOI : 10.1145/2429135.2429149
, Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm, Journal of Cryptology, vol.32, issue.1, 2012.
DOI : 10.1007/s00145-013-9158-5
, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4, pp.329-344, 1993.
DOI : 10.1006/jsco.1993.1051
, Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases, Advances in Cryptology ? CRYPTO 2003, pp.44-60, 2003.
, Fast algorithm for change of ordering of zerodimensional Gröbner bases with sparse multiplication matrices, Proceedings of ISSAC 2011, pp.115-122, 2011.
, Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology, Proceedings of ISSAC 2010, pp.257-264, 2010.
, Gr??bner bases of bihomogeneous ideals generated by polynomials of bidegree <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>: Algorithms and complexity, Journal of Symbolic Computation, vol.46, issue.4, pp.406-437, 2011.
DOI : 10.1016/j.jsc.2010.10.014
, Critical points and Gröbner bases: the unmixed case, Proceedings of ISSAC 2012, pp.162-169, 2012.
, Decoding algebraic-geometric codes up to the designed minimum distance, IEEE Transactions on Information Theory, vol.39, issue.1, pp.37-45, 1993.
DOI : 10.1109/18.179340
, On the key equation, IEEE Transactions on Information Theory, vol.41, issue.5, pp.1290-1302, 1995.
DOI : 10.1109/18.412677
, Solving a Multivariable Congruence by Change of Term Order, Journal of Symbolic Computation, vol.24, issue.5, pp.575-590, 1997.
DOI : 10.1006/jsco.1997.0153
, Derivations and Radicals of Polynomial Ideals over Fields of Arbitrary Characteristic, Journal of Symbolic Computation, vol.33, issue.5, pp.609-625, 2002.
DOI : 10.1006/jsco.2002.0525
, Computing Gr??bner fans, Mathematics of Computation, vol.76, issue.260, pp.2189-2212, 2007.
DOI : 10.1090/S0025-5718-07-01986-2
, Characteristic set algorithms for equation solving in finite fields, Journal of Symbolic Computation, vol.47, issue.6, pp.655-679, 2012.
DOI : 10.1016/j.jsc.2011.12.025
, Computers and Intractability: A Guide to the Theory of NP-completeness, 1979.
, Properties of Gröbner bases under specializations, LNCS, vol.87, issue.378, pp.293-297, 1989.
, Square-free algorithms in positive characteristic Applicable Algebra in Engineering, Communication and Computing, vol.7, issue.1, pp.1-14, 1996.
, Codes on algebraic curves, Soviet Math. Dokl, vol.24, issue.1, pp.170-172, 1981.
, Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Transactions on Information Theory, vol.45, issue.6, pp.1757-1767, 1999.
DOI : 10.1109/18.782097
, Systematic encoding via Gröbner bases for a class of algebraic-geometric Goppa codes, IEEE Transactions on Information Theory, issue.6, pp.411752-1761, 1995.
, Algebraic Geometry Codes, 1998.
, Attacking Bivium and Trivium with the Characteristic Set Method, Progress in Cryptology? AFRICACRYPT 2011, pp.77-91, 2011.
DOI : 10.1007/BF02328447
, Notes on Triangular Sets and Triangulation-Decomposition Algorithms I: Polynomial Systems, Symbolic and Numerical Scientific Computation, pp.143-158, 2003.
DOI : 10.1007/3-540-45084-X_1
, On factorization of multivariate polynomials over algebraic number and function fields, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.199-206, 2009.
DOI : 10.1145/1576702.1576731
, A simple Hankel interpretation of the Berlekamp-Massey algorithm, Linear Algebra and its Applications, vol.125, pp.65-76, 1989.
DOI : 10.1016/0024-3795(89)90032-3
, A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties, Journal of Symbolic Computation, vol.15, issue.2, pp.143-167, 1993.
DOI : 10.1006/jsco.1993.1011
, Algorithmic Properties of Polynomial Rings, Journal of Symbolic Computation, vol.26, issue.5, pp.525-581, 1998.
DOI : 10.1006/jsco.1998.0227
, Polynomial factorization, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.3-4, 2003.
DOI : 10.1145/860854.860857
, Using Gr??bner bases to reason about geometry problems, Journal of Symbolic Computation, vol.2, issue.4, pp.399-408, 1986.
DOI : 10.1016/S0747-7171(86)80007-4
URL : http://doi.org/10.1016/s0747-7171(86)80007-4
, The Origin of Order: Self-Organization and Selection in Evolution, 1993.
, Solving Nonlinear Equations with Newton's Method, Society for Industrial Mathematics, vol.1, 1987.
DOI : 10.1137/1.9780898718898
, The Calculation of Radical Ideals in Positive Characteristic, Journal of Symbolic Computation, vol.34, issue.3, pp.229-238, 2002.
DOI : 10.1006/jsco.2002.0560
, Algebraic soft-decision decoding of reed-solomon codes, IEEE Transactions on Information Theory, vol.49, issue.11, pp.2809-2825, 2003.
DOI : 10.1109/TIT.2003.819332
, A computational algebra approach to the reverse engineering of gene regulatory networks, Journal of Theoretical Biology, vol.229, issue.4, pp.523-537, 2004.
DOI : 10.1016/j.jtbi.2004.04.037
, Computer Algebra in Systems Biology, American Mathematical Monthly, vol.116, issue.10, pp.882-891, 2009.
DOI : 10.4169/000298909X477005
, Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations, Computer Algebra, EUROCAL' 83, pp.146-156
, A new method for solving algebraic systems of positive dimension, Discrete Applied Mathematics, vol.33, issue.1-3, pp.147-160, 1991.
DOI : 10.1016/0166-218X(91)90113-B
, Solving zero-dimensional algebraic systems, Journal of Symbolic Computation, vol.13, issue.2, pp.117-131, 1992.
DOI : 10.1016/S0747-7171(08)80086-7
URL : http://doi.org/10.1016/s0747-7171(08)80086-7
, List decoding of Reed???Solomon codes from a Gr??bner basis perspective, Journal of Symbolic Computation, vol.43, issue.9, pp.645-658, 2008.
DOI : 10.1016/j.jsc.2008.01.002
, The RegularChains library in Maple 10, pp.355-368, 2005.
, An Algorithm for Transforming Regular Chain into Normal Chain, Computer Mathematics LNCS, vol.5081, pp.236-245, 2008.
DOI : 10.1007/978-3-540-87827-8_20
, Computations modulo regular chains, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.239-246, 2009.
DOI : 10.1145/1576702.1576736
URL : http://arxiv.org/abs/0903.3690
, Fast arithmetic for triangular sets, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.269-276, 2007.
DOI : 10.1145/1277548.1277585
, Stability Analysis for Discrete Biological Models Using Algebraic Methods, Mathematics in Computer Science, vol.41, issue.3, pp.247-262, 2012.
DOI : 10.1007/s11786-011-0096-z
URL : https://hal.archives-ouvertes.fr/hal-01294709
, Decomposing polynomial sets into simple sets over finite fields: The zero-dimensional case, Computers & Mathematics with Applications, vol.60, issue.11, pp.602983-2997, 2010.
DOI : 10.1016/j.camwa.2010.09.059
URL : https://hal.archives-ouvertes.fr/hal-00706787
, Simple decomposition of polynomial sets over finite fields (in Chinese), Journal of Systems Science and Mathematical Sciences, vol.32, issue.1, pp.15-26, 2012.
, Equation solving in robotics and mechanisms, Mathematics Mechanization and Applications, pp.433-460, 2000.
, Finite Fields, 1983.
DOI : 10.1017/CBO9780511525926
, A tutorial on Gröbner bases with applications in signals and systems, IEEE Transactions on Circuits and Systems I, vol.55, issue.1, pp.445-461, 2008.
, Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions, IEEE Transactions on Information Theory, vol.57, issue.7, pp.4817-4821, 2011.
DOI : 10.1109/TIT.2011.2145690
, On the decoding of cyclic codes using Gröbner bases Applicable Algebra in Engineering, Communication and Computing, vol.8, issue.6, pp.469-483, 1997.
, The Theory of Error-correcting Codes. North- Holland
, Computing the Radical of an Ideal in Positive Characteristic, Journal of Symbolic Computation, vol.32, issue.3, pp.263-271, 2001.
DOI : 10.1006/jsco.2001.0446
, Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, Advances in Cryptology ? EUROCRYPT 88, pp.419-453
DOI : 10.1007/3-540-45961-8_39
, The complexity of the word problems for commutative semigroups and polynomial ideals Advances in mathematics, pp.305-329, 1982.
, Algorithmic Algebra. Texts and Monographs in Computer Science, 1993.
DOI : 10.1007/978-1-4612-4344-1
, A public key system with signature and master key functions, Communications in Algebra, vol.168, issue.4, pp.2207-2222, 1999.
DOI : 10.1145/359340.359342
, Solving Polynomial Equation Systems II: Macaulay's Paradigm and Gröbner Technology, 2005.
DOI : 10.1017/CBO9781107340954
, On triangular decompositions of algebraic varieties, Presented at the MEGA-2000 Conference
, Polynomial GCD computations over towers of algebraic extensions, Applied Algebra, Algebraic Algorithms and Error- Correcting Codes, pp.365-382, 1995.
, Autour de la fonction de Hilbert-Samuel (escaliers d'idéaux polynomiaux), 1991.
, Degrevlex Gr??bner bases of generic complete intersections, Journal of Pure and Applied Algebra, vol.180, issue.3, pp.263-283, 2003.
DOI : 10.1016/S0022-4049(02)00297-9
, Solving Polynominal Systems Using Continuation for Engineering and Scientific Problems, 1987.
DOI : 10.1137/1.9780898719031
, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001.
DOI : 10.1145/378239.379017
, Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case, Theoretical Computer Science, vol.468, issue.468, pp.102-113, 2013.
DOI : 10.1016/j.tcs.2012.11.009
URL : https://hal.archives-ouvertes.fr/hal-00765840
, Decoding Reed-Solomon Codes Beyond Half the Minimum Distance, Coding Theory, Cryptography and Related Areas, pp.221-236, 2000.
DOI : 10.1007/978-3-642-57189-3_20
, Algebraic Approaches to Stability Analysis of Biological Systems, Mathematics in Computer Science, vol.1, issue.3, pp.507-539, 2008.
DOI : 10.1007/s11786-007-0039-x
URL : https://hal.archives-ouvertes.fr/hal-00588726
, Modular dynamic evaluation, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.262-268, 2006.
DOI : 10.1145/1145768.1145812
, Risa/Asir?a computer algebra system, Proceedings of ISSAC 1992, pp.387-396, 1992.
, Factoring polynomials over algebraic extension fields, Josai Information Science Researches, vol.9, pp.11-33, 1997.
, Implementation of prime decomposition of polynomial ideals over small finite fields, Journal of Symbolic Computation, vol.38, issue.4, pp.1227-1246, 2004.
DOI : 10.1016/j.jsc.2003.08.004
, Gröbner basis solutions of constrained interpolation problems. Linear Algebra and its Applications, pp.351-352, 2002.
, Algebraic Statistics for Computational Biology, 2005.
DOI : 10.1017/CBO9780511610684
, Solving a polynomial equation: Some history and recent progress. SIAM review, pp.187-220, 1997.
, Generic sequences of polynomials, Journal of Algebra, vol.324, issue.4, pp.579-590, 2010.
DOI : 10.1016/j.jalgebra.2010.04.018
, Gröbner bases in Control Theory and Signal Processing, of Radon Series on Computational and Applied Mathematics . De Gruyter, 2007.
, Change of order for bivariate triangular sets, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.277-284, 2006.
DOI : 10.1145/1145768.1145814
, Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt???88, Advances in Cryptology ? CRYPTO 95, pp.248-261, 1995.
DOI : 10.1007/3-540-44750-4_20
, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, Advances in Cryptology ? EUROCRYPT 96, pp.33-48
DOI : 10.1007/3-540-68339-9_4
, Counting solutions of polynomial systems via iterated fibrations, Archiv der Mathematik, vol.92, issue.1, pp.44-56, 2009.
DOI : 10.1007/s00013-008-2785-7
, Differential Algebra, 1950.
DOI : 10.1090/coll/033
, Solving zero-dimensional systems through the rational univariate representation Applicable Algebra in Engineering, Communication and Computing, vol.9, issue.5, pp.433-461, 1999.
, Efficient isolation of polynomial's real roots, Journal of Computational and Applied Mathematics, vol.162, issue.1, pp.33-50, 2004.
DOI : 10.1016/j.cam.2003.08.015
, Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases, IEEE Transactions on Information Theory, vol.41, issue.6, pp.411733-1751, 2002.
DOI : 10.1109/18.476246
, Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array, Journal of Symbolic Computation, vol.5, issue.3, pp.321-337, 1988.
DOI : 10.1016/S0747-7171(88)80033-6
, Extension of the Berlekamp-Massey algorithm to N dimensions, Information and Computation, vol.84, issue.2, pp.207-239, 1990.
DOI : 10.1016/0890-5401(90)90039-K
, Gröbner bases and coding theory, Gröbner Bases and Applications, pp.205-220, 1998.
, Constructions in algebra, Transactions of the American Mathematical Society, vol.197, pp.273-313, 1974.
DOI : 10.1090/S0002-9947-1974-0349648-2
, Extending SAT Solvers to Cryptographic Problems, Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing, pp.244-257, 2009.
DOI : 10.1007/s10817-007-9074-1
, Résolution de systèm multi-homogènes et déterminantiels: Algorithms, complexities and applications, 2012.
, Conquering inseparability: Primary decomposition and multivariate factorization over algebraic function fields of positive characteristic, Journal of Symbolic Computation, vol.40, issue.3, pp.1053-1075, 2005.
DOI : 10.1016/j.jsc.2005.03.002
, Network topology as a driver of bistability in the lac operon, 2008.
, An efficient algorithm for factoring polynomials over algebraic extension field, Science China Mathematics, vol.26, issue.6
DOI : 10.1007/s11425-013-4586-0
, A generalized criterion for signature related Gröbner basis algorithms, Proceedings of ISSAC 2011, pp.337-344, 2011.
, Algorithms for Singleton Attractor Detection in Planar and Nonplanar AND/OR Boolean Networks, Mathematics in Computer Science, vol.2, issue.3, pp.401-420, 2009.
DOI : 10.1007/s11786-008-0063-5
, Differential Systems, 1937.
DOI : 10.1090/coll/021
, A Geometric Buchberger Algorithm for Integer Programming, Mathematics of Operations Research, vol.20, issue.4, pp.864-884, 1995.
DOI : 10.1287/moor.20.4.864
, Efficient Interpolation in the Guruswami–Sudan Algorithm, IEEE Transactions on Information Theory, vol.56, issue.9, pp.4341-4349, 2010.
DOI : 10.1109/TIT.2010.2053901
, Homotopy Methods for Solving Polynomial Systems, 2005.
, Modern Computer Algebra, 2003.
, On Wu's method for proving constructive geometric theorems, Proceedings of the 11th International Joint Conference on Artificial Intelligence, pp.419-424, 1989.
, An Elimination Method for Polynomial Systems, Journal of Symbolic Computation, vol.16, issue.2, pp.83-114, 1993.
DOI : 10.1006/jsco.1993.1035
, An implementation of the characteristic set method in Maple Automated practical reasoning: algebraic approaches, pp.187-201, 1995.
, Decomposing Polynomial Systems into Simple Systems, Journal of Symbolic Computation, vol.25, issue.3, pp.295-314, 1998.
DOI : 10.1006/jsco.1997.0177
, Computing Triangular Systems and Regular Systems, Journal of Symbolic Computation, vol.30, issue.2, pp.221-236, 2000.
DOI : 10.1006/jsco.1999.0355
URL : https://hal.archives-ouvertes.fr/hal-01148782
, Elimination Methods, 2001.
DOI : 10.1007/978-3-7091-6202-6
URL : https://hal.archives-ouvertes.fr/inria-00100616
, A method for multivariate polynomial factorization over successive algebraic extension fields, Mathematics and Mathematics-Mechanization, pp.138-172, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100620
, Stability analysis of biological systems with real solution classification, Proceedings of the 2005 international symposium on Symbolic and algebraic computation , ISSAC '05, pp.354-361, 2005.
DOI : 10.1145/1073884.1073933
URL : https://hal.archives-ouvertes.fr/hal-01486880
, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986.
DOI : 10.1109/TIT.1986.1057137
, Polynomial Algorithms in Computer Algebra. Texts and Monographs in Symbolic Computation, 1996.
, BASIC PRINCIPLES OF MECHANICAL THEOREM PROVING IN ELEMENTARY GEOMETRIES, Journal of Automated Reasoning, vol.2, issue.3, pp.221-252, 1986.
DOI : 10.1142/9789812791085_0012
, ON ZEROS OF ALGEBRAIC EQUATIONS ??? AN APPLICATION OF RITT PRINCIPLE, Kexue Tongbao, vol.31, issue.1, pp.1-5, 1986.
DOI : 10.1142/9789812791085_0013
, Mathematics mechanization and applications after thirty years, Frontiers of Computer Science in China, vol.44, issue.6, pp.1-8, 2007.
DOI : 10.1007/s11704-007-0001-8
, Searching dependency between algebraic equations: An algorithm applied to automated reasoning, Artificial Intelligence in Mathematics, pp.147-156, 1994.
, Top 5 out of 120 PUBLICATIONS Book, Polynomial Algebra, issue.1, 2011.
, Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case, Theoretical Computer Science, vol.468, issue.2, pp.102-113, 2013.
DOI : 10.1016/j.tcs.2012.11.009
URL : https://hal.archives-ouvertes.fr/hal-00765840
, Design of termination criterion of BMS algorithm for lexicographical ordering (in Chinese), Journal of Computer Applications, vol.2012, issue.11, pp.32-2977
, Stability Analysis for Discrete Biological Models Using Algebraic Methods, Mathematics in Computer Science, vol.41, issue.3, pp.247-262, 2011.
DOI : 10.1007/s11786-011-0096-z
URL : https://hal.archives-ouvertes.fr/hal-01294709
, Decomposing polynomial sets into simple sets over finite fields: The zero-dimensional case, Computers & Mathematics with Applications, vol.60, issue.11, pp.2983-2997, 2010.
DOI : 10.1016/j.camwa.2010.09.059
URL : https://hal.archives-ouvertes.fr/hal-00706787
, Sparse FGLM algorithms, Journal of Symbolic Computation, vol.80, 2013.
DOI : 10.1016/j.jsc.2016.07.025
, Application of triangular set methods to detection of steady states and their numbers for finite biological models, Chinese). Computer Applications and Software, pp.ac- cpeted
, Squarefree decomposition and factorization over unmixed products of field extensions, preparation Conference Papers
, Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices Stability analysis for discrete biological models using algebraic methods, International Symposium on Symbolic and Algebraic Computation 2011 ACADEMIC ACTIVITIES Contributed talks: ? Simple Triangular Sets: from Q to F q Seminar on Symbolic Computations, pp.14-17, 2009.