default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUday V. Shanbhag
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
[j49]Shijie Huang
, Jinlong Lei, Yiguang Hong, Uday V. Shanbhag, Jie Chen:
No-Regret Distributed Learning in Subnetwork Zero-Sum Games. IEEE Trans. Autom. Control. 69(10): 6620-6635 (2024)- [j48]Russell R. Barton, Marvin K. Nakayama, Uday V. Shanbhag, Eunhye Song:
Introduction to the Special Issue for INFORMS Simulation Society (I-Sim) Workshop, 2021. ACM Trans. Model. Comput. Simul. 34(2): 5:1-5:3 (2024) - [j47]Linyun He, Uday V. Shanbhag, Eunhye Song:
Stochastic Approximation for Multi-period Simulation Optimization with Streaming Input Data. ACM Trans. Model. Comput. Simul. 34(2): 6:1-6:27 (2024) - [c54]Mohammadjavad Ebrahimi, Uday V. Shanbhag, Farzad Yousefian:
Distributed Gradient Tracking Methods with Guarantees for Computing a Solution to Stochastic MPECs. ACC 2024: 2182-2187 - 2023
- [j46]Shisheng Cui, Uday V. Shanbhag, Farzad Yousefian:
Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs. Math. Program. 198(2): 1153-1225 (2023) - [j45]Shisheng Cui, Uday V. Shanbhag:
On the computation of equilibria in monotone and potential stochastic hierarchical games. Math. Program. 198(2): 1227-1285 (2023) - [j44]I. E. Bardakci, Afrooz Jalilzadeh, Constantino M. Lagoa, Uday V. Shanbhag:
Probability maximization via Minkowski functionals: convex representations and tractable resolution. Math. Program. 199(1): 595-637 (2023) - [j43]Shisheng Cui, Uday V. Shanbhag:
Variance-Reduced Splitting Schemes for Monotone Stochastic Generalized Equations. IEEE Trans. Autom. Control. 68(11): 6636-6648 (2023) - [c53]Peixuan Zhang, Uday V. Shanbhag, Constantino M. Lagoa, Ibrahim E. Bardakci:
Global Resolution of Chance-Constrained Optimization Problems: Minkowski Functionals and Monotone Inclusions. CDC 2023: 6301-6306 - [c52]Yuyang Qiu, Uday V. Shanbhag, Farzad Yousefian:
Zeroth-Order Methods for Nondifferentiable, Nonconvex, and Hierarchical Federated Optimization. NeurIPS 2023 - [i5]Shisheng Cui, Uday V. Shanbhag, Mathias Staudigl:
A regularized variance-reduced modified extragradient method for stochastic hierarchical games. CoRR abs/2302.06497 (2023) - 2022
- [j42]Shisheng Cui, Uday V. Shanbhag, Mathias Staudigl, Phan Tu Vuong:
Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces. Comput. Optim. Appl. 83(2): 465-524 (2022) - [j41]Afrooz Jalilzadeh, Angelia Nedic, Uday V. Shanbhag, Farzad Yousefian:
A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization. Math. Oper. Res. 47(1): 690-719 (2022) - [j40]Jinlong Lei, Uday V. Shanbhag:
Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes. Optim. Methods Softw. 37(1): 264-294 (2022) - [j39]Jinlong Lei, Uday V. Shanbhag:
Distributed Variable Sample-Size Gradient-Response and Best-Response Schemes for Stochastic Nash Equilibrium Problems. SIAM J. Optim. 32(2): 573-603 (2022) - [j38]Necdet Serhat Aybat, Hesam Ahmadi, Uday V. Shanbhag:
On the Analysis of Inexact Augmented Lagrangian Schemes for Misspecified Conic Convex Programs. IEEE Trans. Autom. Control. 67(8): 3981-3996 (2022) - 2021
- [j37]Yue Xie, Uday V. Shanbhag:
Tractable ADMM schemes for computing KKT points and local minimizers for $$\ell _0$$ ℓ 0 -minimization problems. Comput. Optim. Appl. 78(1): 43-85 (2021) - [c51]Shisheng Cui, Barbara Franci, Sergio Grammatico, Uday V. Shanbhag, Mathias Staudigl:
A relaxed-inertial forward-backward-forward algorithm for stochastic generalized Nash equilibrium seeking. CDC 2021: 197-202 - [c50]Shijie Huang, Jinlong Lei, Yiguang Hong, Uday V. Shanbhag:
No-Regret Distributed Learning in Two-Network Zero-Sum Games. CDC 2021: 924-929 - [i4]Shisheng Cui, Barbara Franci, Sergio Grammatico, Uday V. Shanbhag, Mathias Staudigl:
A relaxed-inertial forward-backward-forward algorithm for Stochastic Generalized Nash equilibrium seeking. CoRR abs/2103.13115 (2021) - 2020
- [j36]Hesam Ahmadi, Uday V. Shanbhag:
On the resolution of misspecified convex optimization and monotone variational inequality problems. Comput. Optim. Appl. 77(1): 125-161 (2020) - [j35]Jinlong Lei, Uday V. Shanbhag:
Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization. Oper. Res. 68(6): 1742-1766 (2020) - [j34]Jinlong Lei, Uday V. Shanbhag, Jong-Shi Pang, Suvrajeet Sen:
On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games. Math. Oper. Res. 45(1): 157-190 (2020) - [j33]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
On Stochastic and Deterministic Quasi-Newton Methods for Nonstrongly Convex Optimization: Asymptotic Convergence and Rate Analysis. SIAM J. Optim. 30(2): 1144-1172 (2020) - [j32]Yue Xie, Uday V. Shanbhag:
SI-ADMM: A Stochastic Inexact ADMM Framework for Stochastic Convex Programs. IEEE Trans. Autom. Control. 65(6): 2355-2370 (2020) - [c49]Jinlong Lei, Uday V. Shanbhag, Jie Chen:
Distributed Computation of Nash Equilibria for Monotone Aggregative Games via Iterative Regularization. CDC 2020: 2285-2290 - [i3]Shisheng Cui, Uday V. Shanbhag:
Variance-Reduced Proximal and Splitting Schemes for Monotone Stochastic Generalized Equations. CoRR abs/2008.11348 (2020)
2010 – 2019
- 2019
- [j31]Aswin Kannan, Uday V. Shanbhag:
Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants. Comput. Optim. Appl. 74(3): 779-820 (2019) - [c48]Afrooz Jalilzadeh, Uday V. Shanbhag:
Smoothed First-order Algorithms for Expectation-valued Constrained Problems. CISS 2019: 1 - [c47]Afrooz Jalilzadeh, Uday V. Shanbhag:
A Proximal-Point Algorithm with Variable Sample-Sizes (PPAWSS) for Monotone Stochastic Variational Inequality Problems. WSC 2019: 3551-3562 - [c46]Eunhye Song, Uday V. Shanbhag:
Stochastic Approximation for simulation Optimization under Input Uncertainty with Streaming Data. WSC 2019: 3597-3608 - 2018
- [j30]Hao Jiang, Uday V. Shanbhag, Sean P. Meyn:
Distributed Computation of Equilibria in Misspecified Convex Stochastic Nash Games. IEEE Trans. Autom. Control. 63(2): 360-371 (2018) - [c45]I. E. Bardakci, Constantino Lagoa, Uday V. Shanbhag:
Probability Maximization with Random Linear Inequalities: Alternative Formulations and Stochastic Approximation Schemes. ACC 2018: 1396-1401 - [c44]Jinlong Lei, Uday V. Shanbhag:
Linearly Convergent Variable Sample-Size Schemes for Stochastic Nash Games: Best-Response Schemes and Distributed Gradient-Response Schemes. CDC 2018: 3547-3552 - [c43]Afrooz Jalilzadeh, Angelia Nedic, Uday V. Shanbhag, Farzad Yousefian:
A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization. CDC 2018: 4097-4102 - 2017
- [j29]Jong-Shi Pang, Suvrajeet Sen, Uday V. Shanbhag:
Two-stage non-cooperative games with risk-averse players. Math. Program. 165(1): 235-290 (2017) - [j28]Uma Ravat, Uday V. Shanbhag:
On the existence of solutions to stochastic quasi-variational inequality and complementarity problems. Math. Program. 165(1): 291-330 (2017) - [j27]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems. Math. Program. 165(1): 391-431 (2017) - [c42]Jinlong Lei, Uday V. Shanbhag:
A randomized inexact proximal best-response scheme for potential stochastic nash games. CDC 2017: 1646-1651 - [c41]George Kesidis, Uday V. Shanbhag, Neda Nasiriani, Bhuvan Urgaonkar:
Competition and Peak-Demand Pricing in Clouds Under Tenants' Demand Response. MASCOTS 2017: 244-254 - [c40]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
A smoothing stochastic quasi-newton method for non-lipschitzian stochastic optimization problems. WSC 2017: 2291-2302 - 2016
- [j26]Jayash Koshal, Angelia Nedic, Uday V. Shanbhag:
Distributed Algorithms for Aggregative Games on Graphs. Oper. Res. 64(3): 680-704 (2016) - [j25]Yue Xie, Uday V. Shanbhag:
On Robust Solutions to Uncertain Linear Complementarity Problems and their Variants. SIAM J. Optim. 26(4): 2120-2159 (2016) - [j24]Hao Jiang, Uday V. Shanbhag:
On the Solution of Stochastic Optimization and Variational Problems in Imperfect Information Regimes. SIAM J. Optim. 26(4): 2394-2429 (2016) - [j23]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
Self-Tuned Stochastic Approximation Schemes for Non-Lipschitzian Stochastic Multi-User Optimization and Nash Games. IEEE Trans. Autom. Control. 61(7): 1753-1766 (2016) - [c39]Hesam Ahmadi, Necdet Serhat Aybat, Uday V. Shanbhag:
On the rate analysis of inexact augmented Lagrangian schemes for convex optimization problems with misspecified constraints. ACC 2016: 4841-4846 - [c38]Uday V. Shanbhag, Jong-Shi Pang, Suvrajeet Sen:
Inexact best-response schemes for stochastic Nash games: Linear convergence and Iteration complexity analysis. CDC 2016: 3591-3596 - [c37]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
Stochastic quasi-Newton methods for non-strongly convex problems: Convergence and rate analysis. CDC 2016: 4496-4503 - [c36]Shisheng Cui, Uday V. Shanbhag:
On the analysis of reflected gradient and splitting methods for monotone stochastic variational inequality problems. CDC 2016: 4510-4515 - [c35]Afrooz Jalilzadeh, Uday V. Shanbhag:
eg-VSSA: An extragradient variable sample-size stochastic approximation scheme: Error analysis and complexity trade-offs. WSC 2016: 690-701 - [c34]Yue Xie, Uday V. Shanbhag:
SI-ADMM: A stochastic inexact ADMM framework for resolving structured stochastic convex programs. WSC 2016: 714-725 - 2015
- [j22]Ankur A. Kulkarni, Uday V. Shanbhag:
An Existence Result for Hierarchical Stackelberg v/s Stackelberg Games. IEEE Trans. Autom. Control. 60(12): 3379-3384 (2015) - [c33]Aswin Kannan, Angelia Nedic, Uday V. Shanbhag:
Distributed stochastic optimization under imperfect information. CDC 2015: 400-405 - [c32]Uday V. Shanbhag, Jose H. Blanchet:
Budget-constrained stochastic approximation. WSC 2015: 368-379 - [c31]Hao Jiang, Uday V. Shanbhag:
Data-driven schemes for resolving misspecified MDPs: asymptotics and error analysis. WSC 2015: 3801-3812 - 2014
- [j21]Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday V. Shanbhag:
On the Efficiency of Equilibria in Mean-Field Oscillator Games. Dyn. Games Appl. 4(2): 177-207 (2014) - [j20]Matthew J. Robbins, Sheldon H. Jacobson, Uday V. Shanbhag, Banafsheh Behzad:
The Weighted Set Covering Game: A Vaccine Pricing Model for Pediatric Immunization. INFORMS J. Comput. 26(1): 183-198 (2014) - [j19]Uma Ravat, Uday V. Shanbhag, Richard B. Sowers:
On the inadequacy of VaR-based risk management: VaR, CVaR, and nonlinear interactions. Optim. Methods Softw. 29(4): 877-897 (2014) - [j18]Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday V. Shanbhag:
Learning in Mean-Field Games. IEEE Trans. Autom. Control. 59(3): 629-644 (2014) - [c30]Aswin Kannan, Uday V. Shanbhag:
The pseudomonotone stochastic variational inequality problem: Analytical statements and stochastic extragradient schemes. ACC 2014: 2930-2935 - [c29]Yue Xie, Uday V. Shanbhag:
On robust solutions to uncertain monotone linear complementarity problems (LCPs) and their variants. CDC 2014: 2834-2839 - [c28]Hesam Ahmadi, Uday V. Shanbhag:
Data-driven first-order methods for misspecified convex optimization problems: Global convergence and Rate estimates. CDC 2014: 4228-4233 - [c27]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
Optimal robust smoothing extragradient algorithms for stochastic variational inequality problems. CDC 2014: 5831-5836 - [c26]Cheng Wang, Bhuvan Urgaonkar, George Kesidis, Uday V. Shanbhag, Qian Wang:
A Case for Virtualizing the Electric Utility in Cloud Data Centers. HotCloud 2014 - 2013
- [j17]Dane A. Schiro, Jong-Shi Pang, Uday V. Shanbhag:
On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method. Math. Program. 142(1-2): 1-46 (2013) - [j16]Aswin Kannan, Uday V. Shanbhag, Harrison M. Kim:
Addressing supply-side risk in uncertain power markets: stochastic Nash models, scalable algorithms and error analysis. Optim. Methods Softw. 28(5): 1095-1138 (2013) - [j15]Bhuvan Urgaonkar, George Kesidis, Uday V. Shanbhag, Cheng Wang:
Pricing of service in clouds: optimal response and strategic interactions. SIGMETRICS Perform. Evaluation Rev. 41(3): 28-30 (2013) - [j14]Jayash Koshal, Angelia Nedic, Uday V. Shanbhag:
Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality Problems. IEEE Trans. Autom. Control. 58(3): 594-609 (2013) - [c25]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
A distributed adaptive steplength stochastic approximation method for monotone stochastic Nash Games. ACC 2013: 4765-4770 - [c24]Ankur A. Kulkarni, Uday V. Shanbhag:
On the consistency of leaders' conjectures in hierarchical games. CDC 2013: 1180-1185 - [c23]Hao Jiang, Uday V. Shanbhag:
On the solution of stochastic optimization problems in imperfect information regimes. WSC 2013: 821-832 - [c22]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
A regularized smoothing stochastic approximation (RSSA) algorithm for stochastic variational inequality problems. WSC 2013: 933-944 - 2012
- [j13]Ankur A. Kulkarni, Uday V. Shanbhag:
On the variational equilibrium as a refinement of the generalized Nash equilibrium. Autom. 48(1): 45-55 (2012) - [j12]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
On stochastic gradient and subgradient methods with adaptive steplength sequences. Autom. 48(1): 56-67 (2012) - [j11]Ankur A. Kulkarni, Uday V. Shanbhag:
Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms. Comput. Optim. Appl. 51(1): 77-123 (2012) - [j10]Ankur A. Kulkarni, Uday V. Shanbhag:
Revisiting Generalized Nash Games and Variational Inequalities. J. Optim. Theory Appl. 154(1): 175-186 (2012) - [j9]Aswin Kannan, Uday V. Shanbhag:
Distributed Computation of Equilibria in Monotone Nash Games via Iterative Regularization Techniques. SIAM J. Optim. 22(4): 1177-1205 (2012) - [j8]Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday V. Shanbhag:
Synchronization of Coupled Oscillators is a Game. IEEE Trans. Autom. Control. 57(4): 920-935 (2012) - [c21]Gui Wang, Uday V. Shanbhag, Sean P. Meyn:
On Nash equilibria in duopolistic power markets subject to make-whole uplift. CDC 2012: 472-477 - [c20]Hao Jiang, Uday V. Shanbhag:
On the convergence of joint schemes for online computation and supervised learning. CDC 2012: 4462-4467 - [c19]Jayash Koshal, Angelia Nedic, Uday V. Shanbhag:
A gossip algorithm for aggregative games on graphs. CDC 2012: 4840-4845 - [c18]Michael Roytman, Uday V. Shanbhag, Judith B. Cardell, C. Lindsay Anderson:
Packaging Energy and Reserves Bids through Risk Penalties for Enhanced Reliability in Co-optimized Markets. HICSS 2012: 1915-1922 - [c17]Gui Wang, Matias Negrete-Pincetic, Anupama Kowli, Ehsan Shafieepoorfard, Sean P. Meyn, Uday V. Shanbhag:
Real-time prices in an entropic grid. ISGT 2012: 1-8 - [i2]Ankur A. Kulkarni, Uday V. Shanbhag:
Global Equilibria of Multi-leader Multi-follower Games with Shared Constraints. CoRR abs/1206.2968 (2012) - 2011
- [j7]Uday V. Shanbhag, Gerd Infanger, Peter W. Glynn:
A Complementarity Framework for Forward Contracting Under Uncertainty. Oper. Res. 59(4): 810-834 (2011) - [j6]Jayash Koshal, Angelia Nedic, Uday V. Shanbhag:
Multiuser Optimization: Distributed Algorithms and Error Analysis. SIAM J. Optim. 21(3): 1046-1081 (2011) - [j5]Uma Ravat, Uday V. Shanbhag:
On the Characterization of Solution Sets of Smooth and Nonsmooth Convex Stochastic Nash Games. SIAM J. Optim. 21(3): 1168-1199 (2011) - [j4]Huibing Yin, Uday V. Shanbhag, Prashant G. Mehta:
Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints. IEEE Trans. Autom. Control. 56(7): 1702-1708 (2011) - [c16]Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday V. Shanbhag:
On the efficiency of equilibria in mean-field oscillator games. ACC 2011: 5354-5359 - [c15]Hao Jiang, Uday V. Shanbhag, Sean P. Meyn:
Learning equilibria in constrained Nash-Cournot games with misspecified demand functions. CDC/ECC 2011: 1018-1023 - [c14]Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday V. Shanbhag:
Bifurcation analysis of a heterogeneous mean-field oscillator game model. CDC/ECC 2011: 3895-3900 - [c13]Jayash Koshal, Angelia Nedic, Uday V. Shanbhag:
Single timescale stochastic approximation for stochastic Nash games in cognitive radio systems. DSP 2011: 1-8 - [c12]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
A regularized adaptive steplength stochastic approximation scheme for monotone stochastic variational inequalities. WSC 2011: 4115-4126 - [i1]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
On Stochastic Gradient and Subgradient Methods with Adaptive Steplength Sequences. CoRR abs/1105.4549 (2011) - 2010
- [j3]Umesh Vaidya, Prashant G. Mehta, Uday V. Shanbhag:
Nonlinear Stabilization via Control Lyapunov Measure. IEEE Trans. Autom. Control. 55(6): 1314-1328 (2010) - [c11]Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday V. Shanbhag:
Synchronization of coupled oscillators is a game. ACC 2010: 1783-1790 - [c10]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
Convex nondifferentiable stochastic optimization: A local randomized smoothing technique. ACC 2010: 4875-4880 - [c9]Uma Ravat, Uday V. Shanbhag:
On the characterization of solution sets of smooth and nonsmooth stochastic Nash games. ACC 2010: 5632-5637 - [c8]Jayash Koshal, Angelia Nedic, Uday V. Shanbhag:
Single timescale regularized stochastic approximation schemes for monotone Nash games under uncertainty. CDC 2010: 231-236 - [c7]Aswin Kannan, Uday V. Shanbhag:
Distributed iterative regularization algorithms for monotone Nash games. CDC 2010: 1963-1968 - [c6]Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday V. Shanbhag:
Learning in mean-field oscillator games. CDC 2010: 3125-3132
2000 – 2009
- 2009
- [c5]Huibing Yin, Charles L. Cox, Prashant G. Mehta, Uday V. Shanbhag:
Bifurcation analysis of a thalamic relay neuron model. ACC 2009: 337-342 - [c4]Ankur A. Kulkarni, Uday V. Shanbhag:
New insights on generalized Nash games with shared constraints: Constrained and variational equilibria. CDC 2009: 151-156 - [c3]Jayash Koshal, Angelia Nedic, Uday V. Shanbhag:
Distributed multiuser optimization: Algorithms and error analysis. CDC 2009: 4372-4377 - [c2]Huibing Yin, Uday V. Shanbhag, Prashant G. Mehta:
Nash equilibrium problems with congestion costs and shared constraints. CDC 2009: 4649-4654 - 2007
- [j2]Walter Murray, Uday V. Shanbhag:
A local relaxation approach for the siting of electrical substation. Comput. Optim. Appl. 38(3): 299-303 (2007) - [c1]Umesh Vaidya, Prashant G. Mehta, Uday V. Shanbhag:
Nonlinear stabilization via control-Lyapunov measure. CDC 2007: 1722-1727 - 2006
- [j1]Walter Murray, Uday V. Shanbhag:
A Local Relaxation Approach for the Siting of Electrical Substations. Comput. Optim. Appl. 33(1): 7-49 (2006)
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-10-23 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:
