AAAAAA

   
Results: 1-13 |
Results: 13
Equireplicate balanced binary codes for oligo arrays
Authors: Alon, N Colbourn, CJ Ling, ACH Tompa, M
Citation: N. Alon et al., Equireplicate balanced binary codes for oligo arrays, SIAM J DISC, 14(4), 2001, pp. 481-497
Quorum systems constructed from combinatorial designs
Authors: Colbourn, CJ Dinitz, JH Stinson, DR
Citation: Cj. Colbourn et al., Quorum systems constructed from combinatorial designs, INF COMPUT, 169(2), 2001, pp. 160-173
Minimizing drop cost for SONET/WDM networks with 1/8 wavelength requirements
Authors: Colbourn, CJ Wan, PJ
Citation: Cj. Colbourn et Pj. Wan, Minimizing drop cost for SONET/WDM networks with 1/8 wavelength requirements, NETWORKS, 37(2), 2001, pp. 107-116
Coding, cryptography, and computer security - Preface
Authors: Colbourn, CJ Kharaghani, H
Citation: Cj. Colbourn et H. Kharaghani, Coding, cryptography, and computer security - Preface, DISCR APP M, 102(1-2), 2000, pp. 1-1
Asymptotically optimal erasure-resilient codes for large disk arrays
Authors: Chee, YM Colbourn, CJ Ling, ACH
Citation: Ym. Chee et al., Asymptotically optimal erasure-resilient codes for large disk arrays, DISCR APP M, 102(1-2), 2000, pp. 3-36
Sharper bounds in adaptive group testing
Authors: Riccio, L Colbourn, CJ
Citation: L. Riccio et Cj. Colbourn, Sharper bounds in adaptive group testing, TAIWAN J M, 4(4), 2000, pp. 669-673
Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems
Authors: Colbourn, CJ Zhao, SF
Citation: Cj. Colbourn et Sf. Zhao, Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems, DES CODES C, 20(3), 2000, pp. 219-227
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
Authors: Archdeacon, D Colbourn, CJ Gitler, I Provan, JS
Citation: D. Archdeacon et al., Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs, J GRAPH TH, 33(2), 2000, pp. 83-93
Transversal designs in classical planes and spaces
Authors: Bruen, AA Colbourn, CJ
Citation: Aa. Bruen et Cj. Colbourn, Transversal designs in classical planes and spaces, J COMB TH A, 92(1), 2000, pp. 88-94
Construction techniques for anti-Pasch Steiner triple systems
Authors: Ling, ACH Colbourn, CJ Grannell, MJ Griggs, TS
Citation: Ach. Ling et al., Construction techniques for anti-Pasch Steiner triple systems, J LOND MATH, 61, 2000, pp. 641-657
Quorums from difference covers
Authors: Colbourn, CJ Ling, ACH
Citation: Cj. Colbourn et Ach. Ling, Quorums from difference covers, INF PROCESS, 75(1-2), 2000, pp. 9-12
Grade of service Steiner trees in series-parallel networks
Authors: Colbourn, CJ Xue, GL
Citation: Cj. Colbourn et Gl. Xue, Grade of service Steiner trees in series-parallel networks, COM OPT (S), 6, 2000, pp. 163-174
Covering arrays of strength three
Authors: Chateauneuf, MA Colbourn, CJ Kreher, DL
Citation: Ma. Chateauneuf et al., Covering arrays of strength three, DES CODES C, 16(3), 1999, pp. 235-242
Risultati: 1-13 |