default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSylvain Lazard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j46]George Krait, Sylvain Lazard
, Guillaume Moroz, Marc Pouget:
Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves. J. Comput. Appl. Math. 394: 113553 (2021)- 2020
- [j45]Olivier Devillers, Sylvain Lazard, William J. Lenhart:
Rounding Meshes in 3D. Discret. Comput. Geom. 64(1): 37-62 (2020) - [j44]Sylvain Lazard, William J. Lenhart, Giuseppe Liotta:
Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94]. Theor. Comput. Sci. 806: 689 (2020) - [j43]Samuel Hornus, Tim Kuipers, Olivier Devillers, Monique Teillaud, Jonàs Martínez, Marc Glisse, Sylvain Lazard, Sylvain Lefebvre:
Variable-width contouring for additive manufacturing. ACM Trans. Graph. 39(4): 131 (2020)
2010 – 2019
- 2019
- [j42]Sylvain Lazard, William J. Lenhart, Giuseppe Liotta:
On the edge-length ratio of outerplanar graphs. Theor. Comput. Sci. 770: 88-94 (2019) - 2018
- [j41]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Paths Embeddings in ℝd. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [c39]Olivier Devillers, Sylvain Lazard, William J. Lenhart:
3D Snap Rounding. SoCG 2018: 30:1-30:14 - 2017
- [j40]Sylvain Lazard, Marc Pouget, Fabrice Rouillier:
Bivariate triangular decompositions in the presence of asymptotes. J. Symb. Comput. 82: 123-133 (2017) - [c38]Sylvain Lazard, William J. Lenhart, Giuseppe Liotta:
On the Edge-Length Ratio of Outerplanar Graphs. GD 2017: 17-23 - [i13]Sylvain Lazard, William J. Lenhart, Giuseppe Liotta:
On the Edge-length Ratio of Outerplanar Graphs. CoRR abs/1709.00043 (2017) - 2016
- [j39]Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer:
Analysis of farthest point sampling for approximating geodesics in a graph. Comput. Geom. 57: 1-7 (2016) - [j38]Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier, Michael Sagraloff:
Solving bivariate systems using Rational Univariate Representations. J. Complex. 37: 34-75 (2016) - [j37]Marc Glisse, Sylvain Lazard, Julien Michel, Marc Pouget:
Silhouette of a random polytope. J. Comput. Geom. 7(1): 86-99 (2016) - [j36]Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard:
Recognizing shrinkable complexes is NP-complete. J. Comput. Geom. 7(1): 430-443 (2016) - [c37]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Embeddings of Paths in d Dimensions. GD 2016: 546-553 - [i12]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Embeddings of Paths in R^d. CoRR abs/1608.08791 (2016) - 2015
- [j35]Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier:
Separating linear forms and Rational Univariate Representations of bivariate systems. J. Symb. Comput. 68: 84-119 (2015) - 2014
- [j34]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. J. Graph Algorithms Appl. 18(3): 313-324 (2014) - [c36]Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard:
Recognizing Shrinkable Complexes Is NP-Complete. ESA 2014: 74-86 - [c35]Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier:
Improved algorithm for computing separating linear forms for bivariate systems. ISSAC 2014: 75-82 - [i11]Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier:
Improved algorithm for computing separating linear forms for bivariate systems. CoRR abs/1405.4740 (2014) - 2013
- [j33]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On point-sets that support planar graphs. Comput. Geom. 46(1): 29-50 (2013) - [j32]Xavier Goaoc, Hyo-Sil Kim, Sylvain Lazard:
Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization. SIAM J. Comput. 42(2): 662-684 (2013) - [c34]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Planar Graph Drawings with Circular Arcs. CCCG 2013 - [c33]Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier:
Rational univariate representations of bivariate systems and applications. ISSAC 2013: 109-116 - [c32]Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier:
Separating linear forms for bivariate systems. ISSAC 2013: 117-124 - [i10]Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier:
Separating linear forms for bivariate systems. CoRR abs/1303.5041 (2013) - [i9]Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier:
Solving bivariate systems: Efficient worst-case algorithm for computing Rational Univariate Representations and applications. CoRR abs/1303.5042 (2013) - [i8]Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer:
Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph. CoRR abs/1311.4665 (2013) - 2012
- [j31]Marc Glisse, Sylvain Lazard:
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions. Discret. Comput. Geom. 47(4): 756-772 (2012) - 2011
- [j30]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4): 234-247 (2011) - [c31]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On Point-Sets That Support Planar Graphs. GD 2011: 64-74 - 2010
- [j29]Sylvain Lazard:
Editorial. Comput. Geom. 43(2): 67 (2010) - [j28]Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite:
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. 43(3): 295-311 (2010) - [j27]Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath:
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. Discret. Comput. Geom. 43(2): 272-288 (2010) - [j26]Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang:
A Succinct 3D Visibility Skeleton. Discret. Math. Algorithms Appl. 2(4): 567-590 (2010) - [j25]Laureano González-Vega, Sylvain Lazard:
Foreword. Math. Comput. Sci. 4(1): 1-2 (2010) - [j24]Jin-San Cheng, Sylvain Lazard, Luis Mariano Peñaranda, Marc Pouget, Fabrice Rouillier, Elias P. Tsigaridas:
On the Topology of Real Algebraic Plane Curves. Math. Comput. Sci. 4(1): 113-137 (2010) - [c30]Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang:
On the Computation of 3D Visibility Skeletons. COCOON 2010: 469-478 - [c29]Marc Glisse, Sylvain Lazard:
On the complexity of sets of free lines and line segments among balls in three dimensions. SCG 2010: 48-57 - [i7]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. CoRR abs/1001.3593 (2010)
2000 – 2009
- 2009
- [j23]Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang:
On the degree of standard geometric predicates for line transversals in 3D. Comput. Geom. 42(5): 484-494 (2009) - [j22]Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel:
On the complexity of umbra and penumbra. Comput. Geom. 42(8): 758-771 (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) - [c28]Jin-San Cheng, Sylvain Lazard, Luis Mariano Peñaranda, Marc Pouget, Fabrice Rouillier, Elias P. Tsigaridas:
On the topology of planar algebraic curves. SCG 2009: 361-370 - [c27]Sylvain Lazard, Luis Mariano Peñaranda, Elias P. Tsigaridas:
Univariate Algebraic Kernel and Application to Arrangements. SEA 2009: 209-220 - 2008
- [j20]Marc Glisse, Sylvain Lazard:
An Upper Bound on the Average Size of Silhouettes. Discret. Comput. Geom. 40(2): 241-257 (2008) - [j19]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) - [j18]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) - [j17]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) - [c26]Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite:
Walking your dog in the woods in polynomial time. SCG 2008: 101-109 - [c25]Olivier Devillers, Marc Glisse, Sylvain Lazard:
Predicates for line transversals to lines and line segments in three-dimensional space. SCG 2008: 174-181 - [c24]Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides:
On the Size of the 3D Visibility Skeleton: Experimental Results. ESA 2008: 805-816 - 2007
- [b2]Sylvain Lazard:
Problèmes de Géométrie Algorithmique sur les Droites et les Quadriques en Trois Dimensions. (Non-Linear Computational Geometry for Lines and Quadrics in Three Dimensions). Nancy 2 University, France, 2007 - [j16]Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile:
Lines Tangent to Four Triangles in Three-Dimensional Space. Discret. Comput. Geom. 37(3): 369-380 (2007) - [j15]Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott:
Parabola Separation Queries and their Application to Stone Throwing. Int. J. Comput. Geom. Appl. 17(4): 349-360 (2007) - [j14]Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang:
On the Expected Size of the 2D Visibility Complex. Int. J. Comput. Geom. Appl. 17(4): 361-381 (2007) - [j13]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. 37(2): 522-551 (2007) - [c23]Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides:
Towards an implementation of the 3D visibility skeleton. SCG 2007: 131-132 - [c22]Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din:
The voronoi diagram of three lines. SCG 2007: 255-264 - [c21]Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel:
Between umbra and penumbra. SCG 2007: 265-274 - [c20]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. ESA 2007: 407-418 - [c19]Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath:
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. GD 2007: 345-351 - [i6]Marc Glisse, Sylvain Lazard:
An Upper Bound on the Average Size of Silhouettes. CoRR abs/cs/0702087 (2007) - 2006
- [j12]Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean:
Intersecting quadrics: an efficient and exact implementation. Comput. Geom. 35(1-2): 74-99 (2006) - [j11]Ciprian Borcea, Xavier Goaoc, Sylvain Lazard, Sylvain Petitjean:
Common Tangents to Spheres in R3. Discret. Comput. Geom. 35(2): 287-300 (2006) - [j10]Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath:
Drawing Kn in Three Dimensions with One Bend per Edge. J. Graph Algorithms Appl. 10(2): 287-295 (2006) - [c18]Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott:
Throwing Stones Inside Simple Polygons . AAIM 2006: 185-193 - [c17]Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang:
Predicates for Line Transversals in 3D. CCCG 2006 - 2005
- [j9]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
Transversals to Line Segments in Three-Dimensional Space. Discret. Comput. Geom. 34(3): 381-390 (2005) - [c16]Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang:
An Experimental Assessment of the 2D Visibility Complex. CCCG 2005: 298-301 - [c15]Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath:
Drawing Kn in Three Dimensions with One Bend Per Edge. GD 2005: 83-88 - 2004
- [c14]Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile:
On the number of line tangents to four triangles in three-dimensional space. CCCG 2004: 184-187 - [c13]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
The number of lines tangent to arbitrary convex polyhedra in 3D. SCG 2004: 46-55 - [c12]Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean:
Intersecting quadrics: an efficient and exact implementation. SCG 2004: 419-428 - 2003
- [j8]Jean-Daniel Boissonnat, Sylvain Lazard:
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles. Int. J. Comput. Geom. Appl. 13(3): 189-229 (2003) - [j7]Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean:
The Expected Number of 3D Visibility Events Is Linear. SIAM J. Comput. 32(6): 1586-1620 (2003) - [c11]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
Transversals to line segments in R3. CCCG 2003: 174-177 - [c10]Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean:
Near-optimal parameterization of the intersection of quadrics. SCG 2003: 246-255 - [i5]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
The number of transversals to line segments in R^3. CoRR math.MG/0306401 (2003) - 2002
- [j6]Jean-Daniel Boissonnat, Subir Kumar Ghosh, Telikepalli Kavitha, Sylvain Lazard:
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon. Algorithmica 34(2): 109-156 (2002) - [j5]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
A note on reconfiguring tree linkages: trees can lock. Discret. Appl. Math. 117(1-3): 293-297 (2002) - [j4]Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides:
Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. 31(6): 1814-1851 (2002) - [c9]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
On the number of lines tangent to four convex polyhedra. CCCG 2002: 113-117 - 2001
- [j3]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. 26(3): 269-281 (2001) - [j2]Laurent Alonso, François Cuny, Sylvain Petitjean, Jean-Claude Paul, Sylvain Lazard, Eric Wies:
The virtual mesh: a geometric abstraction for efficiently computing radiosity. ACM Trans. Graph. 20(3): 169-201 (2001) - 2000
- [j1]Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard:
Motion Planning of Legged Robots. SIAM J. Comput. 30(1): 218-246 (2000)
1990 – 1999
- 1999
- [c8]Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss:
Convexifying Monotone Polygons. ISAAC 1999: 415-424 - [c7]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. SODA 1999: 866-867 - [i4]Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard:
Motion Planning of Legged Robots. CoRR cs.CG/9909006 (1999) - [i3]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9910009 (1999) - [i2]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
On Reconfiguring Tree Linkages: Trees can Lock. CoRR cs.CG/9910024 (1999) - 1998
- [c6]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
On reconfiguring tree linkages: Trees can lock. CCCG 1998 - [c5]Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides:
Convexifying star-shaped polygons. CCCG 1998 - [c4]Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides:
Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). SCG 1998: 392-401 - [i1]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9811019 (1998) - 1996
- [b1]Sylvain Lazard:
Planification de trajectoires de robots mobiles non-holonomes et de robots à pattes. (Motion planning of non-holonomic mobile robots and legged robots). Pierre and Marie Curie University, Paris, France, 1996 - [c3]Jean-Daniel Boissonnat, Sylvain Lazard:
Convex Hulls of Bounded Curvature. CCCG 1996: 14-19 - [c2]Jean-Daniel Boissonnat, Sylvain Lazard:
A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract). SCG 1996: 242-251 - 1994
- [c1]Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard:
From Spider Robots to Half Disk Robots. ICRA 1994: 953-958
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-07-03 21:35 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:
