default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan C. H. Ling
Alan Chi Hung Ling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j92]Yeow Meng Chee
, Alan Chi Hung Ling, Van Khu Vu, Hui Zhang:
Scheduling to reduce close contacts: resolvable grid graph decomposition and packing. Des. Codes Cryptogr. 91(12): 4093-4106 (2023)- 2020
- [j91]Yeow Meng Chee, Charles J. Colbourn, Hoang Dau, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic:
Access balancing in storage systems by labeling partial Steiner systems. Des. Codes Cryptogr. 88(11): 2361-2376 (2020) - [c8]Yeow Meng Chee, Charles Joseph Colbourn, Hoang Dau, Ryan Gabrys, Alan Chi Hung Ling, Dylan Lusi, Olgica Milenkovic:
Access Balancing in Storage Systems by Labeling Partial Steiner Systems. ISIT 2020: 566-570
2010 – 2019
- 2019
- [j90]Yeow Meng Chee, Fei Gao, Han Mao Kiah, Alan Chi Hung Ling, Hui Zhang, Xiande Zhang:
Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families. SIAM J. Discret. Math. 33(1): 209-229 (2019) - [i10]Yeow Meng Chee, Charles J. Colbourn, Hoang Dau, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic:
Access Balancing in Storage Systems by Labeling Partial Steiner Systems. CoRR abs/1906.12073 (2019) - 2017
- [j89]Peter J. Dukes, Alan C. H. Ling:
Relative Difference Sets Partitioned by Cosets. Electron. J. Comb. 24(3): 3 (2017) - 2016
- [j88]Peter J. Dukes, Alan C. H. Ling, Amanda Malloch:
Thickly-resolvable block designs. Australas. J Comb. 64: 379-391 (2016) - [j87]Peter J. Dukes, Esther R. Lamken, Alan C. H. Ling:
Resolvable Group Divisible Designs with Large Groups. Electron. J. Comb. 23(4): 4 (2016) - [j86]Peter J. Dukes, Tao Feng, Alan C. H. Ling:
Matching divisible designs with block size four. Discret. Math. 339(2): 790-799 (2016) - 2015
- [j85]Yeow Meng Chee, Charles J. Colbourn, Alan Chi Hung Ling, Hui Zhang, Xiande Zhang:
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses. Des. Codes Cryptogr. 77(2-3): 479-491 (2015) - [j84]Peter J. Dukes, Tao Feng, Alan C. H. Ling:
A finite embedding theorem for partial Steiner 3-designs. Finite Fields Their Appl. 33: 29-36 (2015) - [j83]Peter J. Dukes, Alan C. H. Ling:
Graph Divisible Designs and Packing Constructions. Graphs Comb. 31(6): 2181-2191 (2015) - 2014
- [j82]Charles C. Y. Lam, Alan C. H. Ling:
A Construction of Modular Generalized Sidon Sets. Ars Comb. 114: 65-71 (2014) - [j81]Peter Dukes, Alan C. H. Ling:
Pairwise Balanced Designs with Prescribed Minimum Dimension. Discret. Comput. Geom. 51(2): 485-494 (2014) - [c7]Yeow Meng Chee, Fei Gao, Han Mao Kiah, Alan Chi Hung Ling, Hui Zhang, Xiande Zhang:
Decompositions of edge-colored digraphs: A new technique in the construction of constant-weight codes and related families. ISIT 2014: 1436-1440 - 2013
- [j80]Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling, Richard M. Wilson:
Covering and packing for pairs. J. Comb. Theory A 120(7): 1440-1449 (2013) - 2012
- [j79]Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, Violet R. Syrotiuk:
Grooming traffic to minimize load. Discret. Math. 312(3): 536-544 (2012) - [c6]Yeow Meng Chee, Han Mao Kiah, Alan C. H. Ling, Chengmin Wang:
Optimal equitable symbol weight codes for power line communications. ISIT 2012: 666-670 - 2011
- [j78]Charles J. Colbourn, Gennian Ge, Alan C. H. Ling:
Optical grooming with grooming ratio nine. Discret. Math. 311(1): 8-15 (2011) - 2010
- [j77]Alan C. H. Ling:
On the existence of well-ordered Steiner triple systems. Ars Comb. 95 (2010) - [j76]Yeow Meng Chee, Gennian Ge, Alan C. H. Ling:
Spectrum of Sizes for Perfect Deletion-Correcting Codes. SIAM J. Discret. Math. 24(1): 33-55 (2010) - [j75]Yeow Meng Chee, Son Hoang Dau, Alan C. H. Ling, San Ling:
Linear size optimal q-ary constant-weight codes and constant-composition codes. IEEE Trans. Inf. Theory 56(1): 140-151 (2010) - [j74]Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin:
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization. IEEE Trans. Inf. Theory 56(11): 5738-5746 (2010) - [i9]Yeow Meng Chee, Gennian Ge, Alan C. H. Ling:
Spectrum of Sizes for Perfect Deletion-Correcting Codes. CoRR abs/1008.1343 (2010) - [i8]Yeow Meng Chee, Son Hoang Dau, Alan C. H. Ling, San Ling:
Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes. CoRR abs/1008.1611 (2010) - [i7]Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin:
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization. CoRR abs/1008.1615 (2010)
2000 – 2009
- 2009
- [j73]Charles J. Colbourn, Gennian Ge, Alan C. H. Ling:
Optical grooming with grooming ratio eight. Discret. Appl. Math. 157(13): 2763-2772 (2009) - [j72]Charles J. Colbourn, Alan C. H. Ling:
Linear hash families and forbidden configurations. Des. Codes Cryptogr. 52(1): 25-55 (2009) - [j71]Alan C. H. Ling, Charles J. Colbourn, Gaetano Quattrocchi:
Minimum embedding of Steiner triple systems into (K4-e)-designs II. Discret. Math. 309(2): 400-411 (2009) - [j70]R. Julian R. Abel, Gennian Ge, Malcolm Greig, Alan C. H. Ling:
Further results on (v, {5, w*}, 1)-PBDs. Discret. Math. 309(8): 2323-2339 (2009) - [j69]Jeffrey H. Dinitz, Alan C. H. Ling, Peter Danziger:
Maximum uniformly resolvable designs with block sizes 2 and 4. Discret. Math. 309(14): 4716-4721 (2009) - [j68]Charles J. Colbourn, Gennian Ge, Alan C. H. Ling:
Graph designs for the eight-edge five-vertex graphs. Discret. Math. 309(22): 6440-6445 (2009) - [j67]Peter Dukes, Alan C. H. Ling:
Linear spaces with small generated subspaces. J. Comb. Theory A 116(2): 485-493 (2009) - [j66]Charles J. Colbourn, Alan C. H. Ling:
A recursive construction for perfect hash families. J. Math. Cryptol. 3(4): 291-306 (2009) - [j65]Rucong Zhang, Gennian Ge, Alan C. H. Ling, Hung-Lin Fu, Yukiyasu Mutoh:
The Existence of r×4 Grid-Block Designs with r=3, 4. SIAM J. Discret. Math. 23(2): 1045-1062 (2009) - [j64]A. J. Wolfe, Alan C. H. Ling, Jeffrey H. Dinitz:
The Existence of N2 Resolvable Latin Squares. SIAM J. Discret. Math. 23(3): 1217-1237 (2009) - [j63]Yeow Meng Chee, Alan C. H. Ling:
Limit on the Addressability of Fault-Tolerant Nanowire Decoders. IEEE Trans. Computers 58(1): 60-68 (2009) - [i6]Yeow Meng Chee, Alan C. H. Ling:
Limit on the Addressability of Fault-Tolerant Nanowire Decoders. CoRR abs/0901.4694 (2009) - 2008
- [j62]Peter Dukes, Alan C. H. Ling:
Note edge-colourings of K n, n with no long two-coloured cycles. Comb. 28(3): 373-378 (2008) - [j61]Gennian Ge, Malcolm Greig, Alan C. H. Ling, Rolf S. Rees:
Resolvable balanced incomplete block designs with subdesigns of block size 4. Discret. Math. 308(13): 2674-2703 (2008) - [j60]Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling:
Constructing strength three covering arrays with augmented annealing. Discret. Math. 308(13): 2709-2722 (2008) - [j59]Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi:
Minimum embedding of Steiner triple systems into (K4-e)-designs I. Discret. Math. 308(22): 5308-5311 (2008) - [j58]Yeow Meng Chee, Alan C. H. Ling, Hao Shen:
The Fine Intersection Problem for Steiner Triple Systems. Graphs Comb. 24(3): 149-157 (2008) - [j57]Zhen He, Xiaoyang Sean Wang, Byung Suk Lee, Alan C. H. Ling:
Mining partial periodic correlations in time series. Knowl. Inf. Syst. 15(1): 31-54 (2008) - [j56]Charles J. Colbourn, Hung-Lin Fu, Gennian Ge, Alan C. H. Ling, Hui-Chuan Lu:
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven. SIAM J. Discret. Math. 23(1): 109-122 (2008) - [j55]Gennian Ge, Alan C. H. Ling, Ying Miao:
A Systematic Construction for Radar Arrays. IEEE Trans. Inf. Theory 54(1): 410-414 (2008) - [j54]Yeow Meng Chee, Son Hoang Dau, Alan C. H. Ling, San Ling:
The Sizes of Optimal q -Ary Codes of Weight Three and Distance Four: A Complete Solution. IEEE Trans. Inf. Theory 54(3): 1291-1295 (2008) - [j53]Yeow Meng Chee, Gennian Ge, Alan C. H. Ling:
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three. IEEE Trans. Inf. Theory 54(8): 3552-3564 (2008) - [i5]Yeow Meng Chee, Son Hoang Dau, Alan C. H. Ling, San Ling:
The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four: A Complete Solution. CoRR abs/0803.3658 (2008) - [i4]Yeow Meng Chee, Gennian Ge, Alan C. H. Ling:
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three. CoRR abs/0807.2680 (2008) - 2007
- [j52]Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson:
Perfect hash families from transversal designs. Australas. J Comb. 37: 233-242 (2007) - [j51]Yeow Meng Chee, Alan C. H. Ling:
On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges. SIAM J. Discret. Math. 21(3): 805-821 (2007) - [j50]Gennian Ge, Alan C. H. Ling:
On the Existence of K5 \setminuse-Designs with Application to Optical Networks. SIAM J. Discret. Math. 21(4): 851-864 (2007) - [j49]Yeow Meng Chee, Alan C. H. Ling, San Ling, Hao Shen:
The PBD-Closure of Constant-Composition Codes. IEEE Trans. Inf. Theory 53(8): 2685-2692 (2007) - [i3]Yeow Meng Chee, Alan C. H. Ling, San Ling, Hao Shen:
The PBD-Closure of Constant-Composition Codes. CoRR abs/0712.2552 (2007) - [i2]Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling:
Optimal Memoryless Encoding for Low Power Off-Chip Data Buses. CoRR abs/0712.2640 (2007) - 2006
- [j48]Dan He, Abdullah N. Arslan, Alan C. H. Ling:
A Fast Algorithm for the Constrained Multiple Sequence Alignment Problem. Acta Cybern. 17(4): 701-717 (2006) - [j47]Gennian Ge, Esther R. Lamken, Alan C. H. Ling:
Scheduling CCRR tournaments. J. Comb. Theory A 113(2): 352-379 (2006) - [j46]Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson:
Fault-tolerant routings with minimum optical index. Networks 48(1): 47-55 (2006) - [c5]Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling:
Optimal memoryless encoding for low power off-chip data buses. ICCAD 2006: 369-374 - [c4]Katerina Simonova, Alan C. H. Ling, Xiaoyang Sean Wang:
Location-aware key predistribution scheme for wide area wireless sensor networks. SASN 2006: 157-168 - 2005
- [j45]Gennian Ge, Alan C. H. Ling:
Group Divisible Designs with Block Size Four and Group Type gum1 with Minimum m. Des. Codes Cryptogr. 34(1): 117-126 (2005) - [j44]Gennian Ge, Clement W. H. Lam, Alan C. H. Ling, Hao Shen:
Resolvable Maximum Packings with Quadruples. Des. Codes Cryptogr. 35(3): 287-302 (2005) - [j43]Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi:
Embedding path designs into kite systems. Discret. Math. 297(1-3): 38-48 (2005) - [j42]Gennian Ge, Alan C. H. Ling:
Constructions of Quad-Rooted Double Covers. Graphs Comb. 21(2): 231-238 (2005) - [j41]Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, Xavier Muñoz:
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. SIAM J. Discret. Math. 19(2): 523-542 (2005) - 2004
- [j40]Hans-Dietrich O. F. Gronau, Donald L. Kreher, Alan C. H. Ling:
Super-simple (v, 5, 2)-designs. Discret. Appl. Math. 138(1-2): 65-77 (2004) - [j39]Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk:
Cover-Free Families and Topology-Transparent Scheduling for MANETs. Des. Codes Cryptogr. 32(1-3): 65-95 (2004) - [j38]Gennian Ge, Alan C. H. Ling:
A survey on resolvable group divisible designs with block size four. Discret. Math. 279(1-3): 225-245 (2004) - [j37]Alan C. H. Ling, Pak Ching Li, G. H. John van Rees:
Splitting systems and separating systems. Discret. Math. 279(1-3): 355-368 (2004) - [j36]Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu:
Grooming in unidirectional rings: K4-e designs. Discret. Math. 284(1-3): 57-62 (2004) - [j35]Gennian Ge, Alan C. H. Ling:
Group divisible designs with block size four and group type gum1 for small g. Discret. Math. 285(1-3): 97-120 (2004) - [j34]Gennian Ge, Alan C. H. Ling:
A systematic approach to some block design constructions. J. Comb. Theory A 108(1): 89-97 (2004) - [j33]Peter Dukes, Alan C. H. Ling:
A combinatorial error bound for t-point-based sampling. Theor. Comput. Sci. 310(1-3): 479-488 (2004) - [j32]Charles J. Colbourn, Torleiv Kløve, Alan C. H. Ling:
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares. IEEE Trans. Inf. Theory 50(6): 1289-1291 (2004) - 2003
- [j31]Hui Kheng Aw, Yeow Meng Chee, Alan C. H. Ling:
Six New Constant Weight Binary Codes. Ars Comb. 67 (2003) - [j30]Alan C. H. Ling:
Some applications of combinatorial designs to extremal graph theory. Ars Comb. 67 (2003) - [j29]Darryn E. Bryant, Heather Gavlas, Alan C. H. Ling:
Skolem-type Difference Sets for Cycle Systems. Electron. J. Comb. 10 (2003) - [j28]Gennian Ge, Alan C. H. Ling:
A new construction for Z-cyclic whist tournaments. Discret. Appl. Math. 131(3): 643-650 (2003) - [j27]Charles J. Colbourn, Alan C. H. Ling:
Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs. Discret. Math. 261(1-3): 141-156 (2003) - [j26]Jeffrey H. Dinitz, Esther R. Lamken, Alan C. H. Ling:
Complementary partial resolution squares for Steiner triple systems. Discret. Math. 261(1-3): 243-254 (2003) - [j25]Donald L. Kreher, Alan C. H. Ling, Rolf S. Rees, Clement W. H. Lam:
A note on {4}-GDDs of type 210. Discret. Math. 261(1-3): 373-376 (2003) - [j24]Alan C. H. Ling:
An application of splittable 4-frames to coloring of Kn, n. Discret. Math. 261(1-3): 377-382 (2003) - [j23]Jeffrey H. Dinitz, Peter Dukes, Alan C. H. Ling:
Sets of three pairwise orthogonal Steiner triple systems. J. Comb. Theory A 101(1): 90-116 (2003) - [j22]Robert E. Jamison, Tao Jiang, Alan C. H. Ling:
Constrained Ramsey numbers of graphs. J. Graph Theory 42(1): 1-16 (2003) - [c3]Charles J. Colbourn, Violet R. Syrotiuk, Alan C. H. Ling:
Steiner Systems for Topology-Transparent Access Control in MANETs. ADHOC-NOW 2003: 247-258 - [c2]Violet R. Syrotiuk, Charles J. Colbourn, Alan C. H. Ling:
Topology-transparent scheduling for MANETs using orthogonal arrays. DIALM-POMC 2003: 43-49 - [c1]Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling:
Augmenting Simulated Annealing to Build Interaction Test Suites. ISSRE 2003: 394-405 - 2002
- [j21]Alan C. H. Ling:
Packings with block size five and index one: v \equiv 2 (mod 4). Ars Comb. 63 (2002) - [j20]Brett Stevens, Alan C. H. Ling, Eric Mendelsohn:
A direct construction of transversal covers using group divisible designs. Ars Comb. 63 (2002) - [j19]Charles J. Colbourn, Alan C. H. Ling, Martin Tompa:
Construction of optimal quality control for oligo arrays. Bioinform. 18(4): 529-535 (2002) - [j18]Charles J. Colbourn, Esther R. Lamken, Alan C. H. Ling, W. H. Mills:
The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs. Des. Codes Cryptogr. 26(1-3): 169-196 (2002) - [j17]Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis:
Totally magic graphs. Discret. Math. 254(1-3): 103-113 (2002) - [j16]Yeow Meng Chee, Alan C. H. Ling:
Uniform Group Divisible Designs with Block Sizes Three and n. Graphs Comb. 18(3): 421-445 (2002) - [j15]Myra B. Cohen, Charles J. Colbourn, Lee A. Ives, Alan C. H. Ling:
Kirkman triple systems of order 21 with nontrivial automorphism group. Math. Comput. 71(238): 873-881 (2002) - [j14]Alan C. H. Ling:
Difference triangle sets from affine planes. IEEE Trans. Inf. Theory 48(8): 2399-2401 (2002) - 2001
- [j13]Charles J. Colbourn, Alan C. H. Ling:
(M, S)-optimal designs with block size three. Australas. J Comb. 23: 171-180 (2001) - [j12]Jeffrey H. Dinitz, Alan C. H. Ling:
The existence of referee squares. Discret. Math. 232(1-3): 109-112 (2001) - [j11]Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa:
Equireplicate Balanced Binary Codes for Oligo Arrays. SIAM J. Discret. Math. 14(4): 481-497 (2001) - [i1]M. A. Chateauneuf, Alan C. H. Ling, Douglas R. Stinson:
Slope packings and coverings, and generic algorithms for the discrete logarithm problem. IACR Cryptol. ePrint Arch. 2001: 94 (2001) - 2000
- [j10]Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling:
Asymptotically optimal erasure-resilient codes for large disk arrays. Discret. Appl. Math. 102(1-2): 3-36 (2000) - [j9]Alan C. H. Ling, Charles J. Colbourn:
Modified group divisible designs with block size four. Discret. Math. 219(1-3): 207-221 (2000) - [j8]Charles J. Colbourn, Alan C. H. Ling:
Quorums from difference covers. Inf. Process. Lett. 75(1-2): 9-12 (2000)
1990 – 1999
- 1999
- [j7]Charles J. Colbourn, Alan C. H. Ling:
Balanced sampling plans with block size four excluding contiguous units. Australas. J Comb. 20: 37-46 (1999) - [j6]Charles J. Colbourn, Alan C. H. Ling:
Kirkman school project designs. Discret. Math. 203(1-3): 49-60 (1999) - 1998
- [j5]Alan C. H. Ling, Charles J. Colbourn:
Deleting Lines in Projective Planes. Ars Comb. 50 (1998) - [j4]Charles J. Colbourn, Alan C. H. Ling:
Point Code Minimum Steiner Triple Systems. Des. Codes Cryptogr. 14(2): 141-146 (1998) - 1997
- [j3]Ronald C. Mullin, Alan C. H. Ling, R. Julian R. Abel, Frank E. Bennett:
On the Closure of Subsets of {4, 5, ..., 9} which contain {4}. Ars Comb. 45 (1997) - [j2]Alan C. H. Ling, Xiaojun Zhu, Charles J. Colbourn, Ronald C. Mullin:
Pairwise Balanced Designs with Consecutive Block Sizes. Des. Codes Cryptogr. 10(2): 203-222 (1997) - [j1]Charles J. Colbourn, Alan C. H. Ling:
Pairwise Balanced Designs with Block Sizes 8, 9, and 10. J. Comb. Theory A 77(2): 228-245 (1997)
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-06-10 20:28 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:
