default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNing Cai 0001
Person information
- affiliation: ShanghaiTech University, School of Information Science and Technology, China
- affiliation (2006 - 2016): Xidian University, State Key Laboratory of ISN, Xi'an, China
- affiliation (former): Chinese University of Hong Kong, Department of Information Engineering, Hong Kong
- affiliation (former): National University of Singapore, School of Computing, Singapore
- affiliation (former): University of Illinois, Department of Mathematics, Statistics and Computer Science, Chicago, IL, USA
- affiliation (PhD 1988): University of Bielefeld, Faculty of Mathematics, Germany
Other persons with the same name
- Ning Cai — disambiguation page
- Ning Cai 0002
![[0000-0003-3836-4822]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-3836-4822")
— Northwest University for Nationalities, School of Electrical Engineering, Lanzhou, China (and 1 more) - Ning Cai 0003 — Hong Kong University of Science and Technology, Department of Industrial Engineering and Logistics Management, Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j64]Masahito Hayashi, Ning Cai:
Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding. IEEE Trans. Inf. Theory 68(3): 1822-1850 (2022)- 2021
- [j63]Masahito Hayashi, Ning Cai:
Secure Non-Linear Network Code Over a One-Hop Relay Network. IEEE J. Sel. Areas Inf. Theory 2(1): 296-305 (2021) - [j62]Masahito Hayashi, Ning Cai:
Asymptotically Secure Network Code for Active Attacks. IEEE Trans. Commun. 69(5): 3245-3259 (2021) - [c30]Masahito Hayashi, Ning Cai:
Universal classical-quantum multiple access channel coding. ISIT 2021: 402-407 - 2020
- [j61]Haobo Li, Ning Cai:
Computing Classical-Quantum Channel Capacity Using Blahut-Arimoto Type Algorithm: A Theoretical and Numerical Analysis. Entropy 22(2): 222 (2020) - [j60]Masahito Hayashi, Masaki Owari, Go Kato, Ning Cai:
Reduction Theorem for Secrecy over Linear Network Code for Active Attacks. Entropy 22(9): 1053 (2020) - [j59]Ning Cai, Masahito Hayashi:
Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes. IEEE Trans. Inf. Theory 66(3): 1428-1448 (2020) - [j58]Ning Cai, Masahito Hayashi:
Corrections to "Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes". IEEE Trans. Inf. Theory 66(6): 3954 (2020) - [i18]Masahito Hayashi, Masaki Owari, Go Kato, Ning Cai:
Reduction Theorem for Secrecy over Linear Network Code for Active Attacks. CoRR abs/2003.11722 (2020) - [i17]Masahito Hayashi, Ning Cai:
Secure network code over one-hop relay network. CoRR abs/2003.12223 (2020) - [i16]Masahito Hayashi, Ning Cai:
Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution. CoRR abs/2003.12225 (2020) - [i15]Masahito Hayashi, Ning Cai:
Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding. CoRR abs/2011.00410 (2020)
2010 – 2019
- 2019
- [j57]Wangmei Guo, Dan He, Ning Cai:
Some Results on Network Error Correction With Time-Varying Adversarial Errors. IEEE Trans. Commun. 67(3): 1797-1808 (2019) - [j56]Holger Boche, Minglai Cai, Ning Cai:
Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources. IEEE Trans. Inf. Theory 65(5): 2922-2943 (2019) - [c29]Haobo Li, Ning Cai:
A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel Capacity. ISIT 2019: 255-259 - [c28]Holger Boche, Minglai Cai, Ning Cai:
Message Transmission over Classical Quantum Channels with a Jammer with Side Information, Correlation as Resource and Common Randomness Generating. ISIT 2019: 1722-1726 - [c27]Sebastian Baur, Ning Cai, Moritz Wiese, Holger Boche:
Secret Key Generation from a Two Component Compound Source with Rate Constrained One Way Communication: Perfect Secrecy. WIFS 2019: 1-6 - [i14]Holger Boche, Minglai Cai, Ning Cai:
Message transmission over classical quantum channels with a Jammer with side information; correlation as resource and common randomness generating. CoRR abs/1902.01764 (2019) - [i13]Haobo Li, Ning Cai:
A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel Capacity. CoRR abs/1904.11188 (2019) - 2018
- [j55]Wangmei Guo, Dan He, Ning Cai:
On Capacity of Network Error Correction Coding With Random Errors. IEEE Commun. Lett. 22(4): 696-699 (2018) - [j54]Qi Cao, Ning Cai, Wangmei Guo, Raymond W. Yeung:
On Zero-Error Capacity of Binary Channels With One Memory. IEEE Trans. Inf. Theory 64(10): 6771-6778 (2018) - [c26]Wangmei Guo, Dan He, Ning Cai:
Network Error Correction Coding for Time-Varying Adversarial Errors in a Unicast Network. ISIT 2018: 836-840 - [c25]Holger Boche, Minglai Cai, Ning Cai:
Message Transmission over Classical Quantum Channels with a Jammer with Side Information. ISIT 2018: 2017-2021 - [i12]Holger Boche, Minglai Cai, Ning Cai:
Message Transmission over Classical Quantum Channels with a Jammer with Side Information: Message Transmission Capacity and Resources. CoRR abs/1801.10550 (2018) - 2017
- [c24]Masahito Hayashi, Masaki Owari, Go Kato, Ning Cai:
Secrecy and robustness for active attack in secure network coding. ISIT 2017: 1172-1176 - [i11]Masahito Hayashi, Masaki Owari, Go Kato, Ning Cai:
Secrecy and Robustness for Active Attack in Secure Network Coding. CoRR abs/1703.00723 (2017) - [i10]Ning Cai, Masahito Hayashi:
Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes. CoRR abs/1712.09035 (2017) - 2016
- [j53]Ning Cai:
List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability. IEEE Trans. Inf. Theory 62(11): 6095-6110 (2016) - [c23]Dan He, Yuan Luo, Ning Cai:
Strong secrecy capacity of the wiretap channel II with DMC main channel. ISIT 2016: 505-509 - [c22]Holger Boche, Ning Cai, Janis Noetzel:
Classical-quantum channels with causal and non-causal channel state information at the sender. ISIT 2016: 2049-2053 - 2015
- [j52]Feng Cai, Ning Cai, Wangmei Guo:
Subspace Coding for Networks with Different Level Messages. Entropy 17(9): 6462-6480 (2015) - [c21]Qi Cao, Ning Cai, Wangmei Guo:
Zero-error capacity of binary channels with 1-memory. ISIT 2015: 1317-1321 - [i9]Holger Boche, Ning Cai, Janis Nötzel:
The Classical-Quantum Channel with Random State Parameters Known to the Sender. CoRR abs/1506.06479 (2015) - 2014
- [j51]Ning Cai:
The Maximum Error Probability Criterion, Random Encoder, and Feedback, in Multiple Input Channels. Entropy 16(3): 1211-1242 (2014) - [j50]Binyue Liu, Ning Cai:
Design of amplify-and-forward relaying schemes for layered relay networks. IET Commun. 8(11): 1910-1918 (2014) - [c20]Yanling Chen, Ning Cai, Aydin Sezgin:
Wiretap Channel with Correlated Sources. IC2E 2014: 472-477 - 2013
- [j49]Wangmei Guo, Xiaomeng Shi, Ning Cai, Muriel Médard:
Localized Dimension Growth: A Convolutional Random Network Coding Approach to Managing Memory and Decoding Delay. IEEE Trans. Commun. 61(9): 3894-3905 (2013) - [c19]Binyue Liu, Ning Cai:
Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme. Information Theory, Combinatorics, and Search Theory 2013: 44-70 - [p1]Rudolf Ahlswede, Ning Cai:
Cross-Disjoint Pairs of Clouds in the Interval Lattice. The Mathematics of Paul Erdős I 2013: 107-117 - [i8]Holger Boche, Minglai Cai, Ning Cai, Christian Deppe:
Secrecy capacities of compound quantum wiretap channels and applications. CoRR abs/1302.3412 (2013) - [i7]Wangmei Guo, Xiaomeng Shi, Ning Cai, Muriel Médard:
Localized Dimension Growth: A Convolutional Random Network Coding Approach to Managing Memory and Decoding Delay. CoRR abs/1303.4484 (2013) - 2012
- [j48]Wangmei Guo, Ning Cai, Qifu Tyler Sun:
Time-Variant Decoding of Convolutional Network Codes. IEEE Commun. Lett. 16(10): 1656-1659 (2012) - [c18]Minglai Cai, Ning Cai, Christian Deppe:
Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels. ISIT 2012: 726-730 - [i6]Minglai Cai, Ning Cai, Christian Deppe:
Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels. CoRR abs/1202.0773 (2012) - [i5]Binyue Liu, Ning Cai:
Multi-hop Analog Network Coding: An Amplify-and-Forward Approach. CoRR abs/1203.4867 (2012) - 2011
- [j47]Ning Cai, Terence Chan:
Theory of Secure Network Coding. Proc. IEEE 99(3): 421-437 (2011) - [j46]Min Tan, Raymond W. Yeung, Siu-Ting Ho, Ning Cai:
A Unified Framework for Linear Network Coding. IEEE Trans. Inf. Theory 57(1): 416-423 (2011) - [j45]Ning Cai, Raymond W. Yeung:
Secure Network Coding on a Wiretap Network. IEEE Trans. Inf. Theory 57(1): 424-435 (2011) - [c17]Binyue Liu, Ning Cai:
Analog network coding in the generalized high-SNR regime. ISIT 2011: 74-78 - [c16]Wangmei Guo, Ning Cai, Xiaomeng Shi, Muriel Médard:
Localized dimension growth in random network coding: A convolutional approach. ISIT 2011: 1156-1160 - [i4]Wangmei Guo, Ning Cai, Xiaomeng Shi, Muriel Médard:
Localized Dimension Growth in Random Network Coding: A Convolutional Approach. CoRR abs/1103.6258 (2011) - [i3]Binyue Liu, Ning Cai:
Analog Network Coding in the Generalized High-SNR Regime. CoRR abs/1106.3627 (2011) - [i2]Wangmei Guo, Ning Cai, Qifu Tyler Sun:
Convolutional Network Coding Based on Matrix Power Series Representation. CoRR abs/1109.3095 (2011) - 2010
- [j44]Wangmei Guo, Ning Cai:
The Minimum Decoding Delay for Convolutional Network Coding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(8): 1518-1523 (2010) - [c15]Ning Cai, Terence Chan, Alex J. Grant:
The arbitrarily varying channel when the jammer knows the channel input. ISIT 2010: 295-299
2000 – 2009
- 2009
- [j43]Raymond W. Yeung, Ning Cai, Siu-Wai Ho, Aaron B. Wagner:
Reliable Communication in the Absence of a Common Clock. IEEE Trans. Inf. Theory 55(2): 700-712 (2009) - [c14]Terence Chan, Ning Cai, Alex J. Grant:
Robust key agreement schemes. ISIT 2009: 2106-2110 - [i1]Terence Chan, Ning Cai, Alex J. Grant:
Robust Key Agreement Schemes. CoRR abs/0901.4551 (2009) - 2008
- [c13]Raymond W. Yeung, Ning Cai:
On the optimality of a construction of secure network codes. ISIT 2008: 166-170 - 2007
- [c12]Ning Cai, Raymond W. Yeung:
A Security Condition for Multi-Source Linear Network Coding. ISIT 2007: 561-565 - 2006
- [j42]Ning Cai, Raymond W. Yeung:
Network Error Correction, I: Basic Concepts and Upper Bounds. Commun. Inf. Syst. 6(1): 19-35 (2006) - [j41]Ning Cai, Raymond W. Yeung:
Network Error Correction, II: Lower Bounds. Commun. Inf. Syst. 6(1): 37-54 (2006) - [j40]Ning Cai, Mung Chiang, Michelle Effros, Ralf Koetter, Muriel Médard, Balaji Prabhakar, R. Srikant, Donald F. Towsley, Raymond W. Yeung:
Introduction to the special issue on networking and information theory. IEEE Trans. Inf. Theory 52(6): 2285-2288 (2006) - [j39]Rudolf Ahlswede, Ning Cai:
An Interpretation of Identification Entropy. IEEE Trans. Inf. Theory 52(9): 4198-4207 (2006) - [j38]Ning Cai, Mung Chiang, Michelle Effros, Ralf Koetter, Muriel Médard, Balaji Prabhakar, R. Srikant, Donald F. Towsley, Raymond W. Yeung:
Introduction to the special issue on networking and information theory. IEEE/ACM Trans. Netw. 14(4): 674 (2006) - [c11]Rudolf Ahlswede, Ning Cai:
Watermarking Identification Codes with Related Topics on Common Randomness. GTIT-C 2006: 107-153 - [c10]Rudolf Ahlswede, Ning Cai:
Codes with the Identifiable Parent Property and the Multiple-Access Channel. GTIT-C 2006: 249-257 - [c9]Rudolf Ahlswede, Ning Cai:
Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder. GTIT-C 2006: 258-275 - [c8]Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang:
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer. GTIT-C 2006: 285-292 - [c7]Rudolf Ahlswede, Ning Cai:
A Strong Converse Theorem for Quantum Multiple Access Channels. GTIT-C 2006: 460-485 - [c6]Rudolf Ahlswede, Ning Cai:
Search with Noisy and Delayed Responses. GTIT-C 2006: 695-703 - [c5]Rudolf Ahlswede, Ning Cai:
A Kraft-Type Inequality for d-Delay Binary Search Codes. GTIT-C 2006: 704-706 - [c4]Rudolf Ahlswede, Ning Cai:
Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs. GTIT-C 2006: 979-1005 - [c3]Ning Cai:
Private Capacity of Broadcast Channels. GTIT-C 2006: 1076-1078 - [e1]Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout K. Aydinian, Vladimir M. Blinovsky, Christian Deppe, Haik Mashurian:
General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science 4123, Springer 2006, ISBN 3-540-46244-9 [contents] - 2005
- [j37]Rudolf Ahlswede, Ning Cai:
A Kraft-type inequality for d-delay binary search codes. Electron. Notes Discret. Math. 21: 133-136 (2005) - [j36]Rudolf Ahlswede, Ning Cai:
A Strong Converse Theorem for Quantum Multiple Access Channels. Electron. Notes Discret. Math. 21: 137-141 (2005) - [j35]Rudolf Ahlswede, Ning Cai:
Codes with the identifiable parent property and the multiple-access channel. Electron. Notes Discret. Math. 21: 143-147 (2005) - [j34]Rudolf Ahlswede, Ning Cai:
Search with noisy and delayed response. Electron. Notes Discret. Math. 21: 149-154 (2005) - [j33]Rudolf Ahlswede, Ning Cai:
Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder. Electron. Notes Discret. Math. 21: 155-159 (2005) - [j32]Rudolf Ahlswede, Ning Cai:
Watermarking Identification Codes with Related Topics on Common Randomness. Electron. Notes Discret. Math. 21: 161-165 (2005) - [j31]Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang:
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers. Electron. Notes Discret. Math. 21: 167-168 (2005) - [j30]Raymond W. Yeung, Shuo-Yen Robert Li, Ning Cai, Zhen Zhang:
Network Coding Theory - Part I: Single Source. Found. Trends Commun. Inf. Theory 2(4) (2005) - [j29]Raymond W. Yeung, Shuo-Yen Robert Li, Ning Cai, Zhen Zhang:
Network Coding Theory - Part II: Multiple Source. Found. Trends Commun. Inf. Theory 2(5) (2005) - [c2]Shuo-Yen Robert Li, Ning Cai, Raymond W. Yeung:
On theory of linear network coding. ISIT 2005: 273-277 - 2004
- [j28]Ning Cai, Andreas J. Winter, Raymond W. Yeung:
Quantum privacy and quantum wiretap channels. Probl. Inf. Transm. 40(4): 318-336 (2004) - [j27]Rudolf Ahlswede, Ning Cai:
On Lossless Quantum Data Compression With a Classical Helper. IEEE Trans. Inf. Theory 50(6): 1208-1219 (2004) - 2003
- [j26]Shuo-Yen Robert Li, Raymond W. Yeung, Ning Cai:
Linear network coding. IEEE Trans. Inf. Theory 49(2): 371-381 (2003) - 2002
- [j25]Rudolf Ahlswede, Bernhard Balkenhol, Ning Cai:
Parallel error correcting codes. IEEE Trans. Inf. Theory 48(4): 959-962 (2002) - [j24]Rudolf Ahlswede, Ning Cai:
Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. IEEE Trans. Inf. Theory 48(8): 2153-2162 (2002) - [c1]Ning Cai, Raymond W. Yeung:
Network coding and error correction. ITW 2002: 119-122 - 2001
- [j23]Rudolf Ahlswede, Ning Cai, Christian Deppe:
An Isoperimetric Theorem for Sequences Generated by Feedback and Feedback-Codes for Unequal Error Protection. Probl. Inf. Transm. 37(4): 332-338 (2001) - 2000
- [j22]Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, Raymond W. Yeung:
Network information flow. IEEE Trans. Inf. Theory 46(4): 1204-1216 (2000)
1990 – 1999
- 1999
- [j21]Rudolf Ahlswede, Ning Cai:
A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem. Comb. Probab. Comput. 8(4): 301-305 (1999) - [j20]Rudolf Ahlswede, Ning Cai:
Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True. IEEE Trans. Inf. Theory 45(2): 742-749 (1999) - [j19]Rudolf Ahlswede, Ning Cai:
Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission. IEEE Trans. Inf. Theory 45(2): 749-756 (1999) - [j18]Rudolf Ahlswede, Ning Cai:
Identification without randomization. IEEE Trans. Inf. Theory 45(7): 2636-2642 (1999) - 1998
- [j17]Rudolf Ahlswede, Ning Cai:
Information and Control: Matching Channels. IEEE Trans. Inf. Theory 44(2): 542-563 (1998) - [j16]Rudolf Ahlswede, Ning Cai, Zhen Zhang:
Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel. IEEE Trans. Inf. Theory 44(3): 1250-1252 (1998) - 1997
- [j15]Rudolf Ahlswede, Ning Cai:
Shadows and Isoperimetry Under the Sequence-Subsequence Relation. Comb. 17(1): 11-29 (1997) - [j14]Rudolf Ahlswede, Ning Cai:
General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods. Eur. J. Comb. 18(4): 355-372 (1997) - [j13]Rudolf Ahlswede, Ning Cai:
General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions. Eur. J. Comb. 18(5): 479-489 (1997) - [j12]Rudolf Ahlswede, Ning Cai:
Models of Multi-User Write-Efficient Memories and General Diametric Theorems. Inf. Comput. 135(1): 37-67 (1997) - [j11]Rudolf Ahlswede, Ning Cai, Zhen Zhang:
On interactive communication. IEEE Trans. Inf. Theory 43(1): 22-37 (1997) - [j10]Rudolf Ahlswede, Ning Cai:
Correlated sources help transmission over an arbitrarily varying channel. IEEE Trans. Inf. Theory 43(4): 1254-1255 (1997) - 1996
- [j9]Rudolf Ahlswede, Ning Cai:
Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets. Eur. J. Comb. 17(8): 677-687 (1996) - [j8]Rudolf Ahlswede, Ning Cai, Zhen Zhang:
Erasure, list, and detection zero-error capacities for low noise and a relation to identification. IEEE Trans. Inf. Theory 42(1): 55-62 (1996) - 1994
- [j7]Rudolf Ahlswede, Ning Cai:
On Partitioning and Packing Products with Rectangles. Comb. Probab. Comput. 3: 429-434 (1994) - [j6]Rudolf Ahlswede, Ning Cai:
On communication complexity of vector-valued functions. IEEE Trans. Inf. Theory 40(6): 2062-2067 (1994) - 1993
- [j5]Rudolf Ahlswede, Ning Cai:
Rank Formulas for Certain Products of Matrices. Appl. Algebra Eng. Commun. Comput. 4: 253-261 (1993) - [j4]Rudolf Ahlswede, Ning Cai:
A generalization of the AZ identity. Comb. 13(3): 241-248 (1993) - [j3]Rudolf Ahlswede, Ning Cai:
On Extremal Set Partitions in Cartesian Product Spaces. Comb. Probab. Comput. 2: 211-220 (1993) - 1992
- [j2]Rudolf Ahlswede, Ning Cai, Zhen Zhang:
Diametric theorems in seuence spaces. Comb. 12(1): 1-17 (1992) - 1991
- [j1]Rudolf Ahlswede, Ning Cai:
Two proofs of Pinsker's conjecture concerning arbitrarily varying channels. IEEE Trans. Inf. Theory 37(6): 1647-1649 (1991)
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 2025-03-04 22:26 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:
