Daniel Lazard

3.8k total citations
45 papers, 1.5k citations indexed

About

Daniel Lazard is a scholar working on Computational Theory and Mathematics, Computational Mechanics and Geometry and Topology. According to data from OpenAlex, Daniel Lazard has authored 45 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 21 papers in Computational Mechanics and 12 papers in Geometry and Topology. Recurrent topics in Daniel Lazard's work include Polynomial and algebraic computation (27 papers), Advanced Numerical Analysis Techniques (21 papers) and Commutative Algebra and Its Applications (10 papers). Daniel Lazard is often cited by papers focused on Polynomial and algebraic computation (27 papers), Advanced Numerical Analysis Techniques (21 papers) and Commutative Algebra and Its Applications (10 papers). Daniel Lazard collaborates with scholars based in France, Austria and Australia. Daniel Lazard's co-authors include Jean‐Charles Faugère, Teo Mora, P. Gianni, Fabrice Rouillier, Marc Moreno Maza, Philippe Aubry, Sylvain Lazard, Sylvain Petitjean, Laurent Dupont and François Boulier and has published in prestigious journals such as Theoretical Computer Science, Mechanism and Machine Theory and Journal of Algebra.

In The Last Decade

Daniel Lazard

42 papers receiving 1.3k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Daniel Lazard France 19 942 550 485 388 209 45 1.5k
Marie-Françoise Roy France 17 1.5k 1.6× 372 0.7× 481 1.0× 493 1.3× 388 1.9× 57 2.1k
Saugata Basu United States 15 1.3k 1.4× 313 0.6× 434 0.9× 387 1.0× 352 1.7× 76 1.9k
Jan Verschelde United States 17 1.0k 1.1× 268 0.5× 217 0.4× 632 1.6× 73 0.3× 59 1.3k
Teo Mora Italy 16 959 1.0× 543 1.0× 429 0.9× 271 0.7× 244 1.2× 53 1.2k
Volker Weispfenning Germany 20 1.0k 1.1× 355 0.6× 340 0.7× 219 0.6× 417 2.0× 52 1.4k
Rekha R. Thomas United States 17 573 0.6× 255 0.5× 279 0.6× 148 0.4× 79 0.4× 56 1.1k
Alexander Barvinok United States 20 632 0.7× 215 0.4× 278 0.6× 168 0.4× 289 1.4× 63 1.5k
Ioannis Z. Emiris Greece 23 935 1.0× 267 0.5× 170 0.4× 475 1.2× 144 0.7× 120 1.5k
Jean‐Charles Faugère France 19 954 1.0× 249 0.5× 226 0.5× 301 0.8× 661 3.2× 61 1.5k
Franz Winkler Austria 15 620 0.7× 162 0.3× 325 0.7× 383 1.0× 113 0.5× 54 853

Countries citing papers authored by Daniel Lazard

Since Specialization
Citations

This map shows the geographic impact of Daniel Lazard's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniel Lazard with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Lazard more than expected).

Fields of papers citing papers by Daniel Lazard

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Daniel Lazard. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniel Lazard. The network helps show where Daniel Lazard may publish in the future.

Co-authorship network of co-authors of Daniel Lazard

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Lazard. A scholar is included among the top collaborators of Daniel Lazard based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Daniel Lazard. Daniel Lazard is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lazard, Daniel. (2008). Thirty years of Polynomial System Solving, and now?. Journal of Symbolic Computation. 44(3). 222–231. 23 indexed citations
2.
Dupont, Laurent, Daniel Lazard, Sylvain Lazard, & Sylvain Petitjean. (2007). Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils. Journal of Symbolic Computation. 43(3). 192–215. 17 indexed citations
3.
Dupont, Laurent, Daniel Lazard, Sylvain Lazard, & Sylvain Petitjean. (2007). Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm. Journal of Symbolic Computation. 43(3). 168–191. 28 indexed citations
4.
Lazard, Daniel & Fabrice Rouillier. (2007). Solving parametric polynomial systems. Journal of Symbolic Computation. 42(6). 636–667. 91 indexed citations
5.
Dupont, Laurent, Daniel Lazard, Sylvain Lazard, & Sylvain Petitjean. (2007). Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections. Journal of Symbolic Computation. 43(3). 216–232. 15 indexed citations
6.
Lazard, Daniel & Jean‐Pierre Merlet. (2002). The (true) Stewart platform has 12 configurations. 2160–2165. 18 indexed citations
7.
Kotsireas, Ilias & Daniel Lazard. (2002). Central Configurations of the 5-Body Problem with Equal Masses in Three-Space. Journal of Mathematical Sciences. 108(6). 1119–1138. 4 indexed citations
8.
Lazard, Daniel. (2000). RESOLUTION OF POLYNOMIAL SYSTEMS. 1–8. 5 indexed citations
9.
Aubry, Philippe, Daniel Lazard, & Marc Moreno Maza. (1999). On the Theories of Triangular Sets. Journal of Symbolic Computation. 28(1-2). 105–124. 136 indexed citations
10.
Faugère, Jean‐Charles & Daniel Lazard. (1995). Combinatorial classes of parallel manipulators. Mechanism and Machine Theory. 30(6). 765–776. 66 indexed citations
11.
Faugère, Jean‐Charles, P. Gianni, Daniel Lazard, & Teo Mora. (1993). Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering. Journal of Symbolic Computation. 16(4). 329–344. 273 indexed citations
12.
Lazard, Daniel. (1992). Solving zero-dimensional algebraic systems. Journal of Symbolic Computation. 13(2). 117–131. 97 indexed citations
13.
Lazard, Daniel. (1991). A new method for solving algebraic systems of positive dimension. Discrete Applied Mathematics. 33(1-3). 147–160. 74 indexed citations
14.
Lazard, Daniel, et al.. (1990). Integration of rational functions: Rational computation of the logarithmic part. Journal of Symbolic Computation. 9(2). 113–115. 20 indexed citations
15.
Lazard, Daniel. (1988). Quantifier elimination: Optimal solution for two classical examples. Journal of Symbolic Computation. 5(1-2). 261–266. 46 indexed citations
16.
Dixmier, J. & Daniel Lazard. (1988). Minimum number of fundamental invariants for the binary form of degree 7. Journal of Symbolic Computation. 6(1). 113–115. 2 indexed citations
17.
Lazard, Daniel. (1985). Ideal Bases and Primary Decomposition: Case of Two Variables. Journal of Symbolic Computation. 1(3). 261–270. 44 indexed citations
18.
Lazard, Daniel. (1982). On the minimal algorithm in rings of imaginary quadratic integers. Journal of Number Theory. 15(2). 143–148. 1 indexed citations
19.
Lazard, Daniel. (1981). Resolution des systemes d'equations algebriques. Theoretical Computer Science. 15(1). 77–110. 120 indexed citations
20.
Lazard, Daniel. (1974). Liberté des gros modules projectifs. Journal of Algebra. 31(3). 437–451. 20 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026