default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIan F. Blake
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j84]Seyed Ali Saberali
, Lutz Lampe, Ian F. Blake:
Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands. IEEE Trans. Inf. Theory 66(1): 633-648 (2020)
2010 – 2019
- 2019
- [j83]Seyed Ali Saberali, Lutz Lampe, Ian F. Blake:
Decentralized Coded Caching Without File Splitting. IEEE Trans. Wirel. Commun. 18(2): 1289-1303 (2019) - 2018
- [j82]Ian F. Blake, Shu Lin:
On Short Cycle Enumeration in Biregular Bipartite Graphs. IEEE Trans. Inf. Theory 64(10): 6526-6535 (2018) - [i9]Seyed Ali Saberali, Lutz Lampe, Ian F. Blake:
Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands. CoRR abs/1804.00807 (2018) - 2017
- [i8]Seyed Ali Saberali, Hamidreza Ebrahimzadeh Saffar, Lutz Lampe, Ian F. Blake:
Adaptive Delivery in Caching Networks. CoRR abs/1707.09662 (2017) - [i7]Seyed Ali Saberali, Lutz Lampe, Ian F. Blake:
Decentralized Coded Caching Without File Splitting. CoRR abs/1708.07493 (2017) - 2016
- [j81]Ian F. Blake, V. Kumar Murty, Hamid Usefi:
A note on diagonal and Hermitian hypersurfaces. Adv. Math. Commun. 10(4): 753-764 (2016) - [j80]Seyed Ali Saberali, Hamidreza Ebrahimzadeh Saffar, Lutz Lampe, Ian F. Blake:
Adaptive Delivery in Caching Networks. IEEE Commun. Lett. 20(7): 1405-1408 (2016) - [j79]Qiuju Diao, Juane Li, Shu Lin, Ian F. Blake:
New Classes of Partial Geometries and Their Associated LDPC Codes. IEEE Trans. Inf. Theory 62(6): 2947-2965 (2016) - 2015
- [j78]Ian F. Blake, Alfred Menezes, Douglas R. Stinson:
Guest Editorial: Special Issue in Honor of Scott A. Vanstone. Des. Codes Cryptogr. 77(2-3): 287-299 (2015) - [c25]Ian F. Blake, V. Kumar Murty, Hamid Usefi:
Higher dimensional varieties in coding theory. CWIT 2015: 1-4 - [i6]Qiuju Diao, Juane Li, Shu Lin, Ian F. Blake:
New Classes of Partial Geometries and Their Associated LDPC Codes. CoRR abs/1503.06900 (2015) - 2014
- [j77]Ian F. Blake, Florian Luca, Igor E. Shparlinski:
VSH and multiplicative modular relations between small primes with polynomial exponents. Appl. Algebra Eng. Commun. Comput. 25(3): 181-188 (2014) - [j76]Ehsan Vahedi, Rabab K. Ward, Ian F. Blake:
Performance Analysis of RFID Protocols: CDMA Versus the Standard EPC Gen-2. IEEE Trans Autom. Sci. Eng. 11(4): 1250-1261 (2014) - [c24]Shu Lin, Qiuju Diao, Ian F. Blake:
Error floors and finite geometries. ISTC 2014: 42-46 - [i5]Ian F. Blake, V. Kumar Murty, Hamid Usefi:
A note on diagonal and Hermitian surfaces. CoRR abs/1411.3706 (2014) - 2013
- [p3]Ian F. Blake, W. Cary Huffman:
Basic coding properties and bounds. Handbook of Finite Fields 2013: 659-702 - [p2]Ian F. Blake, W. Cary Huffman:
LDPC and Gallager codes over finite fields. Handbook of Finite Fields 2013: 713-726 - [p1]Ian F. Blake, W. Cary Huffman:
Raptor codes. Handbook of Finite Fields 2013: 727-740 - 2012
- [j75]Majid Khabbazian, Ian F. Blake, Vijay K. Bhargava:
Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions. IEEE Trans. Mob. Comput. 11(3): 402-413 (2012) - [c23]Ehsan Vahedi, Rabab K. Ward, Ian F. Blake:
Analytical modeling of RFID Generation-2 protocol using absorbing Markov chain theorem. GLOBECOM 2012: 385-390 - 2011
- [j74]Ehsan Vahedi, Vincent W. S. Wong, Ian F. Blake, Rabab K. Ward:
Probabilistic Analysis and Correction of Chen's Tag Estimate Method. IEEE Trans Autom. Sci. Eng. 8(3): 659-663 (2011) - [j73]Ehsan Vahedi, Vahid Shah-Mansouri, Vincent W. S. Wong, Ian F. Blake, Rabab K. Ward:
Probabilistic Analysis of Blocking Attack in RFID Systems. IEEE Trans. Inf. Forensics Secur. 6(3-1): 803-817 (2011) - [j72]Amir Nasri, Robert Schober, Ian F. Blake:
Performance and Optimization of Amplify-and-Forward Cooperative Diversity Systems in Generic Noise and Interference. IEEE Trans. Wirel. Commun. 10(4): 1132-1143 (2011) - [c22]Ehsan Vahedi, Rabab K. Ward, Ian F. Blake:
Security Analysis and Complexity Comparison of Some Recent Lightweight RFID Protocols. CISIS 2011: 92-99 - 2010
- [j71]Chris Studholme, Ian F. Blake:
Random Matrices and Codes for the Erasure Channel. Algorithmica 56(4): 605-620 (2010) - [j70]Ian F. Blake, Theodoulos Garefalakis:
A transform property of Kloosterman sums. Discret. Appl. Math. 158(10): 1064-1072 (2010) - [j69]Li Zhang, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar, Ian F. Blake:
Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares. IEEE Trans. Commun. 58(11): 3126-3139 (2010) - [c21]Ehsan Vahedi, Vahid Shah-Mansouri, Vincent W. S. Wong, Ian F. Blake:
A Probabilistic Approach for Detecting Blocking Attack in RFID Systems. ICC 2010: 1-6 - [c20]Li Zhang, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar, Ian F. Blake:
Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices. ITA 2010: 16-22 - [c19]Ian F. Blake:
Abelian varieties in coding and cryptography. ITW 2010: 1-5
2000 – 2009
- 2009
- [j68]Ian F. Blake, Vladimir Kolesnikov:
One-round secure comparison of integers. J. Math. Cryptol. 3(1): 37-68 (2009) - 2008
- [j67]Ian F. Blake, Theodoulos Garefalakis:
Polynomial approximation of bilinear Diffie-Hellman maps. Finite Fields Their Appl. 14(2): 379-389 (2008) - 2007
- [j66]Ian F. Blake, Igor E. Shparlinski:
Statistical distribution and collisions of VSH. J. Math. Cryptol. 1(4): 329-349 (2007) - [c18]E. C. Park, Ian F. Blake:
Reducing Communication Overhead of Key Distribution Schemes for Wireless Sensor Networks. ICCCN 2007: 1345-1350 - [i4]Chris Studholme, Ian F. Blake:
Multiparty Computation to Generate Secret Permutations. IACR Cryptol. ePrint Arch. 2007: 353 (2007) - 2006
- [j65]Ian F. Blake, Theodoulos Garefalakis, Igor E. Shparlinski:
On the bit security of the Diffie-Hellman key. Appl. Algebra Eng. Commun. Comput. 16(6): 397-404 (2006) - [j64]Ian F. Blake, V. Kumar Murty, Guangwu Xu:
Refinements of Miller's algorithm for computing the Weil/Tate pairing. J. Algorithms 58(2): 134-149 (2006) - [j63]E. C. Park, Ian F. Blake:
On the mean number of encryptions for tree-based broadcast encryption schemes. J. Discrete Algorithms 4(2): 215-238 (2006) - [j62]Mehrdad Shamsi, Masoud Ardakani, Ian F. Blake:
Mixed-Q linear space-time codes. IEEE Trans. Commun. 54(5): 849-857 (2006) - [c17]Ian F. Blake, Vladimir Kolesnikov:
Conditional Encrypted Mapping and Comparing Encrypted Numbers. Financial Cryptography 2006: 206-220 - [c16]Ian F. Blake, Aldar C.-F. Chan:
Conditionally Verifiable Signature. INDOCRYPT 2006: 206-220 - [c15]Chris Studholme, Ian F. Blake:
Windowed Erasure Codes. ISIT 2006: 509-513 - 2005
- [j61]Ian F. Blake, V. Kumar Murty, Guangwu Xu:
A note on window tau-NAF algorithm. Inf. Process. Lett. 95(5): 496-502 (2005) - [j60]Ian F. Blake, V. Kumar Murty, Guangwu Xu:
Efficient algorithms for Koblitz curves over fields of characteristic three. J. Discrete Algorithms 3(1): 113-124 (2005) - [c14]Mehrdad Shamsi, Masoud Ardakani, Ian F. Blake:
A new modulation scheme for space-time codes. ICC 2005: 553-557 - [c13]Aldar C.-F. Chan, Ian F. Blake:
Scalable, Server-Passive, User-Anonymous Timed Release Cryptography. ICDCS 2005: 504-513 - [i3]Aldar C.-F. Chan, Ian F. Blake:
Conditionally Verifiable Signatures. IACR Cryptol. ePrint Arch. 2005: 149 (2005) - 2004
- [j59]Ian F. Blake, Theodoulos Garefalakis:
On the complexity of the discrete logarithm and Diffie-Hellman problems. J. Complex. 20(2-3): 148-170 (2004) - [c12]Ian F. Blake, Vladimir Kolesnikov:
Strong Conditional Oblivious Transfer and Computing on Intervals. ASIACRYPT 2004: 515-529 - [c11]Mehrdad Shamsi, Ian F. Blake:
Space-time codes with triangular core. ICC 2004: 463-467 - [c10]Mehrdad Shamsi, Ian F. Blake:
Space-time codes from property-L. ISIT 2004: 49 - [c9]Kenneth W. Shum, Ian F. Blake, V. Kumar Murty:
On the zeta functions of two towers of function fields. ISIT 2004: 546 - [i2]Ian F. Blake, V. Kumar Murty, Guangwu Xu:
Refinements of Miller's Algorithm for Computing Weil/Tate Pairing. IACR Cryptol. ePrint Arch. 2004: 65 (2004) - [i1]Ian F. Blake, Aldar C.-F. Chan:
Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing. IACR Cryptol. ePrint Arch. 2004: 211 (2004) - 2003
- [c8]Kenneth W. Shum, Ian F. Blake:
Expander graphs and codes. Algebraic Coding Theory and Information Theory 2003: 57-68 - [c7]Jun Xu, Shu Lin, Ian F. Blake:
On products of graphs for LDPC codes. ITW 2003: 6-9 - 2002
- [j58]Ian F. Blake, Theodoulos Garefalakis:
On the Security of the Digital Signature Algorithm. Des. Codes Cryptogr. 26(1-3): 87-96 (2002) - [j57]Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhong Gao:
Finite Field Multiplier Using Redundant Representation. IEEE Trans. Computers 51(11): 1306-1316 (2002)
1990 – 1999
- 1999
- [j56]Amir H. Banihashemi, Ian F. Blake:
On the trellis complexity of root lattices and their duals. IEEE Trans. Inf. Theory 45(6): 2168-2172 (1999) - [c6]Ian F. Blake:
Curves with Many Points and Their Applications. AAECC 1999: 55-64 - [c5]Huapeng Wu, M. Anwarul Hasan, Ian F. Blake:
Highly Regular Architectures for Finite Field Computation Using Redundant Basis. CHES 1999: 269-279 - [c4]Dariush Dabiri, Ian F. Blake:
An area efficient surviving paths unit for the Viterbi algorithm. ICC 1999: 300-304 - 1998
- [j55]Huapeng Wu, M. Anwarul Hasan, Ian F. Blake:
New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases. IEEE Trans. Computers 47(11): 1223-1234 (1998) - [j54]Cecilio Pimentel, Ian F. Blake:
Concatenated coding performance for FSK modulation on time-correlated Rician fading channels. IEEE Trans. Commun. 46(12): 1610-1618 (1998) - [j53]Shraga I. Bross, Ian F. Blake:
Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel. IEEE Trans. Inf. Theory 44(1): 334-340 (1998) - [j52]Amir H. Banihashemi, Ian F. Blake:
Trellis Complexity and Minimal Trellis Diagrams of Lattices. IEEE Trans. Inf. Theory 44(5): 1829-1847 (1998) - [j51]Ian F. Blake, Chris Heegard, Tom Høholdt, V. Wei:
Algebraic-Geometry Codes. IEEE Trans. Inf. Theory 44(6): 2596-2618 (1998) - 1997
- [j50]Muzhong Wang, Ian F. Blake:
Normal basis of the finite field F2(p-1)pm over F2. IEEE Trans. Inf. Theory 43(2): 737-739 (1997) - [c3]Cecilio Pimentel, Ian F. Blake:
Non-Interleaved Reed-Solomon Coding Performance on Finite State Channels. ICC (3) 1997: 1493-1497 - 1996
- [j49]Ian F. Blake, Vahid Tarokh:
On the Trellis Complexity of the Densest Lattice Packings in Rn. SIAM J. Discret. Math. 9(4): 597-601 (1996) - [j48]Christopher J. Wein, Ian F. Blake:
On the performance of fractal compression with clustering. IEEE Trans. Image Process. 5(3): 522-526 (1996) - [j47]Vahid Tarokh, Ian F. Blake:
Trellis complexity versus the coding gain of lattices I. IEEE Trans. Inf. Theory 42(6): 1796-1807 (1996) - [j46]Vahid Tarokh, Ian F. Blake:
Trellis complexity versus the coding gain of lattices II. IEEE Trans. Inf. Theory 42(6): 1808-1816 (1996) - 1995
- [j45]Dariush Dabiri, Ian F. Blake:
Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials. IEEE Trans. Inf. Theory 41(4): 873-885 (1995) - 1994
- [j44]Tomik Yaghoobian, Ian F. Blake:
Two New Decoding Algorithms for Reed-Solomon Codes. Appl. Algebra Eng. Commun. Comput. 5: 23-43 (1994) - [j43]Marcelo S. Alencar, Ian F. Blake:
The capacity for a discrete-state code division multiple-access channel. IEEE J. Sel. Areas Commun. 12(5): 925-937 (1994) - [j42]Ian F. Blake, Shuhong Gao, Ronald C. Mullin:
Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b. SIAM J. Discret. Math. 7(3): 499-512 (1994) - [j41]Benny C. Y. Wong, Ian F. Blake:
Detection in multivariate non-Gaussian noise. IEEE Trans. Commun. 42(234): 1672-1683 (1994) - [j40]Ian F. Blake:
Review of 'Source and Channel Coding: An Algorithmic Approach' (Anderson, J.B., and Mohan, S.; 1991). IEEE Trans. Inf. Theory 40(1): 289- (1994) - 1993
- [j39]Ian F. Blake, Shuhong Gao, Ronald C. Mullin:
Explicit Factorization of x2k + 1 over Fp with Prime p= 3 mod 4. Appl. Algebra Eng. Commun. Comput. 4: 89-94 (1993) - [c2]Ian F. Blake, Shuhong Gao, Robert J. Lambert:
Constructive problems for irreducible polynominals over finite fields. Information Theory and Applications 1993: 1-23 - 1992
- [j38]Tomik Yaghoobian, Ian F. Blake:
Hermitian Codes as Generalized Reed-Solomon Codes. Des. Codes Cryptogr. 2(1): 5-17 (1992) - 1991
- [j37]Ian F. Blake:
A perspective on coding theory. Inf. Sci. 57-58: 111-118 (1991) - [j36]Ian F. Blake, Khun Kith:
On the Complete Weight Enumerator of Reed-Solomon Codes. SIAM J. Discret. Math. 4(2): 164-171 (1991) - 1990
- [j35]Muzhong Wang, Ian F. Blake:
Bit Serial Multiplication in Finite Fields. SIAM J. Discret. Math. 3(1): 140-148 (1990) - [j34]Benny C. Y. Wong, Ian F. Blake:
An algorithm for the design of generalized quantizers for detection. IEEE Trans. Commun. 38(9): 1384-1390 (1990)
1980 – 1989
- 1989
- [j33]David W. Ash, Ian F. Blake, Scott A. Vanstone:
Low complexity normal bases. Discret. Appl. Math. 25(3): 191-210 (1989) - [j32]Gordon L. Stüber, Jon W. Mark, Ian F. Blake:
Diversity and coding for FH/MFSK systems with fading and jamming. II. Selective diversity. IEEE Trans. Commun. 37(8): 859-869 (1989) - [j31]Guillermo E. Atkin, Ian F. Blake:
Performance of multitone FFH/MFSK systems in the presence of jamming. IEEE Trans. Inf. Theory 35(2): 428-435 (1989) - 1988
- [j30]George H. Freeman, Jon W. Mark, Ian F. Blake:
Trellis source codes designed by conjugate gradient optimization. IEEE Trans. Commun. 36(1): 1-12 (1988) - [j29]Gordon L. Stüber, Jon W. Mark, Ian F. Blake:
An adaptive rate algorithm for FH/BFSK signaling. IEEE Trans. Commun. 36(12): 1269-1276 (1988) - [j28]George H. Freeman, Ian F. Blake, Jon W. Mark:
Trellis source code design as an optimization problem. IEEE Trans. Inf. Theory 34(5): 1226-1241 (1988) - 1987
- [j27]Gordon L. Stüber, Ian F. Blake, Jon W. Mark:
Performance of Adaptive Transmission for FH/MFSK Signaling Over Jammed Fading Channels. IEEE J. Sel. Areas Commun. 5(2): 176-187 (1987) - [j26]Gordon L. Stüber, Jon W. Mark, Ian F. Blake:
Diversity and Coding for FH/MFSK Systems with Fading and Jamming-Part I: Multichannel Diversity. IEEE Trans. Commun. 35(12): 1329-1341 (1987) - [j25]Ian F. Blake, H. Darabian:
Approximations for the probability in the tails of the binomial distribution. IEEE Trans. Inf. Theory 33(3): 426-428 (1987) - 1984
- [j24]Gordon L. Stüber, Jon W. Mark, Ian F. Blake:
Sequence acquisition using bit estimation techniques. Inf. Sci. 32(3): 217-229 (1984) - [c1]Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone:
Computing Logarithms in GF(2n). CRYPTO 1984: 73-82 - 1983
- [j23]Ian F. Blake:
Review of 'Introduction to the Theory of Error-Correcting codes' (Pless, V.; 1982). IEEE Trans. Inf. Theory 29(4): 63 (1983) - 1982
- [j22]Ian F. Blake:
The Enumeration of Certain Run-Length Sequences. Inf. Control. 55(1-3): 222-236 (1982) - [j21]Ian F. Blake:
Performance of Nonorthogonal Signaling on an Asynchronous Multiple Access On-Off Channel. IEEE Trans. Commun. 30(1): 293-298 (1982) - [j20]Ian F. Blake, Jon W. Mark:
A note on complex sequences with low correlations. IEEE Trans. Inf. Theory 28(5): 814-816 (1982)
1970 – 1979
- 1979
- [j19]Reihaneh Safavi-Naini, Ian F. Blake:
Generalized t-Designs and Weighted Majority Decoding. Inf. Control. 42(3): 261-282 (1979) - [j18]Ian F. Blake, Gérard D. Cohen, Mikhail Deza:
Coding with Permutations. Inf. Control. 43(1): 1-19 (1979) - 1978
- [j17]Ian F. Blake, J. J. Stiffler:
A note on generalized Room squares. Discret. Math. 21(1): 89-93 (1978) - [j16]Ian F. Blake, Avraham A. Melkman:
On an inverse for sections of a binomial matrix. Discret. Math. 23(2): 97-104 (1978) - [j15]Ian B. Gibson, Ian F. Blake:
Decoding the binary Golay code with miracle octad generators (Corresp.). IEEE Trans. Inf. Theory 24(2): 261-264 (1978) - 1977
- [j14]Ian F. Blake, Alan G. Konheim:
Big Buckets Are (Are Not) Better! J. ACM 24(4): 591-606 (1977) - 1976
- [j13]Mushfiqur Rahman, Ian F. Blake:
Combinatorial aspects of orthogonal parity checks (Corresp.). IEEE Trans. Inf. Theory 22(6): 759-763 (1976) - 1975
- [b1]Ian F. Blake, Ronald C. Mullin:
The mathematical theory of coding. Acad. Press 1975, ISBN 0121035506, pp. I-XI, 1-356 - [j12]J. J. Stiffler, Ian F. Blake:
An infinite class of generalized room squares. Discret. Math. 12(2): 159-163 (1975) - [j11]Ian F. Blake:
On a Generalization of the Pless Symmetry Codes. Inf. Control. 27(4): 369-373 (1975) - [j10]Ian F. Blake:
Codes over Integer Residue Rings. Inf. Control. 29(4): 295-300 (1975) - [j9]Mushfiqur Rahman, Ian F. Blake:
Majority logic decoding using combinatorial designs (Corresp.). IEEE Trans. Inf. Theory 21(5): 585-587 (1975) - 1974
- [j8]Ian F. Blake:
Configuration matrices of group codes. IEEE Trans. Inf. Theory 20(1): 95-100 (1974) - [j7]Ian F. Blake:
Permutation codes for discrete channels (Corresp.). IEEE Trans. Inf. Theory 20(1): 138-140 (1974) - 1973
- [j6]Ian F. Blake, William C. Lindsey:
Level-crossing problems for random processes. IEEE Trans. Inf. Theory 19(3): 295-315 (1973) - [j5]Ian F. Blake, James H. Gilchrist:
Addresses for graphs. IEEE Trans. Inf. Theory 19(5): 683-688 (1973) - 1972
- [j4]Ian F. Blake:
Codes Over Certain Rings. Inf. Control. 20(4): 396-404 (1972) - 1971
- [j3]Ian F. Blake:
The Leech Lattice as a Code for the Gaussian Channel. Inf. Control. 19(1): 66-74 (1971)
1960 – 1969
- 1969
- [j2]Ian F. Blake:
Linear filtering and piecewise linear correlation functions. IEEE Trans. Inf. Theory 15(3): 345-349 (1969) - 1968
- [j1]Ian F. Blake, John B. Thomas:
On a class of processes arising in linear estimation theory. IEEE Trans. Inf. Theory 14(1): 12-16 (1968)
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-04-25 05:52 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:
