default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMihai Anitescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j62]Mohammad S. Ramadan
, Mihai Anitescu:
Extended Kalman Filter-Koopman Operator for Tractable Stochastic Optimal Control. IEEE Control. Syst. Lett. 8: 1643-1648 (2024)- [j61]Anindya Bhaduri, Nesar Ramachandra, Sandipp Krishnan Ravi, Lele Luan, Piyush Pandita, Prasanna Balaprakash, Mihai Anitescu, Changjie Sun, Liping Wang:
Efficient Mapping Between Void Shapes and Stress Fields Using Deep Convolutional Neural Networks With Sparse Data. J. Comput. Inf. Sci. Eng. 24(4) (2024) - [j60]François Pacaud, Sungho Shin, Michel Schanen, Daniel Adrian Maldonado, Mihai Anitescu:
Accelerating Condensed Interior-Point Methods on SIMD/GPU Architectures. J. Optim. Theory Appl. 202(1): 184-203 (2024) - [j59]Sen Na, Mihai Anitescu, Mladen Kolar:
A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming. Math. Oper. Res. 49(2): 1012-1044 (2024) - [c20]Sungho Shin, Vishwas Rao, Michel Schanen, Daniel Adrian Maldonado, Mihai Anitescu:
Scalable Multi-Period AC Optimal Power Flow Utilizing GPUs with High Memory Capacities. OSMSES 2024: 1-6 - [i25]Hongli Zhao, Tyler E. Maltba, Daniel Adrian Maldonado, Emil M. Constantinescu, Mihai Anitescu:
Data-Driven Estimation of Failure Probabilities in Correlated Structure-Preserving Stochastic Power System Models. CoRR abs/2401.02555 (2024) - [i24]Mohammad S. Ramadan, Mihai Anitescu:
Extended Kalman filter - Koopman operator for tractable stochastic optimal control. CoRR abs/2402.18554 (2024) - [i23]Ian Dobson, Daniel Adrian Maldonado, Mihai Anitescu:
The statistical spread of transmission outages on a fast protection time scale based on utility data. CoRR abs/2407.15059 (2024) - [i22]Mohammad S. Ramadan, Evan Toler, Mihai Anitescu:
Data-conforming data-driven control: avoiding premature generalizations beyond data. CoRR abs/2409.11549 (2024) - 2023
- [j58]Yian Chen, Mihai Anitescu:
Scalable Physics-Based Maximum Likelihood Estimation Using Hierarchical Matrices. SIAM/ASA J. Uncertain. Quantification 11(2): 682-725 (2023) - [j57]Sen Na, Mihai Anitescu, Mladen Kolar:
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians. Math. Program. 199(1): 721-791 (2023) - [j56]Sen Na, Mihai Anitescu, Mladen Kolar:
Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming. Math. Program. 202(1): 279-353 (2023) - [j55]Paul G. Beckman, Christopher Geoga, Michael L. Stein, Mihai Anitescu:
Scalable computations for nonstationary Gaussian processes. Stat. Comput. 33(4): 84 (2023) - [j54]Sungho Shin, Yiheng Lin, Guannan Qu, Adam Wierman, Mihai Anitescu:
Near-Optimal Distributed Linear-Quadratic Regulator for Networked Systems. SIAM J. Control. Optim. 61(3): 1113-1135 (2023) - [j53]Sen Na, Mihai Anitescu:
Superconvergence of Online Optimization for Model Predictive Control. IEEE Trans. Autom. Control. 68(3): 1383-1398 (2023) - [c19]Sungho Shin, François Pacaud, Emil Contantinescu, Mihai Anitescu:
Constrained Policy Optimization for Stochastic Optimal Control under Nonstationary Uncertainties*. ACC 2023: 634-639 - [c18]David L. Cole, Sungho Shin, François Pacaud, Victor M. Zavala, Mihai Anitescu:
Exploiting GPU/SIMD Architectures for Solving Linear-Quadratic MPC Problems*. ACC 2023: 3995-4000 - [c17]Zehao Niu, Mihai Anitescu, Jie Chen:
Graph Neural Network-Inspired Kernels for Gaussian Processes in Semi-Supervised Learning. ICLR 2023 - [i21]Zehao Niu, Mihai Anitescu, Jie Chen:
Graph Neural Network-Inspired Kernels for Gaussian Processes in Semi-Supervised Learning. CoRR abs/2302.05828 (2023) - [i20]Yian Chen, Mihai Anitescu:
Scalable Physics-based Maximum Likelihood Estimation using Hierarchical Matrices. CoRR abs/2303.10102 (2023) - [i19]Lele Luan, Nesar Ramachandra, Sandipp Krishnan Ravi, Anindya Bhaduri, Piyush Pandita, Prasanna Balaprakash, Mihai Anitescu, Changjie Sun, Liping Wang:
Application of probabilistic modeling and automated machine learning framework for high-dimensional stress field. CoRR abs/2303.16869 (2023) - [i18]Albert Lam, Mihai Anitescu, Anirudh Subramanyam:
Network Cascade Vulnerability using Constrained Bayesian Optimization. CoRR abs/2304.14420 (2023) - [i17]Sungho Shin, François Pacaud, Mihai Anitescu:
Accelerating Optimal Power Flow with GPUs: SIMD Abstraction of Nonlinear Programs and Condensed-Space Interior-Point Methods. CoRR abs/2307.16830 (2023) - [i16]Ahmed Attia, Daniel Adrian Maldonado, Emil M. Constantinescu, Mihai Anitescu:
Centralized calibration of power system dynamic models using variational data assimilation. CoRR abs/2311.07676 (2023) - [i15]Somayeh Yarahmadi, Daniel Adrian Maldonado, Lamine Mili, Junbo Zhao, Mihai Anitescu:
Voltage-Dependent Electromechanical Wave Propagation Modeling for Dynamic Stability Analysis in Power Systems. CoRR abs/2311.12326 (2023) - 2022
- [j52]Bendong Tan, Junbo Zhao, Nan Duan, Daniel Adrian Maldonado, Yingchen Zhang, Hongming Zhang, Mihai Anitescu:
Distributed Frequency Divider for Power System Bus Frequency Online Estimation Considering Virtual Inertia From DFIGs. IEEE J. Emerg. Sel. Topics Circuits Syst. 12(1): 161-171 (2022) - [j51]Vishwas Rao, Charlotte A. L. Haley, Mihai Anitescu:
LaplaceInterpolation.jl: A Julia package for fast interpolation on a grid. J. Open Source Softw. 7(69): 3766 (2022) - [j50]Sungho Shin, Mihai Anitescu, Victor M. Zavala:
Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs. SIAM J. Optim. 32(2): 1156-1183 (2022) - [j49]Sen Na, Sungho Shin, Mihai Anitescu, Victor M. Zavala:
On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control. IEEE Trans. Autom. Control. 67(11): 5996-6011 (2022) - [c16]Vishwas Rao, Anirudh Subramanyam, Michel Schanen, Youngdae Kim, Ignas Satkauskas, Mihai Anitescu:
Frequency Recovery in Power Grids using High-Performance Computing. ICPP Workshops 2022: 20:1-20:6 - [c15]Sheng Lei, Daniel A. Maldonado, Emil M. Constantinescu, Junbo Zhao, Somayeh Yarahmadi, Lamine Mili, Mihai Anitescu:
A Novel Continuum Approximation to Power System Electromechanical Dynamics. ISGT 2022: 1-5 - [c14]François Pacaud, Michel Schanen, Daniel Adrian Maldonado, Alexis Montoison, Valentin Churavy, Julian Samaroo, Mihai Anitescu:
Batched Second-Order Adjoint Sensitivity for Reduced Space Methods. PP 2022: 60-71 - [i14]François Pacaud, Michel Schanen, Daniel Adrian Maldonado, Alexis Montoison, Valentin Churavy, Julian Samaroo, Mihai Anitescu:
Batched Second-Order Adjoint Sensitivity for Reduced Space Methods. CoRR abs/2201.00241 (2022) - [i13]Sungho Shin, Yiheng Lin, Guannan Qu, Adam Wierman, Mihai Anitescu:
Near-Optimal Distributed Linear-Quadratic Regulator for Networked Systems. CoRR abs/2204.05551 (2022) - [i12]Sungho Shin, Sen Na, Mihai Anitescu:
Near-Optimal Performance of Stochastic Predictive Control. CoRR abs/2210.08599 (2022) - 2021
- [j48]Vishwas Rao, Mihai Anitescu:
Efficient Computation of Extreme Excursion Probabilities for Dynamical Systems through Rice's Formula. SIAM/ASA J. Uncertain. Quantification 9(2): 731-762 (2021) - [j47]Jacob Roth, David A. Barajas-Solano, Panos Stinis, Jonathan Weare, Mihai Anitescu:
A Kinetic Monte Carlo Approach for Simulating Cascading Transmission Line Failure. Multiscale Model. Simul. 19(1): 208-241 (2021) - [j46]Jing Yu, Mihai Anitescu:
Multidimensional sum-up rounding for integer programming in optimal experimental design. Math. Program. 185(1-2): 37-76 (2021) - [j45]Amanda Lenzi, Julie Bessac, Mihai Anitescu:
Power grid frequency prediction using spatiotemporal modeling. Stat. Anal. Data Min. 14(6): 662-675 (2021) - [c13]Daniel Adrian Maldonado, Michel Schanen, François Pacaud, Mihai Anitescu:
Domain Decomposition Preconditioners for Unstructured Network Problems in Parallel Vector Architectures. ICPP Workshops 2021: 30:1-30:5 - [i11]Johannes J. Brust, Mihai Anitescu:
Convergence Analysis of Fixed Point Chance Constrained Optimal Power Flow Problems. CoRR abs/2101.11740 (2021) - [i10]Sen Na, Mihai Anitescu, Mladen Kolar:
An Adaptive Stochastic Sequential Quadratic Programming with Differentiable Exact Augmented Lagrangians. CoRR abs/2102.05320 (2021) - [i9]Aydin Buluç, Tamara G. Kolda, Stefan M. Wild, Mihai Anitescu, Anthony M. DeGennaro, John Jakeman, Chandrika Kamath, Ramakrishnan Kannan, Miles E. Lopes, Per-Gunnar Martinsson, Kary L. Myers, Jelani Nelson, Juan M. Restrepo, C. Seshadhri, Draguna L. Vrabie, Brendt Wohlberg, Stephen J. Wright, Chao Yang, Peter Zwart:
Randomized Algorithms for Scientific Computing (RASC). CoRR abs/2104.11079 (2021) - [i8]Youngdae Kim, François Pacaud, Kibaek Kim, Mihai Anitescu:
Leveraging GPU batching for scalable nonlinear programming through massive Lagrangian decomposition. CoRR abs/2106.14995 (2021) - [i7]Sen Na, Mihai Anitescu, Mladen Kolar:
Inequality Constrained Stochastic Nonlinear Optimization via Active-Set Sequential Quadratic Programming. CoRR abs/2109.11502 (2021) - 2020
- [j44]Sen Na, Mihai Anitescu:
Exponential Decay in the Sensitivity Analysis of Nonlinear Dynamic Programming. SIAM J. Optim. 30(2): 1527-1554 (2020) - [j43]Sungho Shin, Victor M. Zavala, Mihai Anitescu:
Decentralized Schemes With Overlap for Solving Graph-Structured Optimization Problems. IEEE Trans. Control. Netw. Syst. 7(3): 1225-1236 (2020) - [c12]Sungho Shin, Mihai Anitescu, Victor M. Zavala:
Overlapping Schwarz Decomposition for Constrained Quadratic Programs. CDC 2020: 3004-3009 - [c11]Vishwas Rao, Romit Maulik, Emil M. Constantinescu, Mihai Anitescu:
A Machine-Learning-Based Importance Sampling Method to Compute Rare Event Probabilities. ICCS (6) 2020: 169-182 - [i6]Sen Na, Mihai Anitescu:
Superconvergence of Online Optimization for Model Predictive Control. CoRR abs/2001.03707 (2020) - [i5]Vishwas Rao, Mihai Anitescu:
Efficient computation of extreme excursion probabilities for dynamical systems. CoRR abs/2001.11904 (2020) - [i4]Sen Na, Sungho Shin, Mihai Anitescu, Victor M. Zavala:
Overlapping Schwarz Decomposition for Nonlinear Optimal Control. CoRR abs/2005.06674 (2020)
2010 – 2019
- 2019
- [j42]Xialiang Dou, Mihai Anitescu:
Distributionally robust optimization with correlated data from vector autoregressive processes. Oper. Res. Lett. 47(4): 294-299 (2019) - [j41]Cosmin G. Petra, Naiyuan Chiang, Mihai Anitescu:
A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information. SIAM J. Optim. 29(2): 1048-1075 (2019) - [c10]Michel Schanen, Daniel Adrian Maldonado, Mihai Anitescu:
A Framework for Distributed Approximation of Moments with Higher-Order Derivatives Through Automatic Differentiation. ICCS (5) 2019: 251-260 - [i3]Xialiang Dou, Mihai Anitescu:
Distributionally Robust Optimization with Correlated Data from Vector Autoregressive Processes. CoRR abs/1909.03433 (2019) - [i2]Sen Na, Mihai Anitescu:
Exponential Decay in the Sensitivity Analysis of Nonlinear Dynamic Programming. CoRR abs/1912.06734 (2019) - [i1]Jacob Roth, David A. Barajas-Solano, Panagiotis Stinis, Jonathan Weare, Mihai Anitescu:
A Kinetic Monte Carlo Approach for Simulating Cascading Transmission Line Failure. CoRR abs/1912.08081 (2019) - 2018
- [j40]Wanting Xu, Mihai Anitescu:
Exponentially Accurate Temporal Decomposition for Long-Horizon Linear-Quadratic Dynamic Optimization. SIAM J. Optim. 28(3): 2541-2573 (2018) - 2017
- [j39]Victor M. Zavala, Kibaek Kim, Mihai Anitescu, John R. Birge:
A Stochastic Electricity Market Clearing Formulation with Consistent Pricing Properties. Oper. Res. 65(3): 557-576 (2017) - [j38]Charlotte A. L. Haley, Mihai Anitescu:
Optimal Bandwidth for Multitaper Spectrum Estimation. IEEE Signal Process. Lett. 24(11): 1696-1700 (2017) - [j37]Hong Zhang, Shrirang Abhyankar, Emil M. Constantinescu, Mihai Anitescu:
Discrete Adjoint Sensitivity Analysis of Hybrid Dynamical Systems With Switching. IEEE Trans. Circuits Syst. I Regul. Pap. 64-I(5): 1247-1259 (2017) - [c9]Mihai Anitescu, Victor M. Zavala:
MPC as a DVI: Implications on sampling rates and accuracy. CDC 2017: 1933-1938 - 2016
- [j36]Wanting Xu, Mihai Anitescu:
A Limited-Memory Multiple Shooting Method for Weakly Constrained Variational Data Assimilation. SIAM J. Numer. Anal. 54(6): 3300-3331 (2016) - [c8]Michel Schanen, Oana Marin, Hong Zhang, Mihai Anitescu:
Asynchronous Two-level Checkpointing Scheme for Large-scale Adjoints in the Spectral-element Solver Nek5000. ICCS 2016: 1147-1158 - 2014
- [j35]Xiaoyan Zeng, Mihai Anitescu:
Sequential Monte Carlo sampling in hidden Markov models of nonlinear dynamical systems. Appl. Math. Comput. 233: 507-521 (2014) - [j34]Cosmin G. Petra, Olaf Schenk, Mihai Anitescu:
Real-Time Stochastic Optimization of Complex Energy Systems on High-Performance Computers. Comput. Sci. Eng. 16(5): 32-42 (2014) - [j33]Oleg Roderick, Mihai Anitescu, Yulia T. Peet:
Proper orthogonal decompositions in multifidelity uncertainty quantification of complex simulation models. Int. J. Comput. Math. 91(4): 748-769 (2014) - [j32]Jie Chen, Tom L. H. Li, Mihai Anitescu:
A parallel linear solver for multilevel Toeplitz systems with possibly several right-hand sides. Parallel Comput. 40(8): 408-424 (2014) - [j31]Victor M. Zavala, Mihai Anitescu:
Scalable Nonlinear Programming via Exact Differentiable Penalty Functions and Trust-Region Newton Methods. SIAM J. Optim. 24(1): 528-558 (2014) - [j30]Mihai Anitescu, Xiaoyan Zeng, Emil M. Constantinescu:
A Low-Memory Approach for Best-State Estimation of Hidden Markov Models with Model Error. SIAM J. Numer. Anal. 52(1): 468-495 (2014) - [j29]Jie Chen, Lei Wang, Mihai Anitescu:
A Fast Summation Tree Code for Matérn Kernel. SIAM J. Sci. Comput. 36(1) (2014) - 2013
- [j28]Miles Lubin, J. A. Julian Hall, Cosmin G. Petra, Mihai Anitescu:
Parallel distributed-memory simplex for large-scale stochastic LP problems. Comput. Optim. Appl. 55(3): 571-596 (2013) - 2012
- [j27]Cosmin G. Petra, Mihai Anitescu:
A preconditioning technique for Schur complement systems arising in stochastic optimization. Comput. Optim. Appl. 52(2): 315-344 (2012) - [j26]Mihai Anitescu, Goran Lesaja:
Special issue in honour of Professor Florian A. Potra's 60th Birthday. Optim. Methods Softw. 27(4-5): 579-581 (2012) - [j25]Miles Lubin, Cosmin G. Petra, Mihai Anitescu:
The parallel solution of dense saddle-point linear systems arising in stochastic programming. Optim. Methods Softw. 27(4-5): 845-864 (2012) - [j24]Michael L. Stein, Jie Chen, Mihai Anitescu:
Difference Filter Preconditioning for Large Covariance Matrices. SIAM J. Matrix Anal. Appl. 33(1): 52-72 (2012) - [j23]Mihai Anitescu, Jie Chen, Lei Wang:
A Matrix-free Approach for Solving the Parametric Gaussian Process Maximum Likelihood Problem. SIAM J. Sci. Comput. 34(1) (2012) - 2011
- [j22]Jie Chen, Mihai Anitescu, Yousef Saad:
Computing f(A)b via Least Squares Polynomial Approximations. SIAM J. Sci. Comput. 33(1): 195-222 (2011) - [c7]Victor M. Zavala, Mihai Anitescu:
New insights into the dynamic stability of wholesale electricity markets. CACSD 2011: 828-833 - [c6]Miles Lubin, Cosmin G. Petra, Mihai Anitescu, Victor M. Zavala:
Scalable stochastic optimization of complex energy systems. SC 2011: 64:1-64:64 - 2010
- [j21]Mihai Anitescu, Alessandro Tasora:
An iterative approach for cone complementarity problems for nonsmooth dynamics. Comput. Optim. Appl. 47(2): 207-235 (2010) - [j20]Mihai Anitescu, Sanghyun Park:
A linear assignment approach for the least-squares protein morphing problem. Math. Program. 125(1): 195-203 (2010) - [j19]Mihai Anitescu, Robert Fourer:
Preface. Math. Program. 125(2): 205-206 (2010) - [j18]David E. Stewart, Mihai Anitescu:
Optimal control of systems with discontinuous differential equations. Numerische Mathematik 114(4): 653-695 (2010) - [j17]Victor M. Zavala, Mihai Anitescu:
Real-Time Nonlinear Optimization as a Generalized Equation. SIAM J. Control. Optim. 48(8): 5444-5467 (2010) - [c5]Victor M. Zavala, Mihai Anitescu:
Achieving higher frequencies in large-scale nonlinear model predictive control. CDC 2010: 6119-6124
2000 – 2009
- 2009
- [j16]Mihai Anitescu, Dan Negrut, Peter Zapol, Anter El-Azab:
A note on the regularity of reduced models obtained by nonlocal quasi-continuum-like approaches. Math. Program. 118(2): 207-236 (2009) - [j15]Cosmin G. Petra, Bogdan I. Gavrea, Mihai Anitescu, Florian A. Potra:
A computational study of the use of an optimization-based method for simulating large multibody systems. Optim. Methods Softw. 24(6): 871-894 (2009) - [j14]Mihai Anitescu:
Spectral Finite-Element Methods for Parametric Constrained Optimization Problems. SIAM J. Numer. Anal. 47(3): 1739-1759 (2009) - 2008
- [j13]Bogdan I. Gavrea, Mihai Anitescu, Florian A. Potra:
Convergence of a Class of Semi-Implicit Time-Stepping Schemes for Nonsmooth Rigid Multibody Dynamics. SIAM J. Optim. 19(2): 969-1001 (2008) - 2007
- [j12]Mihai Anitescu, Paul Tseng, Stephen J. Wright:
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties. Math. Program. 110(2): 337-371 (2007) - [j11]Mihai Anitescu, William J. Layton:
Sensitivities in Large Eddy Simulation and Improved Estimates of Turbulent Flow Functionals. SIAM J. Sci. Comput. 29(4): 1650-1667 (2007) - 2006
- [j10]Mihai Anitescu:
Optimization-based simulation of nonsmooth rigid multibody dynamics. Math. Program. 105(1): 113-143 (2006) - 2005
- [j9]Mihai Anitescu:
On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints. SIAM J. Optim. 15(4): 1203-1236 (2005) - [j8]Mihai Anitescu:
Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints. SIAM J. Optim. 16(1): 120-145 (2005) - 2004
- [j7]Mihai Anitescu, Gary D. Hart:
A fixed-point iteration approach for multibody dynamics with contact and small friction. Math. Program. 101(1): 3-32 (2004) - [c4]Jufeng Peng, Mihai Anitescu, Srinivas Akella:
Optimal Control of Multiple Robot Systems with Friction using MPCC. ICRA 2004: 5224-5231 - 2003
- [c3]Mihai Anitescu:
A fixed time-step approach for multibody dynamics with contact and friction. IROS 2003: 3725-3731 - [c2]Gary D. Hart, Mihai Anitescu:
A hard-constraint time-stepping approach for rigid multibody dynamics with joints, contact, and friction. Richard Tapia Celebration of Diversity in Computing Conference 2003: 34-41 - 2002
- [j6]Mihai Anitescu:
On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy. Math. Program. 92(2): 359-386 (2002) - [j5]Mihai Anitescu:
A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming. SIAM J. Optim. 12(4): 949-978 (2002) - 2001
- [j4]Mehmet Kivanç Mihçak, Pierre Moulin, Mihai Anitescu, Kannan Ramchandran:
Rate-distortion-optimal subband coding without perfect-reconstruction constraints. IEEE Trans. Signal Process. 49(3): 542-557 (2001) - 2000
- [j3]Mihai Anitescu:
Degenerate Nonlinear Programming with a Quadratic Growth Condition. SIAM J. Optim. 10(4): 1116-1135 (2000) - [j2]Pierre Moulin, Mihai Anitescu, Kannan Ramchandran:
Theory of rate-distortion-optimal, constrained filterbanks-application to IIR and FIR biorthogonal designs. IEEE Trans. Signal Process. 48(4): 1120-1132 (2000)
1990 – 1999
- 1997
- [j1]Pierre Moulin, Mihai Anitescu, Kenneth O. Kortanek, Florian A. Potra:
The role of linear semi-infinite programming in signal-adapted QMF bank design. IEEE Trans. Signal Process. 45(9): 2160-2174 (1997) - 1996
- [c1]Pierre Moulin, Mihai Anitescu, Kenneth O. Kortanek, Florian A. Potra:
Design of signal-adapted FIR paraunitary filter banks. ICASSP 1996: 1519-1522
Coauthor Index
Daniel A. Maldonado
aka: Daniel Adrian Maldonado
aka: Daniel Adrian Maldonado
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-10-17 20:32 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:
