default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicholas I. M. Gould
Nicholas Ian Mark Gould – Nick I. M. Gould
Person information
- affiliation: Scientific Computing Department, Rutherford Appleton Laboratory, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j87]Jaroslav M. Fowkes
, Nicholas I. M. Gould, Jennifer A. Scott:
Approximating sparse Hessian matrices using large-scale linear least squares. Numer. Algorithms 96(4): 1675-1698 (2024)- 2023
- [j86]Jaroslav M. Fowkes, Nicholas I. M. Gould:
GALAHAD 4.0: an open source library of Fortran packages with C and Matlab interfaces for continuous optimization. J. Open Source Softw. 8(87): 4882 (2023) - 2020
- [j85]Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. Optim. Methods Softw. 35(2): 243-256 (2020) - [j84]Nicholas I. M. Gould, Valeria Simoncini:
Error estimates for iterative algorithms for minimizing regularized quadratic subproblems. Optim. Methods Softw. 35(2): 304-328 (2020) - [j83]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints. SIAM J. Optim. 30(1): 513-541 (2020)
2010 – 2019
- 2019
- [j82]Nicholas I. M. Gould, Tyrone Rees, Jennifer A. Scott:
Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems. Comput. Optim. Appl. 73(1): 1-35 (2019) - [j81]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization. J. Complex. 53: 68-94 (2019) - [j80]Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy. SIAM J. Optim. 29(1): 595-615 (2019) - 2018
- [j79]Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization. Found. Comput. Math. 18(5): 1073-1107 (2018) - [i4]Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. CoRR abs/1811.01220 (2018) - 2017
- [j78]Nicholas I. M. Gould, Daniel P. Robinson:
A dual gradient-projection method for large-scale strictly convex quadratic problems. Comput. Optim. Appl. 67(1): 1-38 (2017) - [j77]Frank E. Curtis, Nicholas I. M. Gould, Daniel P. Robinson, Philippe L. Toint:
An interior-point trust-funnel algorithm for nonlinear optimization. Math. Program. 161(1-2): 73-134 (2017) - [j76]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 161(1-2): 611-626 (2017) - [j75]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients. Optim. Methods Softw. 32(6): 1273-1298 (2017) - [j74]Nicholas I. M. Gould, Jennifer A. Scott:
The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems. ACM Trans. Math. Softw. 43(4): 36:1-36:35 (2017) - [i3]Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$. CoRR abs/1705.04895 (2017) - [i2]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization. CoRR abs/1705.07285 (2017) - [i1]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. CoRR abs/1708.04044 (2017) - 2016
- [j73]Nicholas I. M. Gould, Christoph Ortner, D. Packwood:
A dimer-type saddle search algorithm with preconditioning and linesearch. Math. Comput. 85(302): 2939-2966 (2016) - [j72]Frank E. Curtis, Nicholas I. M. Gould, Hao Jiang, Daniel P. Robinson:
Adaptive augmented Lagrangian methods: algorithms and practical numerical experience. Optim. Methods Softw. 31(1): 157-186 (2016) - [j71]Nicholas I. M. Gould, Jennifer A. Scott:
A Note on Performance Profiles for Benchmarking Software. ACM Trans. Math. Softw. 43(2): 15:1-15:5 (2016) - 2015
- [j70]Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60(3): 545-557 (2015) - [j69]Coralia Cartis, Jaroslav M. Fowkes, Nicholas I. M. Gould:
Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties. J. Glob. Optim. 61(3): 429-457 (2015) - [j68]Daniel Bienstock, Philip E. Gill, Nicholas I. M. Gould:
A note on "On fast trust region methods for quadratic models with linear constraints", by Michael J.D. Powell. Math. Program. Comput. 7(3): 235 (2015) - [j67]Nicholas I. M. Gould, Yueling Loh, Daniel P. Robinson:
A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results. SIAM J. Optim. 25(3): 1885-1911 (2015) - [j66]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods. SIAM J. Numer. Anal. 53(2): 836-851 (2015) - 2014
- [j65]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 144(1-2): 93-106 (2014) - [j64]Nicholas I. M. Gould, Yueling Loh, Daniel P. Robinson:
A Filter Method with Unified Step Computation for Nonlinear Optimization. SIAM J. Optim. 24(1): 175-209 (2014) - [j63]Nicholas I. M. Gould, Dominique Orban, Tyrone Rees:
Projected Krylov Methods for Saddle-Point Systems. SIAM J. Matrix Anal. Appl. 35(4): 1329-1343 (2014) - 2013
- [j62]Jaroslav M. Fowkes, Nicholas I. M. Gould, Chris L. Farmer:
A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions. J. Glob. Optim. 56(4): 1791-1815 (2013) - [j61]Nicholas I. M. Gould, Dominique Orban, Daniel P. Robinson:
Trajectory-following methods for large-scale degenerate convex quadratic programming. Math. Program. Comput. 5(2): 113-142 (2013) - [j60]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. Optim. Methods Softw. 28(3): 451-457 (2013) - [j59]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization. SIAM J. Optim. 23(3): 1553-1574 (2013) - 2012
- [j58]Nicholas I. M. Gould:
How good are extrapolated bi-projection methods for linear feasibility problems? Comput. Optim. Appl. 51(3): 1089-1095 (2012) - [j57]Nicholas I. M. Gould, Margherita Porcelli, Philippe L. Toint:
Updating the regularization parameter in the adaptive cubic regularization algorithm. Comput. Optim. Appl. 53(1): 1-22 (2012) - [j56]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. 28(1): 93-108 (2012) - [j55]Nick I. M. Gould, Philippe L. Toint:
Erratum to: Nonlinear programming without a penalty function or a filter. Math. Program. 131(1-2): 403-404 (2012) - [j54]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. Optim. Methods Softw. 27(2): 197-219 (2012) - [j53]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization. SIAM J. Optim. 22(1): 66-86 (2012) - 2011
- [j52]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127(2): 245-295 (2011) - [j51]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. 130(2): 295-319 (2011) - [j50]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. SIAM J. Optim. 21(4): 1721-1739 (2011) - 2010
- [j49]Nicholas I. M. Gould, Philippe L. Toint:
Nonlinear programming without a penalty function or a filter. Math. Program. 122(1): 155-196 (2010) - [j48]Nicholas I. M. Gould, Daniel P. Robinson, H. Sue Thorne:
On solving trust-region and other regularised subproblems in optimization. Math. Program. Comput. 2(1): 21-57 (2010) - [j47]Nicholas I. M. Gould, Daniel P. Robinson:
A Second Derivative SQP Method: Global Convergence. SIAM J. Optim. 20(4): 2023-2048 (2010) - [j46]Nicholas I. M. Gould, Daniel P. Robinson:
A Second Derivative SQP Method: Local Convergence and Practical Issues. SIAM J. Optim. 20(4): 2049-2079 (2010) - [j45]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems. SIAM J. Optim. 20(6): 2833-2852 (2010) - [j44]Stefania Bellavia, Coralia Cartis, Nicholas I. M. Gould, Benedetta Morini, Philippe L. Toint:
Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares. SIAM J. Numer. Anal. 48(1): 1-29 (2010) - [j43]H. Sue Dollar, Nicholas I. M. Gould, Martin Stoll, Andrew J. Wathen:
Preconditioning Saddle-Point Systems with Applications in Optimization. SIAM J. Sci. Comput. 32(1): 249-270 (2010)
2000 – 2009
- 2009
- [j42]Nicholas I. M. Gould, Valeria Simoncini:
Spectral Analysis of Saddle Point Matrices with Indefinite Leading Blocks. SIAM J. Matrix Anal. Appl. 31(3): 1152-1171 (2009) - 2008
- [j41]Nicholas I. M. Gould:
How good are projection methods for convex feasibility problems? Comput. Optim. Appl. 40(1): 1-12 (2008) - 2007
- [j40]H. Sue Dollar, Nicholas I. M. Gould, Wil H. A. Schilders, Andy J. Wathen:
Using constraint preconditioners with regularized saddle-point problems. Comput. Optim. Appl. 36(2-3): 249-270 (2007) - [j39]Nicholas I. M. Gould, Philippe L. Toint:
FILTRANE, a Fortran 95 filter-trust-region package for solving nonlinear least-squares and nonlinear feasibility problems. ACM Trans. Math. Softw. 33(1): 3 (2007) - [j38]Nicholas I. M. Gould, Jennifer A. Scott, Yifan Hu:
A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations. ACM Trans. Math. Softw. 33(2): 10 (2007) - 2006
- [j37]H. Sue Dollar, Nicholas I. M. Gould, Wil H. A. Schilders, Andrew J. Wathen:
Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems. SIAM J. Matrix Anal. Appl. 28(1): 170-189 (2006) - 2005
- [j36]Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
Sensitivity of trust-region algorithms to their parameters. 4OR 3(3): 227-241 (2005) - [j35]Nick I. M. Gould, Caroline Sainvitu, Philippe L. Toint:
A Filter-Trust-Region Method for Unconstrained Optimization. SIAM J. Optim. 16(2): 341-357 (2005) - [j34]Richard H. Byrd, Nicholas I. M. Gould, Jorge Nocedal, Richard A. Waltz:
On the Convergence of Successive Linear-Quadratic Programming Algorithms. SIAM J. Optim. 16(2): 471-489 (2005) - 2004
- [j33]Nick I. M. Gould, Sven Leyffer, Philippe L. Toint:
Nonlinear programming: theory and practice. Math. Program. 100(1): 1-2 (2004) - [j32]Richard H. Byrd, Nicholas I. M. Gould, Jorge Nocedal, Richard A. Waltz:
An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Math. Program. 100(1): 27-48 (2004) - [j31]Nick I. M. Gould, Philippe L. Toint:
Preprocessing for quadratic programming. Math. Program. 100(1): 95-132 (2004) - [j30]Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint:
A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares. SIAM J. Optim. 15(1): 17-38 (2004) - [j29]Nicholas I. M. Gould, Jennifer A. Scott:
A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations. ACM Trans. Math. Softw. 30(3): 300-325 (2004) - [c4]Jennifer A. Scott, Yifan Hu, Nicholas I. M. Gould:
An Evaluation of Sparse Direct Symmetric Solvers: An Introduction and Preliminary Findings. PARA 2004: 818-827 - 2003
- [j28]Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29(4): 353-372 (2003) - [j27]Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4): 373-394 (2003) - 2002
- [j26]Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations. Math. Program. 92(3): 481-508 (2002) - [j25]Roger Fletcher, Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint, Andreas Wächter:
Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming. SIAM J. Optim. 13(3): 635-659 (2002) - 2001
- [j24]Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming. SIAM J. Optim. 11(4): 974-1002 (2001) - [j23]Nicholas I. M. Gould, Mary E. Hribar, Jorge Nocedal:
On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization. SIAM J. Sci. Comput. 23(4): 1376-1395 (2001) - [c3]Nicholas I. M. Gould, Philippe L. Toint:
Global Convergence of a Hybrid Trust-Region SQP-Filter Algorithm for General Nonlinear Programming. System Modelling and Optimization 2001: 23-54 - 2000
- [b1]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
Trust Region Methods. MOS-SIAM Series on Optimization, SIAM 2000, ISBN 978-0-89871-460-9, pp. 1-942 - [j22]Andrew R. Conn, Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
A primal-dual trust-region algorithm for non-convex nonlinear programming. Math. Program. 87(2): 215-249 (2000) - [j21]Carsten Keller, Nicholas I. M. Gould, Andrew J. Wathen:
Constraint Preconditioning for Indefinite Linear Systems. SIAM J. Matrix Anal. Appl. 21(4): 1300-1317 (2000)
1990 – 1999
- 1999
- [j20]Nicholas I. M. Gould, Philippe L. Toint:
A note on the convergence of barrier algorithms to second-order necessary points. Math. Program. 85(2): 433-438 (1999) - [j19]Michel J. Daydé, Jérôme P. Décamps, Nicholas I. M. Gould:
Subspace-by-subspace preconditioners for structured linear systems. Numer. Linear Algebra Appl. 6(3): 213-234 (1999) - [j18]Nicholas I. M. Gould, Stefano Lucidi, Massimo Roma, Philippe L. Toint:
Solving the Trust-Region Subproblem using the Lanczos Method. SIAM J. Optim. 9(2): 504-525 (1999) - [j17]Nicholas Ian Mark Gould:
On Modified Factorizations for Large-Scale Linearly Constrained Optimization. SIAM J. Optim. 9(4): 1041-1063 (1999) - [c2]Nicholas I. M. Gould, Philippe L. Toint:
SQP Methods for Large-Scale Nonlinear Programming. System Modelling and Optimization 1999: 149-178 - 1998
- [j16]Nicholas I. M. Gould, Jennifer A. Scott:
Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques. SIAM J. Sci. Comput. 19(2): 605-625 (1998) - 1997
- [j15]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds. Comput. Optim. Appl. 7(1): 41-69 (1997) - [j14]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds. Math. Comput. 66(217): 261-288 (1997) - [j13]Michel J. Daydé, Jean-Yves L'Excellent, Nicholas I. M. Gould:
Element-by-Element Preconditioners for Large Partially Separable Optimization Problems. SIAM J. Sci. Comput. 18(6): 1767-1787 (1997) - 1996
- [j12]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization. Math. Program. 73: 73-110 (1996) - [j11]Andrew R. Conn, Nicholas I. M. Gould, Annick Sartenaer, Philippe L. Toint:
Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints. SIAM J. Optim. 6(3): 674-703 (1996) - [j10]Andrew R. Conn, Nick I. M. Gould, Annick Sartenaer, Philippe L. Toint:
Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region. SIAM J. Optim. 6(4): 1059-1086 (1996) - [c1]Michel J. Daydé, Jean-Yves L'Excellent, Nicholas I. M. Gould:
Preprocessing of Sparse Unassembled Linear Systems for Efficient Solution Using Element-by-Element Preconditioners. Euro-Par, Vol. II 1996: 34-43 - 1995
- [j9]Ingrid Bongartz, Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
CUTE: Constrained and Unconstrained Testing Environment. ACM Trans. Math. Softw. 21(1): 123-160 (1995) - 1994
- [j8]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
A note on exploiting structure when using slack variables. Math. Program. 67: 89-97 (1994) - 1993
- [j7]Andrew R. Conn, Nick I. M. Gould, Annick Sartenaer, Philippe L. Toint:
Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints. SIAM J. Optim. 3(1): 164-221 (1993) - 1991
- [j6]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
Convergence of quasi-Newton matrices generated by the symmetric rank one update. Math. Program. 50: 177-195 (1991) - 1990
- [j5]Mario Arioli, Iain S. Duff, Nick I. M. Gould, John K. Reid:
Use of the P4 and P5 Algorithms for In-Core Factorization of Sparse Matrices. SIAM J. Sci. Comput. 11(5): 913-927 (1990)
1980 – 1989
- 1989
- [j4]Nicholas I. M. Gould, John K. Reid:
New crash procedures for large systems of linear constraints. Math. Program. 45(1-3): 475-501 (1989) - 1987
- [j3]Andrew R. Conn, Nicholas I. M. Gould:
An exact penalty function for semi-infinite programming. Math. Program. 37(1): 19-40 (1987) - 1985
- [j2]Nicholas I. M. Gould:
On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem. Math. Program. 32(1): 90-99 (1985) - 1984
- [j1]Philip E. Gill, Nicholas I. M. Gould, Walter Murray, Michael A. Saunders, Margaret H. Wright:
A weighted gram-schmidt method for convex quadratic programming. Math. Program. 30(2): 176-195 (1984)
Coauthor Index
Andrew Conn 0001
aka: Andrew R. Conn
aka: Andrew R. Conn
[j85] [j83] [j81] [j80] [j79] [i4] [j77] [j76] [j75] [i3] [i2] [i1] [j70] [j66] [j65] [j60] [j59] [j57] [j56] [j55] [j54] [j53] [j52] [j51] [j50] [j49] [j45] [j44] [j39] [j36] [j35] [j33] [j31] [j30] [j28] [j27] [j26] [j25] [j24] [c3] [b1] [j22] [j20] [j18] [c2] [j15] [j14] [j12] [j11] [j10] [j9] [j8] [j7] [j6]
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-08-05 20:23 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:
