Daniel Lazard

According to our database1, Daniel Lazard authored at least 36 papers between 1979 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Certified rational parametric approximation of real algebraic space curves with local generic position method.
J. Symb. Comput., 2013

2012
Certified Rational Parametric Approximation of Real Algebraic Space Curves with Local Generic Position Method
CoRR, 2012

2011
Sharper Complexity Bounds for Zero-Dimensional GRöBner Bases and Polynomial System Solving.
Int. J. Algebra Comput., 2011

2010
CAD and Topology of Semi-Algebraic Sets.
Math. Comput. Sci., 2010

2009
Iterated discriminants.
J. Symb. Comput., 2009

Thirty years of Polynomial System Solving, and now?
J. Symb. Comput., 2009

The Voronoi Diagram of Three Lines.
Discret. Comput. Geom., 2009

Computing representations for radicals of finitely generated differential ideals.
Appl. Algebra Eng. Commun. Comput., 2009

2008
Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections.
J. Symb. Comput., 2008

Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils.
J. Symb. Comput., 2008

Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm.
J. Symb. Comput., 2008

2007
Using Computer Algebra to Certify the Global Convergence of a Numerical Optimization Process.
Math. Comput. Sci., 2007

Solving parametric polynomial systems.
J. Symb. Comput., 2007

2006
Solving Kaltofen's challenge on Zolotarev's approximation problem.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Computing with parameterized varieties.
Proceedings of the Algebraic Geometry and Geometric Modeling, 2006

2004
Injectivity of real rational mappings: the case of a mixture of two Gaussian laws.
Math. Comput. Simul., 2004

2003
Near-optimal parameterization of the intersection of quadrics.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2001
Solving systems of algebraic equations.
SIGSAM Bull., 2001

1999
On the Theories of Triangular Sets.
J. Symb. Comput., 1999

1995
Representation for the Radical of a Finitely Generated Differential Ideal.
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

1994
The (True) Stewart Platform Has 12 Configurations.
Proceedings of the 1994 International Conference on Robotics and Automation, 1994

1993
Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering.
J. Symb. Comput., 1993

1992
A Note on Upper Bounds for Ideal-Theoretic Problems.
J. Symb. Comput., 1992

Solving Zero-Dimensional Algebraic Systems.
J. Symb. Comput., 1992

1991
A new method for solving algebraic systems of positive dimension.
Discret. Appl. Math., 1991

1990
Integration of Rational Functions: Rational Computation of the Logarithmic Part.
J. Symb. Comput., 1990

1988
Quantifier Elimination: Optimal Solution for Two Classical Examples.
J. Symb. Comput., 1988

Minimum Number of Fundamental Invariants for the Binary Form of Degree.
J. Symb. Comput., 1988

Algebraic Transformations of Polynomial Equations, Symmetric Polynomials and Elimination.
Proceedings of the Symbolic and Algebraic Computation, 1988

1985
Ideal Bases and Primary Decomposition: Case of Two Variables.
J. Symb. Comput., 1985

1983
Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations.
Proceedings of the Computer Algebra, 1983

1982
On Polynomial Factorization.
Proceedings of the Computer Algebra, 1982

Commutative Algebra and Computer Algebra.
Proceedings of the Computer Algebra, 1982

1981
Resolution des Systemes d'Equations Algebriques.
Theor. Comput. Sci., 1981

1980
Problem 7 and systems of algebraic equations.
SIGSAM Bull., 1980

1979
Systems of algebraic equations.
Proceedings of the Symbolic and Algebraic Computation, 1979


  Loading...