- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| i1 |      | Jin-San Cheng, Kai Jin, Xiao-Shan Gao, Daniel Lazard: Certified Rational Parametric Approximation of Real Algebraic Space Curves with Local Generic Position Method. CoRR abs/1204.0905 (2012) |
| 2011 | ||
| j22 | | Amir Hashemi, Daniel Lazard: Sharper Complexity Bounds for Zero-Dimensional GRöBner Bases and Polynomial System Solving. IJAC 21(5): 703-713 (2011) |
| 2010 | ||
| j21 | | Daniel Lazard: CAD and Topology of Semi-Algebraic Sets. Mathematics in Computer Science 4(1): 93-112 (2010) |
| 2009 | ||
| j20 | | François Boulier, Daniel Lazard, François Ollivier, Michel Petitot: Computing representations for radicals of finitely generated differential ideals. Appl. Algebra Eng. Commun. Comput. 20(1): 73-121 (2009) |
| j19 | | Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din: The Voronoi Diagram of Three Lines. Discrete & Computational Geometry 42(1): 94-130 (2009) |
| j18 | | Daniel Lazard: Thirty years of Polynomial System Solving, and now? J. Symb. Comput. 44(3): 222-231 (2009) |
| j17 | | |
| 2008 | ||
| j16 | | Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean: Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm. J. Symb. Comput. 43(3): 168-191 (2008) |
| j15 | | Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean: Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils. J. Symb. Comput. 43(3): 192-215 (2008) |
| j14 | | Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean: Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections. J. Symb. Comput. 43(3): 216-232 (2008) |
| 2007 | ||
| j13 | | Daniel Lazard, Fabrice Rouillier: Solving parametric polynomial systems. J. Symb. Comput. 42(6): 636-667 (2007) |
| j12 | | Nong Gu, Daniel Lazard, Fabrice Rouillier, Yong Xiang: Using Computer Algebra to Certify the Global Convergence of a Numerical Optimization Process. Mathematics in Computer Science 1(2): 291-304 (2007) |
| c10 | | Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din: The voronoi diagram of three lines. Symposium on Computational Geometry 2007: 255-264 |
| 2006 | ||
| c9 | | Daniel Lazard: Solving Kaltofen's challenge on Zolotarev's approximation problem. ISSAC 2006: 196-203 |
| 2004 | ||
| j11 | | Daniel Lazard: Injectivity of real rational mappings: the case of a mixture of two Gaussian laws. Mathematics and Computers in Simulation 67(1-2): 67-84 (2004) |
| 2003 | ||
| c8 | | Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean: Near-optimal parameterization of the intersection of quadrics. Symposium on Computational Geometry 2003: 246-255 |
| 1999 | ||
| j10 | | Philippe Aubry, Daniel Lazard, Marc Moreno Maza: On the Theories of Triangular Sets. J. Symb. Comput. 28(1-2): 105-124 (1999) |
| 1995 | ||
| c7 | | François Boulier, Daniel Lazard, François Ollivier, Michel Petitot: Representation for the Radical of a Finitely Generated Differential Ideal. ISSAC 1995: 158-166 |
| 1994 | ||
| c6 | | Daniel Lazard, Jean-Pierre Merlet: The (True) Stewart Platform Has 12 Configurations. ICRA 1994: 2160-2165 |
| 1993 | ||
| j9 | | Jean-Charles Faugère, Patrizia M. Gianni, Daniel Lazard, Teo Mora: Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering. J. Symb. Comput. 16(4): 329-344 (1993) |
| 1992 | ||
| j8 | | |
| j7 | | Daniel Lazard: A Note on Upper Bounds for Ideal-Theoretic Problems. J. Symb. Comput. 13(3): 231-234 (1992) |
| 1991 | ||
| j6 | | Daniel Lazard: A new method for solving algebraic systems of positive dimension. Discrete Applied Mathematics 33(1-3): 147-160 (1991) |
| 1990 | ||
| j5 | | Daniel Lazard, Renaud Rioboo: Integration of Rational Functions: Rational Computation of the Logarithmic Part. J. Symb. Comput. 9(2): 113-115 (1990) |
| 1988 | ||
| j4 | | Daniel Lazard: Quantifier Elimination: Optimal Solution for Two Classical Examples. J. Symb. Comput. 5(1/2): 261-266 (1988) |
| j3 | | J. Dixmier, Daniel Lazard: Minimum Number of Fundamental Invariants for the Binary Form of Degree. J. Symb. Comput. 6(1): 113-115 (1988) |
| c5 | | Marc Giusti, Daniel Lazard, Annick Valibouze: Algebraic Transformations of Polynomial Equations, Symmetric Polynomials and Elimination. ISSAC 1988: 309-314 |
| 1985 | ||
| j2 | | Daniel Lazard: Ideal Bases and Primary Decomposition: Case of Two Variables. J. Symb. Comput. 1(3): 261-270 (1985) |
| 1983 | ||
| c4 | | Daniel Lazard: Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations. EUROCAL 1983: 146-156 |
| 1982 | ||
| c3 | | |
| c2 | | |
| 1981 | ||
| j1 | | Daniel Lazard: Resolution des Systemes d'Equations Algebriques. Theor. Comput. Sci. 15: 77-110 (1981) |
| 1979 | ||
| c1 | | |
Data released under the ODC-BY 1.0 license — See also our legal information page