default search action
Han Cai
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
- [b1]Han Cai:
Model Acceleration for Efficient Deep Learning Computing. MIT, USA, 2024 - [j33]Xiaopan Han, Guojun Han, Han Cai, Linxin Yin:
Locally repairable codes with multiple repair sets based on packings of block size 4. Cryptogr. Commun. 16(3): 459-479 (2024) - [j32]Xing Lin
, Han Cai
On singleton-type bound of locally repairable codes. Discret. Math. 347(7): 113987 (2024) - [j31]Han Deng
An Efficient Coding Scheme for the AWGN Relay Network With Receiver-Transmitter Feedback. IEEE Syst. J. 18(3): 1717-1728 (2024) - [j30]Yajuan Liu
Minimum Storage Partially Cooperative Regenerating Codes With Small Sub-Packetization. IEEE Trans. Commun. 72(1): 38-49 (2024) - [c43]Muyang Li, Tianle Cai, Jiaxin Cao, Qinsheng Zhang, Han Cai, Junjie Bai, Yangqing Jia, Kai Li, Song Han:
DistriFusion: Distributed Parallel Inference for High-Resolution Diffusion Models. CVPR 2024: 7183-7193 - [c42]Han Cai, Muyang Li, Qinsheng Zhang, Ming-Yu Liu, Song Han:
Condition-Aware Neural Network for Controlled Image Generation. CVPR 2024: 7194-7203 - [c41]Zhuoyang Zhang, Han Cai, Song Han:
EfficientViT-SAM: Accelerated Segment Anything Model Without Performance Loss. CVPR Workshops 2024: 7859-7863 - [c40]Jeremie Houssineau, Chenbao Xue, Han Cai, Murat Uney, Emmanuel Delande:
Decentralised multi-sensor target tracking with limited field of view via possibility theory. FUSION 2024: 1-8 - [c39]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
Repairing Schemes for Tamo-Barg Codes. ISIT 2024: 2140-2145 - [c38]Yumeng Yang, Han Cai, Xiaohu Tang:
Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth Under the Rack-Aware Storage Model. ISIT 2024: 2341-2346 - [i37]Han Cai
Robust Multi-Sensor Multi-Target Tracking Using Possibility Labeled Multi-Bernoulli Filter. CoRR abs/2401.10269 (2024) - [i36]Yumeng Yang, Han Cai, Xiaohu Tang:
A Transformation of Repairing Reed-Solomon Codes from Rack-Aware Storage Model to Homogeneous Storage Model. CoRR abs/2401.11390 (2024) - [i35]Yumeng Yang, Han Cai, Xiaohu Tang:
Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth under the Rack-Aware Storage Model. CoRR abs/2401.15308 (2024) - [i34]Zhuoyang Zhang, Han Cai, Song Han:
EfficientViT-SAM: Accelerated Segment Anything Model Without Performance Loss. CoRR abs/2402.05008 (2024) - [i33]Muyang Li, Tianle Cai, Jiaxin Cao, Qinsheng Zhang, Han Cai, Junjie Bai, Yangqing Jia, Ming-Yu Liu, Kai Li, Song Han:
DistriFusion: Distributed Parallel Inference for High-Resolution Diffusion Models. CoRR abs/2402.19481 (2024) - [i32]Han Cai, Muyang Li, Zhuoyang Zhang, Qinsheng Zhang, Ming-Yu Liu, Song Han:
Condition-Aware Neural Network for Controlled Image Generation. CoRR abs/2404.01143 (2024) - [i31]Songping Ge, Han Cai, Xiaohu Tang:
MDS Generalized Convertible Code. CoRR abs/2407.14304 (2024) - 2023
- [j29]Han Cai
Possibility Generalized Labeled Multi-Bernoulli Filter for Multitarget Tracking Under Epistemic Uncertainty. IEEE Trans. Aerosp. Electron. Syst. 59(2): 1312-1326 (2023) - [j28]Han Cai
A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It. IEEE Trans. Inf. Theory 69(4): 2240-2260 (2023) - [j27]Yajuan Liu
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization. IEEE Trans. Inf. Theory 69(5): 2820-2829 (2023) - [c37]Yajuan Liu, Han Cai, Xiaohu Tang:
A Cooperative Repair Scheme for MSR Codes with Two Erasures and Small Finite Field. ICCT 2023: 37-43 - [c36]Han Cai, Junyan Li, Muyan Hu, Chuang Gan, Song Han:
EfficientViT: Lightweight Multi-Scale Attention for High-Resolution Dense Prediction. ICCV 2023: 17256-17267 - [i30]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
Repairing Schemes for Tamo-Barg Codes. CoRR abs/2312.12803 (2023) - 2022
- [j26]Xing Lin
A class of minimum storage cooperative regenerating codes with low access property. Adv. Math. Commun. 16(4): 879-892 (2022) - [j25]Han Cai
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size. IEEE Trans. Inf. Theory 68(1): 204-212 (2022) - [j24]Han Cai
Optimal Locally Repairable Codes: An Improved Bound and Constructions. IEEE Trans. Inf. Theory 68(8): 5060-5074 (2022) - [j23]Han Cai, Ji Lin, Yujun Lin, Zhijian Liu, Haotian Tang, Hanrui Wang, Ligeng Zhu, Song Han:
Enable Deep Learning on Mobile Devices: Methods, Systems, and Applications. ACM Trans. Design Autom. Electr. Syst. 27(3): 20:1-20:50 (2022) - [c35]Yihan Wang, Muyang Li, Han Cai, Wei-Ming Chen, Song Han:
Lite Pose: Efficient Architecture Design for 2D Human Pose Estimation. CVPR 2022: 13116-13126 - [c34]Han Cai, Chuang Gan, Ji Lin, Song Han:
Network Augmentation for Tiny Deep Learning. ICLR 2022 - [c33]Han Cai, Moshe Schwartz:
A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It. ISIT 2022: 2625-2630 - [i29]Han Cai, Moshe Schwartz:
A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It. CoRR abs/2201.00344 (2022) - [i28]Yajuan Liu, Han Cai, Xiaohu Tang:
A New Cooperative Repair Scheme with k + 1 Helper Nodes for (n, k) Hadamard MSR codes with Small Sub-packetization. CoRR abs/2201.06231 (2022) - [i27]Xing Lin, Han Cai, Xiaohu Tang:
A Class of Minimum Storage Cooperative Regenerating Codes with Low Access Property. CoRR abs/2201.06236 (2022) - [i26]Han Cai, Ji Lin, Yujun Lin, Zhijian Liu, Haotian Tang, Hanrui Wang, Ligeng Zhu, Song Han:
Enable Deep Learning on Mobile Devices: Methods, Systems, and Applications. CoRR abs/2204.11786 (2022) - [i25]Yihan Wang, Muyang Li, Han Cai, Wei-Ming Chen, Song Han:
Lite Pose: Efficient Architecture Design for 2D Human Pose Estimation. CoRR abs/2205.01271 (2022) - [i24]Han Cai, Chuang Gan, Song Han:
EfficientViT: Enhanced Linear Attention for High-Resolution Low-Computation Visual Recognition. CoRR abs/2205.14756 (2022) - 2021
- [j22]Han Cai
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes. IEEE Trans. Inf. Theory 67(2): 686-704 (2021) - [c32]Xiao Hu, Ming-Ching Chang, Yuwei Chen, Rahul Sridhar, Zhenyu Hu
The 2020 Low-Power Computer Vision Challenge. AICAS 2021: 1-4 - [c31]Han Cai, Cuiling Fan, Ying Miao, Moshe Schwartz, Xiaohu Tang:
An Improved Bound for Optimal Locally Repairable Codes. ISIT 2021: 3379-3384 - [c30]Ji Lin, Wei-Ming Chen, Han Cai, Chuang Gan, Song Han:
Memory-efficient Patch-based Inference for Tiny Deep Learning. NeurIPS 2021: 2346-2358 - [i23]Han Cai, Chuang Gan, Ji Lin, Song Han:
Network Augmentation for Tiny Deep Learning. CoRR abs/2110.08890 (2021) - [i22]Ji Lin, Wei-Ming Chen, Han Cai, Chuang Gan, Song Han:
MCUNetV2: Memory-Efficient Patch-based Inference for Tiny Deep Learning. CoRR abs/2110.15352 (2021) - 2020
- [j21]Han Cai, Ji Lin, Yujun Lin
AutoML for Architecting Efficient and Specialized Neural Networks. IEEE Micro 40(1): 75-82 (2020) - [j20]Han Cai
On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets. IEEE Trans. Inf. Theory 66(4): 2402-2416 (2020) - [j19]Han Cai
On Optimal Locally Repairable Codes With Super-Linear Length. IEEE Trans. Inf. Theory 66(8): 4853-4868 (2020) - [j18]Han Cai
Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks. IEEE Trans. Inf. Theory 66(11): 6786-6798 (2020) - [c29]Hanrui Wang, Zhanghao Wu, Zhijian Liu, Han Cai, Ligeng Zhu, Chuang Gan, Song Han:
HAT: Hardware-Aware Transformers for Efficient Natural Language Processing. ACL 2020: 7675-7688 - [c28]Tianzhe Wang, Kuan Wang, Han Cai, Ji Lin, Zhijian Liu, Hanrui Wang, Yujun Lin
APQ: Joint Search for Network Architecture, Pruning and Quantization Policy. CVPR 2020: 2075-2084 - [c27]Han Cai, Chuang Gan, Tianzhe Wang, Zhekai Zhang, Song Han:
Once-for-All: Train One Network and Specialize it for Efficient Deployment. ICLR 2020 - [c26]Han Cai, Moshe Schwartz:
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes. ISIT 2020: 571-576 - [c25]Han Cai, Chuang Gan, Ligeng Zhu, Song Han:
TinyTL: Reduce Memory, Not Parameters for Efficient On-Device Learning. NeurIPS 2020 - [i21]Han Cai, Moshe Schwartz:
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes. CoRR abs/2001.02909 (2020) - [i20]Hanrui Wang, Zhanghao Wu, Zhijian Liu, Han Cai, Ligeng Zhu, Chuang Gan, Song Han:
HAT: Hardware-Aware Transformers for Efficient Natural Language Processing. CoRR abs/2005.14187 (2020) - [i19]Tianzhe Wang, Kuan Wang, Han Cai, Ji Lin, Zhijian Liu, Song Han:
APQ: Joint Search for Network Architecture, Pruning and Quantization Policy. CoRR abs/2006.08509 (2020) - [i18]Han Cai, Chuang Gan, Ligeng Zhu, Song Han:
Tiny Transfer Learning: Towards Memory-Efficient On-Device Learning. CoRR abs/2007.11622 (2020) - [i17]Han Cai, Cuiling Fan, Ying Miao, Moshe Schwartz, Xiaohu Tang:
Optimal Locally Repairable Codes: An Improved Bound and Constructions. CoRR abs/2011.04966 (2020) - [i16]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
A Construction of Maximally Recoverable Codes with Order-Optimal Field Size. CoRR abs/2011.13606 (2020)
2010 – 2019
- 2019
- [j17]Haifeng Zhang
Layout Design for Intelligent Warehouse by Evolution With Fitness Approximation. IEEE Access 7: 166310-166317 (2019) - [j16]Han Cai
Optimal Locally Repairable Systematic Codes Based on Packings. IEEE Trans. Commun. 67(1): 39-49 (2019) - [c24]Haokun Chen, Xinyi Dai, Han Cai, Weinan Zhang, Xuejian Wang, Ruiming Tang, Yuzhou Zhang, Yong Yu:
Large-Scale Interactive Recommendation with Tree-Structured Policy Gradient. AAAI 2019: 3312-3320 - [c23]Yang Yang, Han Cai, Baichun Gong, Robert J. Norman:
Schmidt-Kalman Filter with Polynomial Chaos Expansion for State Estimation. FUSION 2019: 1-8 - [c22]Han Cai, Tianzhe Wang, Zhanghao Wu, Kuan Wang, Ji Lin, Song Han:
On-Device Image Classification with Proxyless Neural Architecture Search and Quantization-Aware Fine-Tuning. ICCV Workshops 2019: 2509-2513 - [c21]Han Cai, Ligeng Zhu, Song Han:
ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardware. ICLR (Poster) 2019 - [c20]Han Cai, Tuvi Etzion, Moshe Schwartz, Antonia Wachter-Zeh:
Network Coding Solutions for the Combination Network and its Subgraphs. ISIT 2019: 862-866 - [c19]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
On Optimal Locally Repairable Codes with Super-Linear Length. ISIT 2019: 2818-2822 - [i15]Han Cai, Tuvi Etzion, Moshe Schwartz, Antonia Wachter-Zeh:
Network Coding Solutions for the Combination Network and its Subgraphs. CoRR abs/1901.01058 (2019) - [i14]Song Han, Han Cai, Ligeng Zhu, Ji Lin, Kuan Wang, Zhijian Liu, Yujun Lin:
Design Automation for Efficient Deep Learning Computing. CoRR abs/1904.10616 (2019) - [i13]Han Cai, Chuang Gan, Song Han:
Once for All: Train One Network and Specialize it for Efficient Deployment. CoRR abs/1908.09791 (2019) - 2018
- [j15]Andong Hu
Improvement of Reflection Detection Success Rate of GNSS RO Measurements Using Artificial Neural Network. IEEE Trans. Geosci. Remote. Sens. 56(2): 760-769 (2018) - [c18]Han Cai, Tianyao Chen, Weinan Zhang, Yong Yu, Jun Wang:
Efficient Architecture Search by Network Transformation. AAAI 2018: 2787-2794 - [c17]Jiaxian Guo, Sidi Lu, Han Cai, Weinan Zhang, Yong Yu, Jun Wang:
Long Text Generation via Adversarial Training with Leaked Information. AAAI 2018: 5141-5148 - [c16]Lianmin Zheng, Jiacheng Yang
MAgent: A Many-Agent Reinforcement Learning Platform for Artificial Collective Intelligence. AAAI 2018: 8222-8223 - [c15]Zhiming Zhou, Han Cai, Shu Rong, Yuxuan Song, Kan Ren, Weinan Zhang, Jun Wang, Yong Yu:
Activation Maximization Generative Adversarial Nets. ICLR (Poster) 2018 - [c14]Han Cai, Jiacheng Yang, Weinan Zhang, Song Han, Yong Yu:
Path-Level Network Transformation for Efficient Architecture Search. ICML 2018: 677-686 - [i12]Han Cai, Jiacheng Yang, Weinan Zhang, Song Han, Yong Yu:
Path-Level Network Transformation for Efficient Architecture Search. CoRR abs/1806.02639 (2018) - [i11]Haifeng Zhang, Zilong Guo, Han Cai, Chris Wang, Weinan Zhang, Yong Yu, Wenxin Li, Jun Wang:
Layout Design for Intelligent Warehouse by Evolution with Fitness Approximation. CoRR abs/1811.05685 (2018) - [i10]Haokun Chen, Xinyi Dai, Han Cai, Weinan Zhang, Xuejian Wang, Ruiming Tang, Yuzhou Zhang, Yong Yu:
Large-scale Interactive Recommendation with Tree-structured Policy Gradient. CoRR abs/1811.05869 (2018) - [i9]Han Cai, Ligeng Zhu, Song Han:
ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardware. CoRR abs/1812.00332 (2018) - [i8]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
On Optimal Locally Repairable Codes with Super-Linear Length. CoRR abs/1812.11942 (2018) - 2017
- [j14]Han Cai
Zero-Difference Balanced Functions With New Parameters and Their Applications. IEEE Trans. Inf. Theory 63(7): 4379-4387 (2017) - [c13]Yuxuan Song, Kan Ren, Han Cai, Weinan Zhang, Yong Yu:
Volume Ranking and Sequential Selection in Programmatic Display Advertising. CIKM 2017: 1099-1107 - [c12]Han Cai, Kan Ren, Weinan Zhang, Kleanthis Malialis
Real-Time Bidding by Reinforcement Learning in Display Advertising. WSDM 2017: 661-670 - [i7]Han Cai, Kan Ren, Weinan Zhang, Kleanthis Malialis, Jun Wang, Yong Yu, Defeng Guo:
Real-Time Bidding by Reinforcement Learning in Display Advertising. CoRR abs/1701.02490 (2017) - [i6]Zhiming Zhou, Shu Rong, Han Cai, Weinan Zhang, Yong Yu, Jun Wang:
Generative Adversarial Nets with Labeled Data by Activation Maximization. CoRR abs/1703.02000 (2017) - [i5]Han Cai, Tianyao Chen, Weinan Zhang, Yong Yu, Jun Wang:
Reinforcement Learning for Architecture Search by Network Transformation. CoRR abs/1707.04873 (2017) - [i4]Jiaxian Guo, Sidi Lu, Han Cai, Weinan Zhang, Yong Yu, Jun Wang:
Long Text Generation via Adversarial Training with Leaked Information. CoRR abs/1709.08624 (2017) - [i3]Lianmin Zheng, Jiacheng Yang, Han Cai, Weinan Zhang, Jun Wang, Yong Yu:
MAgent: A Many-Agent Reinforcement Learning Platform for Artificial Collective Intelligence. CoRR abs/1712.00600 (2017) - 2016
- [j13]Han Cai
Strictly Optimal Frequency-Hopping Sequence Sets With Optimal Family Sizes. IEEE Trans. Inf. Theory 62(2): 1087-1093 (2016) - [j12]Cuiling Fan, Han Cai
A Combinatorial Construction for Strictly Optimal Frequency-Hopping Sequences. IEEE Trans. Inf. Theory 62(8): 4769-4774 (2016) - [j11]Han Cai, Irem Koprulu, Ness B. Shroff:
Exploiting Double Opportunities for Latency-Constrained Content Propagation in Wireless Networks. IEEE/ACM Trans. Netw. 24(2): 1025-1037 (2016) - [c11]Yanru Qu, Han Cai, Kan Ren, Weinan Zhang, Yong Yu, Ying Wen, Jun Wang:
Product-Based Neural Networks for User Response Prediction. ICDM 2016: 1149-1154 - [i2]Han Cai, Minquan Cheng, Cuiling Fan, Xiaohu Tang:
Optimal Locally Repairable Systematic Codes Based on Packings. CoRR abs/1607.01537 (2016) - [i1]Yanru Qu, Han Cai, Kan Ren, Weinan Zhang, Yong Yu, Ying Wen, Jun Wang:
Product-based Neural Networks for User Response Prediction. CoRR abs/1611.00144 (2016) - 2015
- [j10]Han Cai
Constructions of Optimal 2-D Optical Orthogonal Codes via Generalized Cyclotomic Classes. IEEE Trans. Inf. Theory 61(1): 688-695 (2015) - 2014
- [j9]Han Cai
Families of p-ary sequences with low correlation and large linear complexity. J. Syst. Sci. Complex. 27(6): 1305-1319 (2014) - [j8]Han Cai
A New Construction of Frequency-Hopping Sequences With Optimal Partial Hamming Correlation. IEEE Trans. Inf. Theory 60(9): 5782-5790 (2014) - 2013
- [j7]Han Cai
New Optimal frequency Hopping sequence Sets from Balanced Nested difference Packings of Partition-Type. Int. J. Found. Comput. Sci. 24(4): 533- (2013) - [j6]Xiangyong Zeng, Han Cai
Optimal Frequency Hopping Sequences of Odd Length. IEEE Trans. Inf. Theory 59(5): 3237-3248 (2013) - [j5]Han Cai
A New Construction of Zero-Difference Balanced Functions and Its Applications. IEEE Trans. Inf. Theory 59(8): 5008-5015 (2013) - [c10]Han Cai, Irem Koprulu, Ness B. Shroff:
Exploiting double opportunities for deadline based content propagation in wireless networks. INFOCOM 2013: 764-772 - 2012
- [j4]Xiangyong Zeng, Han Cai
A Class of Optimal Frequency Hopping Sequences with New Parameters. IEEE Trans. Inf. Theory 58(7): 4899-4907 (2012)
2000 – 2009
- 2009
- [j3]Han Cai, Do Young Eun
Stochastic convex ordering for multiplicative decrease internet congestion control. Comput. Networks 53(3): 365-381 (2009) - [j2]Han Cai, Do Young Eun:
Crossing over the bounded domain: from exponential to power-law intermeeting time in mobile ad hoc networks. IEEE/ACM Trans. Netw. 17(5): 1578-1591 (2009) - [j1]Hyungsuk Won, Han Cai, Do Young Eun
Multicast scheduling in cellular data networks. IEEE Trans. Wirel. Commun. 8(9): 4540-4549 (2009) - [c9]Han Cai, Do Young Eun
Aging rules: what does the past tell about the future in mobile ad-hoc networks? MobiHoc 2009: 115-124 - [c8]Han Cai, Do Young Eun
Stochastic link-level dynamics in mobile ad-hoc networks: several interesting aspects. S³@MobiHoc 2009: 17-20 - 2008
- [c7]Han Cai, Chul-Ho Lee, Do Young Eun
Invariance Property of Isotropic Random Walk Mobility Patterns in Mobile Ad-Hoc Networks. ICC 2008: 2141-2145 - [c6]Han Cai, Do Young Eun
Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization. ICC 2008: 2931-2935 - [c5]Han Cai, Do Young Eun
Toward stochastic anatomy of inter-meeting time distribution under general mobility models. MobiHoc 2008: 273-282 - 2007
- [c4]Han Cai, Do Young Eun
Stochastic Ordering for Internet Congestion Control and its Applications. INFOCOM 2007: 910-918 - [c3]Hyungsuk Won, Han Cai, Do Young Eun
Multicast Scheduling in Cellular Data Networks. INFOCOM 2007: 1172-1180 - [c2]Han Cai, Do Young Eun
Crossing over the bounded domain: from exponential to power-law inter-meeting time in manet. MobiCom 2007: 159-170 - 2006
- [c1]Han Cai, Do Young Eun
Stability of Network Congestion Control with Asynchronous Updates. CDC 2006: 1906-1911
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-25 21:17 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: