default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYanjun Han
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c48]Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, Huacheng Yu:
On the Amortized Complexity of Approximate Counting. APPROX/RANDOM 2024: 33:1-33:17- [c47]Yanjun Han, Tianze Jiang, Yihong Wu:
Prediction from compression for models with infinite memory, with applications to hidden Markov and renewal processes. COLT 2024: 2270-2307 - [c46]Bing Xiong, Yuxin Tian, Changzheng Sun, Zhibiao Hao, Jian Wang, Lai Wang, Yanjun Han, Hongtao Li, Lin Gan, Yi Luo:
Ultra-Wide Bandwidth and High Saturation Power Uni-Traveling Carrier Photodiodes. OFC 2024: 1-3 - [i48]Yuxiao Wen, Yanjun Han, Zhengyuan Zhou:
Stochastic contextual bandits with graph feedback: from independence number to MAS number. CoRR abs/2402.18591 (2024) - [i47]Dylan J. Foster, Yanjun Han, Jian Qian, Alexander Rakhlin:
Online Estimation via Offline Estimation: An Information-Theoretic Framework. CoRR abs/2404.10122 (2024) - [i46]Yanjun Han, Tianze Jiang, Yihong Wu:
Prediction from compression for models with infinite memory, with applications to hidden Markov and renewal processes. CoRR abs/2404.15454 (2024) - [i45]Yanjun Han, Jonathan Niles-Weed:
Approximate independence of permutation mixtures. CoRR abs/2408.09341 (2024) - [i44]Fan Chen, Dylan J. Foster, Yanjun Han, Jian Qian, Alexander Rakhlin, Yunbei Xu:
Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability. CoRR abs/2410.05117 (2024) - 2023
- [j15]Yi Luo, Changzheng Sun, Bing Xiong, Jian Wang, Zhibiao Hao, Yanjun Han, Hongtao Li, Lai Wang:
High-speed optoelectronic devices. Sci. China Inf. Sci. 66(5) (2023) - [j14]Yanjun Han
, Soham Jana, Yihong Wu:
Optimal Prediction of Markov Chains With and Without Spectral Gap. IEEE Trans. Inf. Theory 69(6): 3920-3959 (2023) - [c45]Dylan J. Foster, Noah Golowich, Yanjun Han:
Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient. COLT 2023: 3969-4043 - [c44]Patrik R. Gerber, Yanjun Han, Yury Polyanskiy:
Minimax optimal testing by classification. COLT 2023: 5395-5432 - [c43]Simina Brânzei, Mahsa Derakhshan, Negin Golrezaei, Yanjun Han:
Learning and Collusion in Multi-unit Auctions. NeurIPS 2023 - [c42]Yuxin Tian, Bing Xiong, Changzheng Sun, Zhibiao Hao, Jian Wang, Lai Wang, Yanjun Han, Hongtao Li, Lin Gan, Yi Luo:
190 GHz Bandwidth Modified Uni-Traveling Carrier Photodiodes with High Saturation Power. OFC 2023: 1-3 - [i43]Dylan J. Foster, Noah Golowich, Yanjun Han:
Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient. CoRR abs/2301.08215 (2023) - [i42]Nived Rajaraman, Yanjun Han, Jiantao Jiao, Kannan Ramchandran:
Beyond UCB: Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits. CoRR abs/2302.06025 (2023) - [i41]Haoqiang Wang, Zihan Zang, Yunpeng Xu, Yanjun Han, Hongtao Li, Yi Luo:
B-spline freeform surface tailoring for prescribed irradiance based on differentiable ray-tracing. CoRR abs/2303.17108 (2023) - [i40]Simina Brânzei, Mahsa Derakhshan, Negin Golrezaei, Yanjun Han:
Online Learning in Multi-unit Auctions. CoRR abs/2305.17402 (2023) - [i39]Patrik Róbert Gerber, Yanjun Han, Yury Polyanskiy:
Minimax optimal testing by classification. CoRR abs/2306.11085 (2023) - [i38]Yanjun Han, Philippe Rigollet, George Stepaniants:
Covariance alignment: from maximum likelihood estimation to Gromov-Wasserstein. CoRR abs/2311.13595 (2023) - 2022
- [c41]Nika Haghtalab, Yanjun Han, Abhishek Shetty, Kunhe Yang:
Oracle-Efficient Online Learning for Smoothed Adversaries. NeurIPS 2022 - [c40]Yifei Wang, Tavor Z. Baharav, Yanjun Han, Jiantao Jiao, David Tse:
Beyond the Best: Distribution Functional Estimation in Infinite-Armed Bandits. NeurIPS 2022 - [c39]Wei Zhang, Yanjun Han, Zhengyuan Zhou, Aaron Flores, Tsachy Weissman:
Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions. NeurIPS 2022 - [c38]Xuecheng Liu, Hao Liu, Bing Xiong, Changzheng Sun, Zhibiao Hao, Lai Wang, Jian Wang, Yanjun Han, Hongtao Li, Yi Luo:
A Highly Compact Thin-film Lithium Niobate Modulator with Low Half-wave Voltage. OFC 2022: 1-3 - [c37]Hao Liu, Xuecheng Liu, Bing Xiong, Changzheng Sun, Zhibiao Hao, Lai Wang, Jian Wang, Yanjun Han, Hongtao Li, Yi Luo:
Millimeter-scale Meandered Thin-film Lithium Niobate Modulator with 0.72-\mathrm{V}\ \mathrm{V} \pi$. OECC/PSC 2022: 1-3 - [i37]Brian Axelrod, Shivam Garg, Yanjun Han, Vatsal Sharan, Gregory Valiant:
On the Statistical Complexity of Sample Amplification. CoRR abs/2201.04315 (2022) - [i36]Nika Haghtalab, Yanjun Han, Abhishek Shetty, Kunhe Yang:
Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries. CoRR abs/2202.08549 (2022) - [i35]Yifei Wang, Tavor Z. Baharav, Yanjun Han, Jiantao Jiao, David Tse:
Beyond the Best: Estimating Distribution Functionals in Infinite-Armed Bandits. CoRR abs/2211.01743 (2022) - [i34]Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, Huacheng Yu:
On the amortized complexity of approximate counting. CoRR abs/2211.03917 (2022) - [i33]Wei Zhang, Yanjun Han, Zhengyuan Zhou, Aaron Flores, Tsachy Weissman:
Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions. CoRR abs/2211.06358 (2022) - 2021
- [j13]Yanjun Han, Kedar Tatwawadi, Gowtham R. Kurri, Zhengqing Zhou, Vinod M. Prabhakaran, Tsachy Weissman:
Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation. IEEE Trans. Inf. Theory 67(12): 7723-7739 (2021) - [j12]Yanjun Han, Ayfer Özgür, Tsachy Weissman:
Geometric Lower Bounds for Distributed Parameter Estimation Under Communication Constraints. IEEE Trans. Inf. Theory 67(12): 8248-8263 (2021) - [c36]Yanjun Han:
On the High Accuracy Limitation of Adaptive Property Estimation. AISTATS 2021: 910-918 - [c35]Yanjun Han, Yining Wang, Xi Chen:
Adversarial Combinatorial Bandits with General Non-linear Reward Functions. ICML 2021: 4030-4039 - [c34]Yanjun Han, Kedar Tatwawadi, Gowtham R. Kurri, Zhengqing Zhou, Vinod M. Prabhakaran, Tsachy Weissman:
Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation. ISIT 2021: 1931-1936 - [c33]Wei Zhang, Brendan Kitts, Yanjun Han, Zhengyuan Zhou, Tingyu Mao, Hao He, Shengjun Pan, Aaron Flores, San Gultekin, Tsachy Weissman:
MEOW: A Space-Efficient Nonparametric Bid Shading Algorithm. KDD 2021: 3928-3936 - [c32]Nived Rajaraman, Yanjun Han, Lin Yang, Jingbo Liu, Jiantao Jiao, Kannan Ramchandran:
On the Value of Interaction and Function Approximation in Imitation Learning. NeurIPS 2021: 1325-1336 - [c31]Yanjun Han, Soham Jana, Yihong Wu:
Optimal prediction of Markov chains with and without spectral gap. NeurIPS 2021: 11233-11246 - [c30]Xuecheng Liu, Bing Xiong, Changzheng Sun, Zhibiao Hao, Lai Wang, Jian Wang, Yanjun Han, Hongtao Li, Jiadong Yu, Yi Luo:
Ultra-wide Bandwidth Thin-film LiNbO3 Modulator with Record-Low Half-wave-voltage Length Product. OFC 2021: 1-3 - [c29]Yanjun Han, Kirankumar Shiragur:
On the Competitive Analysis and High Accuracy Optimality of Profile Maximum Likelihood. SODA 2021: 1317-1336 - [i32]Xi Chen, Yanjun Han, Yining Wang:
Adversarial Combinatorial Bandits with General Non-linear Reward Functions. CoRR abs/2101.01301 (2021) - [i31]Nived Rajaraman, Yanjun Han, Lin F. Yang, Kannan Ramchandran, Jiantao Jiao:
Provably Breaking the Quadratic Error Compounding Barrier in Imitation Learning, Optimally. CoRR abs/2102.12948 (2021) - 2020
- [j11]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Minimax Estimation of Divergences Between Discrete Distributions. IEEE J. Sel. Areas Inf. Theory 1(3): 814-823 (2020) - [j10]Jiantao Jiao, Yanjun Han:
Bias Correction With Jackknife, Bootstrap, and Taylor Series. IEEE Trans. Inf. Theory 66(7): 4392-4418 (2020) - [c28]Jayadev Acharya, Clément L. Canonne, Yanjun Han, Ziteng Sun, Himanshu Tyagi:
Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit. COLT 2020: 3-40 - [c27]Yanjun Han:
Constrained Functional Value under General Convexity Conditions with Applications to Distributed Simulation. ISIT 2020: 2199-2204 - [c26]Zijun Gao, Yanjun Han:
Minimax Optimal Nonparametric Estimation of Heterogeneous Treatment Effects. NeurIPS 2020 - [i30]Yanjun Han:
Constrained Functional Value under General Convexity Conditions with Applications to Distributed Simulation. CoRR abs/2001.06085 (2020) - [i29]Yanjun Han, Zhengyuan Zhou, Tsachy Weissman:
Optimal No-regret Learning in Repeated First-price Auctions. CoRR abs/2003.09795 (2020) - [i28]Yanjun Han, Kirankumar Shiragur:
The Optimality of Profile Maximum Likelihood in Estimating Sorted Discrete Distributions. CoRR abs/2004.03166 (2020) - [i27]Yanjun Han, Zhengqing Zhou, Zhengyuan Zhou, Jose H. Blanchet, Peter W. Glynn, Yinyu Ye:
Sequential Batch Learning in Finite-Action Linear Contextual Bandits. CoRR abs/2004.06321 (2020) - [i26]Yanjun Han, Zhengyuan Zhou, Aaron Flores, Erik Ordentlich, Tsachy Weissman:
Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions. CoRR abs/2007.04568 (2020) - [i25]Yanjun Han:
On the High Accuracy Limitation of Adaptive Property Estimation. CoRR abs/2008.11964 (2020)
2010 – 2019
- 2019
- [j9]Jiantao Jiao, Yanjun Han, Irena Fischer-Hwang, Tsachy Weissman:
Estimating the Fundamental Limits is Easier Than Achieving the Fundamental Limits. IEEE Trans. Inf. Theory 65(10): 6704-6715 (2019) - [c25]Leighton Pate Barnes, Yanjun Han, Ayfer Özgür:
Fisher Information for Distributed Estimation under a Blackboard Communication Protocol. ISIT 2019: 2704-2708 - [c24]Zijun Gao, Yanjun Han, Zhimei Ren, Zhengqing Zhou:
Batched Multi-armed Bandits Problem. NeurIPS 2019: 501-511 - [i24]Leighton Pate Barnes, Yanjun Han, Ayfer Özgür:
Learning Distributions from their Samples under Communication Constraints. CoRR abs/1902.02890 (2019) - [i23]Zijun Gao, Yanjun Han, Zhimei Ren, Zhengqing Zhou:
Batched Multi-armed Bandits Problem. CoRR abs/1904.01763 (2019) - [i22]Yanjun Han, Kedar Tatwawadi, Zhengqing Zhou, Gowtham R. Kurri, Vinod M. Prabhakaran, Tsachy Weissman:
Optimal Communication Rates for Zero-Error Distributed Simulation under Blackboard Communication Protocols. CoRR abs/1904.03271 (2019) - [i21]Jayadev Acharya, Clément L. Canonne, Yanjun Han, Ziteng Sun, Himanshu Tyagi:
Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit. CoRR abs/1907.08743 (2019) - [i20]Jayadev Acharya, Clément L. Canonne, Yanjun Han, Ziteng Sun, Himanshu Tyagi:
Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j8]Jiantao Jiao, Yanjun Han, Tsachy Weissman:
Minimax Estimation of the L1 Distance. IEEE Trans. Inf. Theory 64(10): 6672-6706 (2018) - [c23]Leighton Pate Barnes, Yanjun Han, Ayfer Özgür:
A Geometric Characterization of Fisher Information from Quantized Samples with Applications to Distributed Statistical Estimation. Allerton 2018: 16-23 - [c22]Yanjun Han, Ayfer Özgür, Tsachy Weissman:
Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraints. COLT 2018: 3163-3188 - [c21]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Local moment matching: A unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance. COLT 2018: 3189-3221 - [c20]Yanjun Han, Pritam Mukherjee, Ayfer Özgür, Tsachy Weissman:
Distributed Statistical Estimation of High-Dimensional and Nonparametric Distributions. ISIT 2018: 506-510 - [c19]Jiantao Jiao, Weihao Gao, Yanjun Han:
The Nearest Neighbor Information Estimator is Adaptively Near Minimax Rate-Optimal. NeurIPS 2018: 3160-3171 - [c18]Yanjun Han, Jiantao Jiao, Chuan-Zheng Lee, Tsachy Weissman, Yihong Wu, Tiancheng Yu:
Entropy Rate Estimation for Markov Chains with Large State Space. NeurIPS 2018: 9803-9814 - [i19]Yanjun Han, Jiantao Jiao, Chuan-Zheng Lee, Tsachy Weissman, Yihong Wu, Tiancheng Yu:
Entropy Rate Estimation for Markov Chains with Large State Space. CoRR abs/1802.07889 (2018) - [i18]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Local moment matching: A unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance. CoRR abs/1802.08405 (2018) - [i17]Yanjun Han, Ayfer Özgür, Tsachy Weissman:
Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraints. CoRR abs/1802.08417 (2018) - [i16]Yanjun Han, Guanyang Wang:
Expectation of the Largest Betting Size in Labouchère System. CoRR abs/1807.11729 (2018) - 2017
- [j7]Jiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman:
Maximum Likelihood Estimation of Functionals of Discrete Distributions. IEEE Trans. Inf. Theory 63(10): 6774-6798 (2017) - [c17]Jiantao Jiao, Yanjun Han, Tsachy Weissman:
Dependence measures bounding the exploration bias for general measurements. ISIT 2017: 1475-1479 - [i15]Jiantao Jiao, Yanjun Han, Tsachy Weissman:
Minimax Estimation of the $L_1$ Distance. CoRR abs/1705.00807 (2017) - [i14]Jiantao Jiao, Yanjun Han, Irena Fischer-Hwang, Tsachy Weissman:
Estimating the Fundamental Limits is Easier than Achieving the Fundamental Limits. CoRR abs/1707.01203 (2017) - [i13]Jiantao Jiao, Yanjun Han, Tsachy Weissman:
Bias Correction with Jackknife, Bootstrap, and Taylor Series. CoRR abs/1709.06183 (2017) - [i12]Yanjun Han, Jiantao Jiao, Rajarshi Mukherjee, Tsachy Weissman:
On Estimation of L{r}-Norms in Gaussian White Noise Models. CoRR abs/1710.03863 (2017) - [i11]Yanjun Han, Jiantao Jiao, Tsachy Weissman, Yihong Wu:
Optimal rates of entropy estimation over Lipschitz balls. CoRR abs/1711.02141 (2017) - [i10]Jiantao Jiao, Weihao Gao, Yanjun Han:
The Nearest Neighbor Information Estimator is Adaptively Near Minimax Rate-Optimal. CoRR abs/1711.08824 (2017) - 2016
- [j6]Yanjun Han, Yuan Shen, Xiao-Ping Zhang, Moe Z. Win, Huadong Meng:
Performance Limits and Geometric Properties of Array Localization. IEEE Trans. Inf. Theory 62(2): 1054-1075 (2016) - [j5]Yanjun Han, Or Ordentlich, Ofer Shayevitz:
Mutual Information Bounds via Adjacency Events. IEEE Trans. Inf. Theory 62(11): 6068-6080 (2016) - [c16]Jiantao Jiao, Yanjun Han, Tsachy Weissman:
Beyond maximum likelihood: Boosting the Chow-Liu algorithm for large alphabets. ACSSC 2016: 321-325 - [c15]Jiantao Jiao, Yanjun Han, Tsachy Weissman:
Minimax estimation of the L1 distance. ISIT 2016: 750-754 - [c14]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Minimax rate-optimal estimation of KL divergence between discrete distributions. ISITA 2016: 256-260 - [i9]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Minimax Estimation of KL Divergence between Discrete Distributions. CoRR abs/1605.09124 (2016) - [i8]Sihan Li, Jiantao Jiao, Yanjun Han, Tsachy Weissman:
Demystifying ResNet. CoRR abs/1611.01186 (2016) - [i7]Jiantao Jiao, Yanjun Han, Tsachy Weissman:
Dependence Measures Bounding the Exploration Bias for General Measurements. CoRR abs/1612.05845 (2016) - 2015
- [j4]Jiayi Zhang, Linglong Dai, Yanjun Han, Yu Zhang, Zhaocheng Wang:
On the Ergodic Capacity of MIMO Free-Space Optical Systems Over Turbulence Channels. IEEE J. Sel. Areas Commun. 33(9): 1925-1934 (2015) - [j3]Jiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman:
Minimax Estimation of Functionals of Discrete Distributions. IEEE Trans. Inf. Theory 61(5): 2835-2885 (2015) - [j2]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Minimax Estimation of Discrete Distributions Under ℓ1 Loss. IEEE Trans. Inf. Theory 61(11): 6343-6354 (2015) - [c13]Jiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman:
Maximum Likelihood Estimation of information measures. ISIT 2015: 839-843 - [c12]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Does dirichlet prior smoothing solve the Shannon entropy estimation problem? ISIT 2015: 1367-1371 - [c11]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Adaptive estimation of Shannon entropy. ISIT 2015: 1372-1376 - [c10]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Minimax estimation of discrete distributions. ISIT 2015: 2291-2295 - [c9]Jiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman:
Minimax estimation of information measures. ISIT 2015: 2296-2300 - [i6]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Adaptive Estimation of Shannon Entropy. CoRR abs/1502.00326 (2015) - [i5]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Does Dirichlet Prior Smoothing Solve the Shannon Entropy Estimation Problem? CoRR abs/1502.00327 (2015) - [i4]Jiayi Zhang, Linglong Dai, Yanjun Han, Yu Zhang, Zhaocheng Wang:
On the Ergodic Capacity of MIMO Free-Space Optical Systems over Turbulence Channels. CoRR abs/1505.00953 (2015) - 2014
- [c8]Zhenkai Fan, Zhaohua Lu, Yanjun Han:
Accurate channel estimation based on Bayesian Compressive Sensing for next-generation wireless broadcasting systems. BMSB 2014: 1-5 - [c7]Xinyu Gao, Zhaohua Lu, Yanjun Han, Jiaqi Ning:
Near-optimal signal detection with low complexity based on Gauss-Seidel method for uplink large-scale MIMO systems. BMSB 2014: 1-4 - [c6]Yanjun Han, Peiyao Zhao, Lingzhi Sui, Zhenkai Fan:
Time-varying channel estimation based on dynamic compressive sensing for OFDM systems. BMSB 2014: 1-5 - [c5]Yanjun Han, Huadong Meng, Yuan Shen, Yimin Liu:
Fundamental localization accuracy in narrowband array-based systems. ICASSP 2014: 4668-4672 - [i3]Yanjun Han, Huadong Meng, Yuan Shen, Xiao-Ping Zhang:
Performance Limits and Geometric Properties of Narrowband Array Localization. CoRR abs/1405.4372 (2014) - [i2]Jiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman:
Beyond Maximum Likelihood: from Theory to Practice. CoRR abs/1409.7458 (2014) - [i1]Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Minimax Estimation of Discrete Distributions under ℓ1 Loss. CoRR abs/1411.1467 (2014) - 2012
- [j1]Chunjie Zhang, Jing Liu, Qi Tian, Yanjun Han, Hanqing Lu, Songde Ma:
A Boosting, Sparsity- Constrained Bilinear Model for Object Recognition. IEEE Multim. 19(2): 58-68 (2012) - 2011
- [c4]Liang Chang, Mingquan Zhou, Xiaoming Deng, Zhongke Wu, Yanjun Han:
Face Sketch Synthesis via Multivariate Output Regression. HCI (1) 2011: 555-561 - 2010
- [c3]Liang Chang, Mingquan Zhou, Yanjun Han, Xiaoming Deng:
Face Sketch Synthesis via Sparse Representation. ICPR 2010: 2146-2149 - [c2]Yanjun Han, Qing Tao, Jue Wang:
Avoiding False Positive in Multi-Instance Learning. NIPS 2010: 811-819
2000 – 2009
- 2009
- [c1]Yanjun Han, Jue Wang:
An l1 Regularization Framework for Optimal Rule Combination. ECML/PKDD (1) 2009: 501-516
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-11-19 21:46 CET 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:
