default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Lazard
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j25]Jin-San Cheng, Kai Jin, Daniel Lazard:
Certified rational parametric approximation of real algebraic space curves with local generic position method. J. Symb. Comput. 58: 18-40 (2013)- 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
- [j24]Amir Hashemi, Daniel Lazard:
Sharper Complexity Bounds for Zero-Dimensional GRöBner Bases and Polynomial System Solving. Int. J. Algebra Comput. 21(5): 703-713 (2011) - 2010
- [j23]Daniel Lazard:
CAD and Topology of Semi-Algebraic Sets. Math. Comput. Sci. 4(1): 93-112 (2010)
2000 – 2009
- 2009
- [j22]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) - [j21]Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din:
The Voronoi Diagram of Three Lines. Discret. Comput. Geom. 42(1): 94-130 (2009) - [j20]Daniel Lazard:
Thirty years of Polynomial System Solving, and now? J. Symb. Comput. 44(3): 222-231 (2009) - [j19]Daniel Lazard, Scott McCallum
:
Iterated discriminants. J. Symb. Comput. 44(9): 1176-1193 (2009) - 2008
- [j18]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) - [j17]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) - [j16]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
- [j15]Daniel Lazard, Fabrice Rouillier:
Solving parametric polynomial systems. J. Symb. Comput. 42(6): 636-667 (2007) - [j14]Nong Gu, Daniel Lazard, Fabrice Rouillier, Yong Xiang:
Using Computer Algebra to Certify the Global Convergence of a Numerical Optimization Process. Math. Comput. Sci. 1(2): 291-304 (2007) - [c10]Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din:
The voronoi diagram of three lines. SCG 2007: 255-264 - 2006
- [c9]Daniel Lazard:
Solving Kaltofen's challenge on Zolotarev's approximation problem. ISSAC 2006: 196-203 - [p1]Daniel Lazard:
Computing with parameterized varieties. Algebraic Geometry and Geometric Modeling 2006: 53-69 - 2004
- [j13]Daniel Lazard:
Injectivity of real rational mappings: the case of a mixture of two Gaussian laws. Math. Comput. Simul. 67(1-2): 67-84 (2004) - 2003
- [c8]Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean:
Near-optimal parameterization of the intersection of quadrics. SCG 2003: 246-255 - 2001
- [j12]Daniel Lazard:
Solving systems of algebraic equations. SIGSAM Bull. 35(3): 11-37 (2001)
1990 – 1999
- 1999
- [j11]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
- [j10]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
- [j9]Daniel Lazard:
Solving Zero-Dimensional Algebraic Systems. J. Symb. Comput. 13(2): 117-132 (1992) - [j8]Daniel Lazard:
A Note on Upper Bounds for Ideal-Theoretic Problems. J. Symb. Comput. 13(3): 231-234 (1992) - 1991
- [j7]Daniel Lazard:
A new method for solving algebraic systems of positive dimension. Discret. Appl. Math. 33(1-3): 147-160 (1991) - 1990
- [j6]Daniel Lazard, Renaud Rioboo:
Integration of Rational Functions: Rational Computation of the Logarithmic Part. J. Symb. Comput. 9(2): 113-115 (1990)
1980 – 1989
- 1988
- [j5]Daniel Lazard:
Quantifier Elimination: Optimal Solution for Two Classical Examples. J. Symb. Comput. 5(1/2): 261-266 (1988) - [j4]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
- [j3]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]Daniel Lazard:
Commutative Algebra and Computer Algebra. EUROCAM 1982: 40-48 - [c2]Daniel Lazard:
On Polynomial Factorization. EUROCAM 1982: 126-134 - 1981
- [j2]Daniel Lazard:
Resolution des Systemes d'Equations Algebriques. Theor. Comput. Sci. 15: 77-110 (1981) - 1980
- [j1]Daniel Lazard:
Problem 7 and systems of algebraic equations. SIGSAM Bull. 14(2): 26-29 (1980)
1970 – 1979
- 1979
- [c1]Daniel Lazard:
Systems of algebraic equations. EUROSAM 1979: 88-94
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-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
