default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHanxu Hou
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
[j26]Zhengyi Jiang
, Hao Shi, Zhongyi Huang, Bo Bai, Gong Zhang, Hanxu Hou:
Toward Lower Repair Bandwidth and Optimal Repair Complexity of Piggybacking Codes With Small Sub-Packetization. IEEE Trans. Commun. 72(9): 5279-5289 (2024)- [c51]Wenhao Liu, Zhengyi Jiang, Zhongyi Huang, Linqi Song, Hanxu Hou:
Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding Complexity. ISIT 2024: 482-487 - [c50]Zhengyi Jiang, Hao Shi, Zhongyi Huang, Bo Bai, Gong Zhang, Hanxu Hou:
An Earlier Termination Algorithm to Find Error Locator Polynomial in Error Correction of RS Codes. ISIT 2024: 909-914 - [c49]Jingjie Lv, Weijun Fang, Shu-Tao Xia, Hanxu Hou:
An Explicit Construction of $q\text{-ary}$ MDS Array Codes and Their Efficient Decoding. ISIT 2024: 915-920 - [c48]Zhengyi Jiang, Bin Yu, Zhongyi Huang, Linqi Song, Bo Bai, Gong Zhang, Hanxu Hou:
Tight Lower Bound on Cross-Rack Update Bandwidth and Explicit Constructions. ISIT 2024: 1041-1046 - [c47]Panyu Zhu, Jingjie Lv, Yunghsiang S. Han, Linqi Song, Hanxu Hou:
New EVENODD+ Codes with More Flexible Parameters and Lower Complexity. ISIT 2024: 1233-1238 - [c46]Hao Shi, Zhengyi Jiang, Zhongyi Huang, Bo Bai, Gong Zhang, Hanxu Hou:
Set Transformation: Trade-Off Between Repair Bandwidth and Sub-Packetization. ISIT 2024: 2347-2352 - [i23]Guangfeng Yan, Shanxiang Lyu, Hanxu Hou, Zhiyong Zheng, Linqi Song:
Towards Quantum-Safe Federated Learning via Homomorphic Encryption: Learning with Gradients. CoRR abs/2402.01154 (2024) - [i22]Guangfeng Yan, Tan Li, Yuanzhang Xiao, Hanxu Hou, Linqi Song:
Improved Quantization Strategies for Managing Heavy-tailed Gradients in Distributed Learning. CoRR abs/2402.01798 (2024) - [i21]Yuxuan Yao, Han Wu, Zhijiang Guo, Biyan Zhou, Jiahui Gao, Sichun Luo, Hanxu Hou, Xiaojin Fu, Linqi Song:
Learning From Correctness Without Prompting Makes LLM Efficient Reasoner. CoRR abs/2403.19094 (2024) - [i20]Wenhao Liu, Zhengyi Jiang, Zhongyi Huang, Linqi Song, Hanxu Hou:
Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding Complexity. CoRR abs/2405.01043 (2024) - [i19]Hao Shi, Zhengyi Jiang, Zhongyi Huang, Bo Bai, Gong Zhang, Hanxu Hou:
Set Transformation: Trade-off Between Repair Bandwidth and Sub-packetization. CoRR abs/2405.02713 (2024) - [i18]Sichun Luo, Wei Shao, Yuxuan Yao, Jian Xu, Mingyang Liu, Qintong Li, Bowei He, Maolin Wang, Guanzhi Deng, Hanxu Hou, Xinyi Zhang, Linqi Song:
Privacy in LLM-based Recommendation: Recent Advances and Future Directions. CoRR abs/2406.01363 (2024) - [i17]Zhengyi Jiang, Hao Shi, Zhongyi Huang, Linqi Song, Bo Bai, Gong Zhang, Hanxu Hou:
Error Correction Decoding Algorithms of RS Codes Based on An Earlier Termination Algorithm to Find The Error Locator Polynomial. CoRR abs/2407.19484 (2024) - 2023
- [j25]Leilei Yu, Sian-Jheng Lin, Hanxu Hou, Zhengrui Li:
Reed-Solomon Coding Algorithms Based on Reed-Muller Transform for Any Number of Parities. IEEE Trans. Computers 72(9): 2677-2688 (2023) - [j24]Hanxu Hou:
Extended EVENODD+ and STAR+ With Asymptotic Optimal Update and Efficient Decoding. IEEE Trans. Commun. 71(5): 2563-2575 (2023) - [j23]Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, You Wu, Guojun Han, Mario Blaum:
A Generalization of Array Codes With Local Properties and Efficient Encoding/Decoding. IEEE Trans. Inf. Theory 69(1): 107-125 (2023) - [j22]Jie Li, Xiaohu Tang, Hanxu Hou, Yunghsiang S. Han, Bo Bai, Gong Zhang:
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access. IEEE Trans. Inf. Theory 69(3): 1551-1566 (2023) - [c45]Chuang Luo, Hanxu Hou, Peng Zhang, Hui Li:
Optimal Repair Algorithm of Single-Disk Failure for Array Codes with Local Properties. IEEE Big Data 2023: 2319-2325 - [c44]Qi Lyu, Hui Li, Xinnan Lin, Han Wang, Hanxu Hou, Yuguo Yin, Qianbin Chen, Ping Fan, Gang Wan, Xiang Zhu, Selwyn Deng, Weixiang Huang, Jianping Wu, Jieren Cheng, Wenyuan Yang:
H-MIS: A Hierarchical Multi-Identifier System Based on Blockchain. IEEE Big Data 2023: 2326-2333 - [c43]Shicheng Tan, Hanxu Hou, Leilei Yu:
Reed-Solomon Codes Over Ring with Lower Computational Complexity. IEEE Big Data 2023: 2362-2368 - [c42]Feng Zhao, Hui Li, Shaoliang Peng, Xiyu Wang, Ping Lu, Qianbin Chen, Weixiang Huang, Jianping Wu, Xiang Zhu, Selwyn Deng, Hanxu Hou, Jieren Cheng, Han Wang:
EMIS: A Uniform Management and Resolution System of Multiple Identifiers on Ethereum. Blockchain 2023: 145-150 - [c41]Zhengyi Jiang, Bin Yu, Zhongyi Huang, Gong Zhang, Qintao Hu, Hanxu Hou:
Cross-Rack Update Bandwidth for Distributed Storage Systems. GLOBECOM 2023: 3699-3704 - [c40]Xia Qiu, Hanxu Hou:
EVENODD* Codes with More Flexible Parameters and Efficient Decoding. GLOBECOM 2023: 7339-7344 - [c39]Zhengyi Jiang, Hao Shi, Zhongyi Huang, Bo Bai, Gong Zhang, Hanxu Hou:
Toward Lower Repair Bandwidth of Piggybacking Codes via Jointly Design for Both Data and Parity Nodes. GLOBECOM 2023: 7345-7350 - [c38]Hao Shi, Zhengyi Jiang, Zhongyi Huang, Bo Bai, Gong Zhang, Hanxu Hou:
Piggybacking+ Codes: MDS Array Codes with Linear Sub- Packetization to Achieve Lower Repair Bandwidth. GLOBECOM 2023: 7351-7356 - [c37]Bin Yu, Zhengyi Jiang, Zhongyi Huang, Linqi Song, Hanxu Hou:
Product-Matrix Construction of Minimum Storage Rack-aware Regenerating Codes. WCSP 2023: 287-292 - [c36]Pingping Li, Leilei Yu, Linqi Song, Hanxu Hou:
A Fast Algorithm for Finding the Roots of Polynomials over Finite Fields. WCSP 2023: 299-304 - [i16]Zhengyi Jiang, Hao Shi, Zhongyi Huang, Bo Bai, Gong Zhang, Hanxu Hou:
Generalized Simple Regenerating Codes: Trading Sub-packetization and Fault Tolerance. CoRR abs/2309.01963 (2023) - 2022
- [j21]Weijie Zhou, Hanxu Hou:
Three Efficient All-Erasure Decoding Methods for Blaum-Roth Codes. Entropy 24(10): 1499 (2022) - [c35]Jieying Liu, Guojun Han, Hanxu Hou:
Some Results on Optimal Octonion-Field Locally Repairable Codes of Distance 3 and 4. IEEE Big Data 2022: 3207-3214 - [c34]Lu Zhong, Guojun Han, Hanxu Hou, Qinda Hai:
Optimizing Repair-Cost of Locally Repairable Codes for Hot Data in Cluster Storage Systems. IEEE Big Data 2022: 3235-3241 - [c33]Lin Zou, Hanxu Hou, Xiaoan Zhou:
Systematic MDS Array Codes Correcting a Single Criss-Cross Error with Lower Update Complexity. IEEE Big Data 2022: 3242-3249 - [c32]Jie Li, Xiaohu Tang, Hanxu Hou, Yunghsiang S. Han, Bo Bai, Gong Zhang:
PMDS Array Codes With Small Sub-packetization Level and Small Repair Bandwidth. ISIT 2022: 2172-2177 - [c31]Hao Shi, Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Zhengyi Jiang, Zhongyi Huang, Bo Bai:
New Piggybacking Codes with Lower Repair Bandwidth for Any Single-Node Failure. ISIT 2022: 2601-2606 - [c30]Hanxu Hou, Yunghsiang S. Han, Bo Bai, Gong Zhang:
Towards Efficient Repair and Coding of Binary MDS Array Codes with Small Sub-packetization. ISIT 2022: 3132-3137 - [i15]Zhengyi Jiang, Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Bo Bai, Zhongyi Huang:
Two New Piggybacking Designs with Lower Repair Bandwidth. CoRR abs/2205.14555 (2022) - [i14]Hanxu Hou, Mario Blaum:
On MDS Condition and Erased Lines Recovery of Generalized Expanded-Blaum-Roth Codes and Generalized Blaum-Roth Codes. CoRR abs/2209.05640 (2022) - [i13]Hao Shi, Zhengyi Jiang, Zhongyi Huang, Bo Bai, Hanxu Hou:
Two Piggybacking Codes with Flexible Sub-Packetization to Achieve Lower Repair Bandwidth. CoRR abs/2209.09691 (2022) - [i12]Jie Li, Xiaohu Tang, Hanxu Hou, Yunghsiang S. Han, Bo Bai, Gong Zhang:
PMDS Array Codes With Small Sub-packetization, Small Repair Bandwidth/Rebuilding Access. CoRR abs/2211.06654 (2022) - 2021
- [j20]Ruiting Lei, Hanxu Hou, Yue Song:
Cross-Rack Updates in Vertical Array Codes Storage Systems with High Fault Tolerance. J. Commun. Inf. Networks 6(2): 184-196 (2021) - [j19]Zhengrui Li, Sian-Jheng Lin, Po-Ning Chen, Yunghsiang S. Han, Hanxu Hou:
Update Bandwidth for Distributed Storage. IEEE Trans. Inf. Theory 67(11): 7159-7179 (2021) - [c29]Hanxu Hou, Patrick P. C. Lee:
Generalized Rack-aware Regenerating Codes for Jointly Optimal Node and Rack Repairs. ISIT 2021: 2191-2196 - [c28]Zhengyi Jiang, Hanxu Hou, Yunghsiang S. Han, Zhongyi Huang, Bo Bai, Gong Zhang:
An Efficient Piggybacking Design with Lower Repair Bandwidth and Lower Sub-packetization. ISIT 2021: 2328-2333 - [c27]Hanxu Hou, Patrick P. C. Lee:
STAR+ Codes: Triple-Fault-Tolerant Codes with Asymptotically Optimal Updates and Efficient Encoding/Decoding. ITW 2021: 1-6 - [c26]Zhengrui Li, Yunghsiang S. Han, Ting-Yi Wu, Hanxu Hou, Bo Bai, Gong Zhang:
On the Repair Bandwidth and Repair Access of Two Storage Systems: Large-Scale and Uniform Rack-Aware Storage Systems. ITW 2021: 1-6 - [c25]Hong Fu, Hanxu Hou, Li Zhang:
Extended EVENODD+ Codes with Asymptotically Optimal Updates and Efficient Encoding/Decoding. REDUNDANCY 2021: 1-6 - [i11]Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, You Wu, Guojun Han, Mario Blaum:
A Generalization of Array Codes with Local Properties and Efficient Encoding/Decoding. CoRR abs/2110.04785 (2021) - 2020
- [j18]Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Zigzag-Decodable Reconstruction Codes With Asymptotically Optimal Repair for All Nodes. IEEE Trans. Commun. 68(10): 5999-6011 (2020) - [j17]Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee:
Two Classes of Binary MDS Array Codes With Asymptotically Optimal Repair for Any Single Column. IEEE Trans. Commun. 68(11): 6723-6736 (2020) - [j16]Hanxu Hou, Patrick P. C. Lee:
Binary MDS Array Codes With Optimal Repair. IEEE Trans. Inf. Theory 66(3): 1405-1422 (2020) - [c24]You Wu, Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Guojun Han:
Generalized Expanded-Blaum-Roth Codes and Their Efficient Encoding/Decoding. GLOBECOM 2020: 1-6 - [c23]Yao Lan, Hanxu Hou, Peng Zhang:
Efficient Repair Algorithm for Information Column of EVENODD(p, 4) Codes. ICCT 2020: 447-453 - [c22]Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Minimum Storage Rack-Aware Regenerating Codes with Exact Repair and Small Sub-Packetization. ISIT 2020: 554-559 - [c21]Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Toward Optimality in Both Repair and Update via Generic MDS Code Transformation. ISIT 2020: 560-565 - [c20]Kenneth W. Shum, Hanxu Hou:
Network Coding Based on Byte-wise Circular Shift and Integer Addition. ISIT 2020: 1641-1645 - [i10]Kenneth W. Shum, Hanxu Hou:
Network Coding Based on Byte-wise Circular Shift and Integer Addition. CoRR abs/2005.07336 (2020) - [i9]Zhengrui Li, Sian-Jheng Lin, Po-Ning Chen, Yunghsiang S. Han, Hanxu Hou:
Update Bandwidth for Distributed Storage. CoRR abs/2005.11894 (2020)
2010 – 2019
- 2019
- [j15]Hanxu Hou, Tian Gan, Yaodong Yang, Xianglei Zhu, Sen Liu, Weiming Guo, Jianye Hao:
Using deep reinforcement learning to speed up collective cell migration. BMC Bioinform. 20-S(18): 571:1-571:10 (2019) - [j14]Xia Li, Kaiping Chen, Hanxu Hou, Lei Deng, Qingfeng Zhou:
Cache-aided multi-hop UAV-relaying networks. Phys. Commun. 33: 165-171 (2019) - [j13]Hanxu Hou, Patrick P. C. Lee, Kenneth W. Shum, Yuchong Hu:
Rack-Aware Regenerating Codes for Data Centers. IEEE Trans. Inf. Theory 65(8): 4730-4745 (2019) - [j12]Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Yuchong Hu, Hui Li:
A New Design of Binary MDS Array Codes With Asymptotically Weak-Optimal Repair. IEEE Trans. Inf. Theory 65(11): 7095-7113 (2019) - [c19]Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee:
Binary MDS Array Codes with Asymptotically Optimal Repair for All Columns. ICCCN 2019: 1-9 - [c18]Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Qingfeng Zhou:
New Regenerating Codes over Binary Cyclic Codes. ISIT 2019: 216-220 - [c17]Shangyao Huang, Hanxu Hou, Xiangshou Yu:
A Lower Bound on Disk Reads for Single Information Disk Failure Recovery and One Recovery Scheme for EVENODD(p, 3). IWSDA 2019: 1-5 - [i8]Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Multi-Layer Transformed MDS Codes with Optimal Repair Access and Low Sub-Packetization. CoRR abs/1907.08938 (2019) - 2018
- [j11]Xiaotian Hao, Jianye Hao, Wang Li, Hanxu Hou:
Effective norm emergence in cell systems under limited communication. BMC Bioinform. 19-S(5): 23-35 (2018) - [j10]Hanxu Hou, Yunghsiang S. Han:
A class of binary MDS array codes with asymptotically weak-optimal repair. Sci. China Inf. Sci. 61(10): 100302:1-100302:11 (2018) - [j9]Hanxu Hou, Patrick P. C. Lee:
A New Construction of EVENODD Codes With Lower Computational Complexity. IEEE Commun. Lett. 22(6): 1120-1123 (2018) - [j8]Lei Deng, Wing Shing Wong, Po-Ning Chen, Yunghsiang S. Han, Hanxu Hou:
Delay-Constrained Input-Queued Switch. IEEE J. Sel. Areas Commun. 36(11): 2464-2474 (2018) - [j7]Hanxu Hou, Yunghsiang S. Han:
A New Construction and an Efficient Decoding Method for Rabin-Like Codes. IEEE Trans. Commun. 66(2): 521-533 (2018) - [j6]Hanxu Hou, Yunghsiang S. Han, Kenneth W. Shum, Hui Li:
A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding. IEEE Trans. Commun. 66(11): 5053-5066 (2018) - [c16]Junrong Ze, Hanxu Hou, Yunghsiang S. Han:
Comparison on Binary MDS Array Codes for Single Disk Failure Recovery. CSAI/ICIMT 2018: 536-541 - [c15]Shangyao Huang, Hanxu Hou, Yunghsiang S. Han:
An Improved MDS Condition of Blaum-Bruck-Vardy Codes. ISTC 2018: 1-5 - [i7]Hanxu Hou, Patrick P. C. Lee, Kenneth W. Shum, Yuchong Hu:
Rack-Aware Regenerating Codes for Data Centers. CoRR abs/1802.04031 (2018) - [i6]Hanxu Hou, Yunghsiang Han, Patrick P. C. Lee, Yuchong Hu, Hui Li:
A New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair. CoRR abs/1802.07891 (2018) - [i5]Hanxu Hou, Yunghsiang S. Han, Kenneth W. Shum, Hui Li:
A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding. CoRR abs/1803.03508 (2018) - [i4]Lei Deng, Wing Shing Wong, Po-Ning Chen, Yunghsiang S. Han, Hanxu Hou:
Delay-Constrained Input-Queued Switch. CoRR abs/1809.02826 (2018) - [i3]Hanxu Hou, Patrick P. C. Lee:
Binary MDS Array Codes with Optimal Repair. CoRR abs/1809.04380 (2018) - 2017
- [j5]Huayu Zhang, Hui Li, Kenneth W. Shum, Hanxu Hou, Shuo-Yen Robert Li:
Concurrent regenerating codes. IET Commun. 11(3): 362-369 (2017) - [j4]Huanle Xu, Wing Cheong Lau, Zhibo Yang, Gustavo de Veciana, Hanxu Hou:
Mitigating Service Variability in MapReduce Clusters via Task Cloning: A Competitive Analysis. IEEE Trans. Parallel Distributed Syst. 28(10): 2866-2880 (2017) - [c14]Zhili Lin, Kedan Li, Hanxu Hou, Xin Yang, Hui Li:
MDFS: A mimic defense theory based architecture for distributed file system. IEEE BigData 2017: 2670-2675 - [c13]Jiyang Zhang, Hanxu Hou, Kedan Li, Hui Li:
On the implementation of BRS codes in Ceph. IEEE BigData 2017: 2676-2681 - [c12]Kejiao Li, Hui Li, Hanxu Hou, Kedan Li, Yongle Chen:
Proof of Vote: A High-Performance Consensus Protocol Based on Vote Mechanism & Consortium Blockchain. HPCC/SmartCity/DSS 2017: 466-473 - [c11]Hanxu Hou, Yunghsiang S. Han:
BASIC Codes for Distributed Storage Systems. ICCCN 2017: 1-9 - [c10]Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han, Yuchong Hu:
Triple-fault-tolerant binary MDS array codes with asymptotically optimal repair. ISIT 2017: 839-843 - 2016
- [j3]Hanxu Hou, Kenneth W. Shum, Hui Li:
On the MDS Condition of Blaum-Bruck-Vardy Codes With Large Number Parity Columns. IEEE Commun. Lett. 20(4): 644-647 (2016) - [j2]Hanxu Hou, Kenneth W. Shum, Minghua Chen, Hui Li:
BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems. IEEE Trans. Inf. Theory 62(6): 3053-3069 (2016) - [i2]Huayu Zhang, Hui Li, Hanxu Hou, Kenneth W. Shum, Shuo-Yen Robert Li:
Concurrent Regenerating Codes and Scalable Application in Network Storage. CoRR abs/1604.06567 (2016) - [i1]Hanxu Hou, Yunghsiang S. Han:
Cauchy MDS Array Codes With Efficient Decoding Method. CoRR abs/1611.09968 (2016) - 2014
- [j1]Bing Zhu, Kenneth W. Shum, Hui Li, Hanxu Hou:
General Fractional Repetition Codes for Distributed Storage Systems. IEEE Commun. Lett. 18(4): 660-663 (2014) - [c9]Jun Chen, Hui Li, Hanxu Hou, Bing Zhu, Tai Zhou, Lijia Lu, Yumeng Zhang:
A new Zigzag MDS code with optimal encoding and efficient decoding. IEEE BigData 2014: 1-6 - [c8]Tai Zhou, Hui Li, Bing Zhu, Yumeng Zhang, Hanxu Hou, Jun Chen:
STORE: Data recovery with approximate minimum network bandwidth and disk I/O in distributed storage systems. IEEE BigData 2014: 33-38 - [c7]Hanxu Hou, Kenneth W. Shum, Minghua Chen, Hui Li:
New MDS array code correcting multiple disk failures. GLOBECOM 2014: 2369-2374 - [c6]Kenneth W. Shum, Hanxu Hou, Minghua Chen, Huanle Xu, Hui Li:
Regenerating codes over a binary cyclic code. ISIT 2014: 1046-1050 - [c5]Bing Zhu, Hui Li, Hanxu Hou, Kenneth W. Shum:
Replication-based distributed storage systems with variable repetition degrees. NCC 2014: 1-5 - 2013
- [c4]Hanxu Hou, Kenneth W. Shum, Hui Li:
Construction of exact-BASIC codes for distributed storage systems at the MSR point. IEEE BigData 2013: 33-38 - [c3]Xianxia Huang, Hui Li, Tai Zhou, Yumeng Zhang, Han Guo, Hanxu Hou, Huayu Zhang, Kai Lei:
Minimum storage BASIC codes: A system perspective. IEEE BigData 2013: 39-43 - [c2]Hanxu Hou, Hui Li, Kenneth W. Shum:
General self-repairing codes for distributed storage systems. ICC 2013: 4358-4362 - [c1]Hanxu Hou, Kenneth W. Shum, Minghua Chen, Hui Li:
BASIC regenerating code: Binary addition and shift for exact repair. ISIT 2013: 1621-1625
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-13 18:01 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:
