default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Steurer
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
[c58]Hongjie Chen
, Jingqiu Ding, Tommaso d'Orsi, Yiding Hua, Chih-Hung Liu, David Steurer:
Private Graphon Estimation via Sum-of-Squares. STOC 2024: 172-182- [i56]Hongjie Chen, Jingqiu Ding, Tommaso d'Orsi, Yiding Hua, Chih-Hung Liu, David Steurer:
Private graphon estimation via sum-of-squares. CoRR abs/2403.12213 (2024) - [i55]Jaroslaw Blasiok, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer:
Semirandom Planted Clique and the Restricted Isometry Property. CoRR abs/2404.14159 (2024) - [i54]Hongjie Chen, Jingqiu Ding, Yiding Hua, David Steurer:
Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust. CoRR abs/2405.16663 (2024) - [i53]Daniil Dmitriev, Rares-Darius Buhai, Stefan Tiegel, Alexander Wolters, Gleb Novikov, Amartya Sanyal, David Steurer, Fanny Yang:
Robust Mixture Learning when Outliers Overwhelm Small Groups. CoRR abs/2407.15792 (2024) - 2023
- [c57]Rares-Darius Buhai, David Steurer:
Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures. COLT 2023: 548-611 - [c56]Yiding Hua, Jingqiu Ding, Tommaso d'Orsi, David Steurer:
Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions. COLT 2023: 4044-4071 - [c55]Hongjie Chen, Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Jacob Imola, David Steurer, Stefan Tiegel:
Private estimation algorithms for stochastic block models and mixture models. NeurIPS 2023 - [c54]Gleb Novikov, David Steurer, Stefan Tiegel:
Robust Mean Estimation Without Moments for Symmetric Distributions. NeurIPS 2023 - [c53]Tommaso d'Orsi, Rajai Nasser, Gleb Novikov, David Steurer:
Higher degree sum-of-squares relaxations robust against oblivious outliers. SODA 2023: 3513-3550 - [c52]Rares-Darius Buhai, Pravesh K. Kothari, David Steurer:
Algorithms Approaching the Threshold for Semi-random Planted Clique. STOC 2023: 1918-1926 - [i52]Hongjie Chen, Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Jacob Imola, David Steurer, Stefan Tiegel:
Private estimation algorithms for stochastic block models and mixture models. CoRR abs/2301.04822 (2023) - [i51]Gleb Novikov, David Steurer, Stefan Tiegel:
Robust Mean Estimation Without a Mean: Dimension-Independent Error in Polynomial Time for Symmetric Distributions. CoRR abs/2302.10844 (2023) - [i50]Jingqiu Ding, Tommaso d'Orsi, Yiding Hua, David Steurer:
Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions. CoRR abs/2305.10227 (2023) - 2022
- [c51]Jingqiu Ding, Tommaso d'Orsi, Chih-Hung Liu, David Steurer, Stefan Tiegel:
Fast algorithm for overcomplete order-3 tensor decomposition. COLT 2022: 3741-3799 - [i49]Jingqiu Ding, Tommaso d'Orsi, Chih-Hung Liu, Stefan Tiegel, David Steurer:
Fast algorithm for overcomplete order-3 tensor decomposition. CoRR abs/2202.06442 (2022) - [i48]Tommaso d'Orsi, Rajai Nasser, Gleb Novikov, David Steurer:
Higher degree sum-of-squares relaxations robust against oblivious outliers. CoRR abs/2211.07327 (2022) - [i47]Rares-Darius Buhai, Pravesh K. Kothari, David Steurer:
Algorithms approaching the threshold for semi-random planted clique. CoRR abs/2212.05619 (2022) - 2021
- [c50]Jingqiu Ding, Tommaso d'Orsi, Rajai Nasser, David Steurer:
Robust recovery for stochastic block models. FOCS 2021: 387-394 - [c49]Tommaso d'Orsi, Gleb Novikov, David Steurer:
Consistent regression when oblivious outliers overwhelm. ICML 2021: 2297-2306 - [c48]Tommaso d'Orsi, Chih-Hung Liu, Rajai Nasser, Gleb Novikov, David Steurer, Stefan Tiegel:
Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers. NeurIPS 2021: 25427-25438 - [c47]David Steurer, Stefan Tiegel:
SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation. SODA 2021: 374-393 - [c46]Mitali Bafna, Boaz Barak, Pravesh K. Kothari, Tselil Schramm, David Steurer:
Playing unique games on certified small-set expanders. STOC 2021: 1629-1642 - [i46]David Steurer, Stefan Tiegel:
SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation. CoRR abs/2101.01509 (2021) - [i45]Tommaso d'Orsi, Chih-Hung Liu, Rajai Nasser, Gleb Novikov, David Steurer, Stefan Tiegel:
Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers. CoRR abs/2111.02966 (2021) - [i44]Jingqiu Ding, Tommaso d'Orsi, Rajai Nasser, David Steurer:
Robust recovery for stochastic block models. CoRR abs/2111.08568 (2021) - [i43]Rares-Darius Buhai, David Steurer:
Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures. CoRR abs/2112.05445 (2021) - 2020
- [c45]Tommaso d'Orsi, Pravesh K. Kothari, Gleb Novikov, David Steurer:
Sparse PCA: Algorithms, Adversarial Perturbations and Certificates. FOCS 2020: 553-564 - [c44]Jingqiu Ding, Samuel B. Hopkins, David Steurer:
Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks. NeurIPS 2020 - [i42]Mitali Bafna, Boaz Barak, Pravesh Kothari, Tselil Schramm, David Steurer:
Playing Unique Games on Certified Small-Set Expanders. CoRR abs/2006.09969 (2020) - [i41]Jingqiu Ding, Samuel B. Hopkins, David Steurer:
Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks. CoRR abs/2008.13735 (2020) - [i40]Tommaso d'Orsi, Gleb Novikov, David Steurer:
Regress Consistently when Oblivious Outliers Overwhelm. CoRR abs/2009.14774 (2020) - [i39]Tommaso d'Orsi, Pravesh K. Kothari, Gleb Novikov, David Steurer:
Sparse PCA: Algorithms, Adversarial Perturbations and Certificates. CoRR abs/2011.06585 (2020)
2010 – 2019
- 2019
- [c43]Boaz Barak, Pravesh K. Kothari, David Steurer:
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. ITCS 2019: 9:1-9:12 - 2018
- [c42]Pravesh K. Kothari, Jacob Steinhardt, David Steurer:
Robust moment estimation and improved clustering via sum of squares. STOC 2018: 1035-1046 - [e1]Eric Blais, Klaus Jansen, José D. P. Rolim, David Steurer:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA. LIPIcs 116, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-085-9 [contents] - [i38]Boaz Barak, Pravesh K. Kothari, David Steurer:
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. CoRR abs/1804.08662 (2018) - [i37]Prasad Raghavendra, Tselil Schramm, David Steurer:
High-dimensional estimation via sum-of-squares proofs. CoRR abs/1807.11419 (2018) - [i36]Boaz Barak, Pravesh Kothari, David Steurer:
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c41]Aaron Potechin, David Steurer:
Exact tensor completion with sum-of-squares. COLT 2017: 1619-1673 - [c40]Tselil Schramm, David Steurer:
Fast and robust tensor decomposition with applications to dictionary learning. COLT 2017: 1760-1793 - [c39]Samuel B. Hopkins, David Steurer:
Efficient Bayesian Estimation from Few Samples: Community Detection and Related Problems. FOCS 2017: 379-390 - [c38]Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer:
The Power of Sum-of-Squares for Detecting Hidden Structures. FOCS 2017: 720-731 - [c37]Boaz Barak, Pravesh K. Kothari, David Steurer:
Quantum entanglement, sum of squares, and the log rank conjecture. STOC 2017: 975-988 - [i35]Boaz Barak, Pravesh Kothari, David Steurer:
Quantum entanglement, sum of squares, and the log rank conjecture. CoRR abs/1701.06321 (2017) - [i34]Aaron Potechin, David Steurer:
Exact tensor completion with sum-of-squares. CoRR abs/1702.06237 (2017) - [i33]Tselil Schramm, David Steurer:
Fast and robust tensor decomposition with applications to dictionary learning. CoRR abs/1706.08672 (2017) - [i32]Samuel B. Hopkins, David Steurer:
Bayesian estimation from few samples: community detection and related problems. CoRR abs/1710.00264 (2017) - [i31]Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer:
The power of sum-of-squares for detecting hidden structures. CoRR abs/1710.05017 (2017) - [i30]Pravesh K. Kothari, David Steurer:
Outlier-robust moment-estimation via sum-of-squares. CoRR abs/1711.11581 (2017) - [i29]Boaz Barak, Pravesh Kothari, David Steurer:
Quantum entanglement, sum of squares, and the log rank conjecture. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j9]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
Approximate Constraint Satisfaction Requires Large LP Relaxations. J. ACM 63(4): 34:1-34:22 (2016) - [c36]Tengyu Ma, Jonathan Shi, David Steurer:
Polynomial-Time Tensor Decompositions with Sum-of-Squares. FOCS 2016: 438-446 - [c35]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer:
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors. STOC 2016: 178-191 - [i28]Tengyu Ma, Jonathan Shi, David Steurer:
Polynomial-time Tensor Decompositions with Sum-of-Squares. CoRR abs/1610.01980 (2016) - 2015
- [j8]Irit Dinur, David Steurer, Thomas Vidick:
A parallel repetition theorem for entangled projection games. Comput. Complex. 24(2): 201-254 (2015) - [j7]Sanjeev Arora, Boaz Barak, David Steurer:
Subexponential Algorithms for Unique Games and Related Problems. J. ACM 62(5): 42:1-42:25 (2015) - [j6]Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer:
Approximation Limits of Linear Programs (Beyond Hierarchies). Math. Oper. Res. 40(3): 756-772 (2015) - [j5]Adam N. Letchford, Jean B. Lasserre, Pablo A. Parrilo, David Steurer:
The 2013 Newton Institute Programme on polynomial optimization. Math. Program. 151(2): 375-377 (2015) - [j4]Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the Long Code Shorter. SIAM J. Comput. 44(5): 1287-1324 (2015) - [c34]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree. APPROX-RANDOM 2015: 110-123 - [c33]Samuel B. Hopkins, Jonathan Shi, David Steurer:
Tensor principal component analysis via sum-of-square proofs. COLT 2015: 956-1006 - [c32]Boaz Barak, Jonathan A. Kelner, David Steurer:
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. STOC 2015: 143-151 - [c31]James R. Lee, Prasad Raghavendra, David Steurer:
Lower Bounds on the Size of Semidefinite Programming Relaxations. STOC 2015: 567-576 - [i27]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. CoRR abs/1505.03424 (2015) - [i26]Samuel B. Hopkins, Jonathan Shi, David Steurer:
Tensor principal component analysis via sum-of-squares proofs. CoRR abs/1507.03269 (2015) - [i25]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer:
Speeding up sum-of-squares for tensor decomposition and planted sparse vectors. CoRR abs/1512.02337 (2015) - [i24]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c30]James R. Lee, Prasad Raghavendra, David Steurer, Ning Tan:
On the Power of Symmetric LP and SDP Relaxations. CCC 2014: 13-21 - [c29]Irit Dinur, David Steurer:
Direct Product Testing. CCC 2014: 188-196 - [c28]Irit Dinur, David Steurer, Thomas Vidick:
A Parallel Repetition Theorem for Entangled Projection Games. CCC 2014: 197-208 - [c27]Boaz Barak, Jonathan A. Kelner, David Steurer:
Rounding sum-of-squares relaxations. STOC 2014: 31-40 - [c26]Irit Dinur, David Steurer:
Analytical approach to parallel repetition. STOC 2014: 624-633 - [i23]Boaz Barak, David Steurer:
Sum-of-squares proofs and the quest toward optimal algorithms. CoRR abs/1404.5236 (2014) - [i22]Boaz Barak, Jonathan A. Kelner, David Steurer:
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. CoRR abs/1407.1543 (2014) - [i21]James R. Lee, Prasad Raghavendra, David Steurer:
Lower bounds on the size of semidefinite programming relaxations. CoRR abs/1411.6317 (2014) - [i20]Boaz Barak, David Steurer:
Sum-of-squares proofs and the quest toward optimal algorithms. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c25]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
Approximate Constraint Satisfaction Requires Large LP Relaxations. FOCS 2013: 350-359 - [c24]Boaz Barak, Guy Kindler, David Steurer:
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction. ITCS 2013: 197-214 - [i19]Irit Dinur, David Steurer:
Analytical Approach to Parallel Repetition. CoRR abs/1305.1979 (2013) - [i18]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
Approximate Constraint Satisfaction Requires Large LP Relaxations. CoRR abs/1309.0563 (2013) - [i17]Irit Dinur, David Steurer, Thomas Vidick:
A parallel repetition theorem for entangled projection games. CoRR abs/1310.4113 (2013) - [i16]Boaz Barak, Jonathan A. Kelner, David Steurer:
Rounding Sum-of-Squares Relaxations. CoRR abs/1312.6652 (2013) - [i15]Boaz Barak, Jonathan A. Kelner, David Steurer:
Rounding Sum-of-Squares Relaxations. Electron. Colloquium Comput. Complex. TR13 (2013) - [i14]Irit Dinur, David Steurer:
Direct Product Testing. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j3]Sanjeev Arora, Constantinos Daskalakis, David Steurer:
Message-Passing Algorithms and Improved LP Decoding. IEEE Trans. Inf. Theory 58(12): 7260-7271 (2012) - [c23]Prasad Raghavendra, David Steurer, Madhur Tulsiani:
Reductions between Expansion Problems. CCC 2012: 64-73 - [c22]Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the Long Code Shorter. FOCS 2012: 370-379 - [c21]Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer:
Approximation Limits of Linear Programs (Beyond Hierarchies). FOCS 2012: 480-489 - [c20]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, sum-of-squares proofs, and their applications. STOC 2012: 307-326 - [i13]Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer:
Approximation Limits of Linear Programs (Beyond Hierarchies). CoRR abs/1204.0957 (2012) - [i12]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, Sum-of-Squares Proofs, and their Applications. CoRR abs/1205.4484 (2012) - 2011
- [c19]Boaz Barak, Prasad Raghavendra, David Steurer:
Rounding Semidefinite Programming Hierarchies via Global Correlation. FOCS 2011: 472-481 - [c18]Venkatesan Guruswami, Yury Makarychev, Prasad Raghavendra, David Steurer, Yuan Zhou:
Finding Almost-Perfect Graph Bisections. ICS 2011: 321-337 - [c17]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer:
Subsampling Mathematical Relaxations and Average-case Complexity. SODA 2011: 512-531 - [i11]Boaz Barak, Prasad Raghavendra, David Steurer:
Rounding Semidefinite Programming Hierarchies via Global Correlation. CoRR abs/1104.4680 (2011) - [i10]Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the long code shorter, with applications to the Unique Games Conjecture. CoRR abs/1111.0405 (2011) - [i9]Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the long code shorter, with applications to the Unique Games Conjecture. Electron. Colloquium Comput. Complex. TR11 (2011) - [i8]Boaz Barak, Prasad Raghavendra, David Steurer:
Rounding Semidefinite Programming Hierarchies via Global Correlation. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c16]David Steurer:
Improved Rounding for Parallel Repeated Unique Games. APPROX-RANDOM 2010: 724-737 - [c15]Sanjeev Arora, Boaz Barak, David Steurer:
Subexponential Algorithms for Unique Games and Related Problems. FOCS 2010: 563-572 - [c14]David Steurer:
Fast SDP Algorithms for Constraint Satisfaction Problems. SODA 2010: 684-697 - [c13]Prasad Raghavendra, David Steurer, Prasad Tetali:
Approximations for the isoperimetric and spectral profile of graphs and related parameters. STOC 2010: 631-640 - [c12]Prasad Raghavendra, David Steurer:
Graph expansion and the unique games conjecture. STOC 2010: 755-764 - [i7]Prasad Raghavendra, David Steurer, Madhur Tulsiani:
Reductions Between Expansion Problems. CoRR abs/1011.2586 (2010) - [i6]Sanjeev Arora, Russell Impagliazzo, William Matthews, David Steurer:
Improved Algorithms for Unique Games via Divide and Conquer. Electron. Colloquium Comput. Complex. TR10 (2010) - [i5]Prasad Raghavendra, David Steurer, Madhur Tulsiani:
Reductions Between Expansion Problems. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c11]Prasad Raghavendra, David Steurer:
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES. FOCS 2009: 575-585 - [c10]Prasad Raghavendra, David Steurer:
How to Round Any CSP. FOCS 2009: 586-594 - [c9]Sanjeev Arora, David Steurer, Avi Wigderson:
Towards a Study of Low-Complexity Graphs. ICALP (1) 2009: 119-131 - [c8]Prasad Raghavendra, David Steurer:
Towards computing the Grothendieck constant. SODA 2009: 525-534 - [c7]Sanjeev Arora, Constantinos Daskalakis, David Steurer:
Message passing algorithms and improved LP decoding. STOC 2009: 3-12 - [i4]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer:
Subsampling Semidefinite Programs and Max-Cut on the Sphere. CoRR abs/0911.5526 (2009) - [i3]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer:
Subsampling Semidefinite Programs and Max-Cut on the Sphere. Electron. Colloquium Comput. Complex. TR09 (2009) - [i2]David Steurer, Nisheeth K. Vishnoi:
Connections Between Unique Games and Multicut. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j2]Peter Sanders, David Steurer:
An asymptotic approximation scheme for multigraph edge coloring. ACM Trans. Algorithms 4(2): 21:1-21:24 (2008) - [c6]Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer:
Rounding Parallel Repetitions of Unique Games. FOCS 2008: 374-383 - [c5]Markus Bläser, Moritz Hardt, David Steurer:
Asymptotically Optimal Hitting Sets Against Polynomials. ICALP (1) 2008: 345-356 - [c4]Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi:
Unique games on expanding constraint graphs are easy: extended abstract. STOC 2008: 21-28 - 2007
- [j1]Benjamin Doerr, Johannes Lengler, David Steurer:
The Interval Liar Game. Electron. Notes Discret. Math. 28: 425-432 (2007) - 2006
- [c3]Benjamin Doerr, Johannes Lengler, David Steurer:
The Interval Liar Game. ISAAC 2006: 318-327 - [c2]David Steurer:
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs. SPAA 2006: 197-206 - [i1]David Steurer:
Tight Bounds for the Min-Max Boundary Decomposition Cost of Weighted Graphs. CoRR abs/cs/0606001 (2006) - 2005
- [c1]Peter Sanders, David Steurer:
An asymptotic approximation scheme for multigraph edge coloring. SODA 2005: 897-906
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-08-20 20:31 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:
