au.\*:("COLBOURN, Charles J")
Results 1 to 25 of 47
Selection :
Projective planes and congestion-free networksCOLBOURN, Charles J.Discrete applied mathematics. 2002, Vol 122, Num 1-3, pp 117-126, issn 0166-218XArticle
Optimal (n, 4,2)-OOC of small ordersWENSONG CHU; COLBOURN, Charles J.Discrete mathematics. 2004, Vol 279, Num 1-3, pp 163-172, issn 0012-365X, 10 p.Article
Optimal frequency-hopping sequences via cyclotomyWENSONG CHU; COLBOURN, Charles J.IEEE transactions on information theory. 2005, Vol 51, Num 3, pp 1139-1141, issn 0018-9448, 3 p.Article
Sequence designs for ultra-wideband impulse radio with optimal correlation propertiesWENSONG CHU; COLBOURN, Charles J.IEEE transactions on information theory. 2004, Vol 50, Num 10, pp 2402-2407, issn 0018-9448, 6 p.Article
Compressive Sensing Matrices and Hash FamiliesCOLBOURN, Charles J; HORSLEY, Daniel; MCLEAN, Christopher et al.IEEE transactions on communications. 2011, Vol 59, Num 7, pp 1840-1845, issn 0090-6778, 6 p.Article
Grooming for Two-Period Optical NetworksCOLBOURN, Charles J; QUATTROCCHI, Gaetano; SYROTIUK, Violet R et al.Networks (New York, NY). 2008, Vol 52, Num 4, pp 307-324, issn 0028-3045, 18 p.Article
On constant composition codesWENSONG CHU; COLBOURN, Charles J; DUKES, Peter et al.Discrete applied mathematics. 2006, Vol 154, Num 6, pp 912-929, issn 0166-218X, 18 p.Article
Minimizing drop cost for SONET/WDM networks with 1/8 wavelength requirementsCOLBOURN, Charles J; WAN, Peng-Jun.Networks (New York, NY). 2001, Vol 37, Num 2, pp 107-116, issn 0028-3045Article
Multiterminal resilience for series-parallel networksFARLEY, Toni R; COLBOURN, Charles J.Networks (New York, NY). 2007, Vol 50, Num 2, pp 164-172, issn 0028-3045, 9 p.Article
Lower Bounds for Two-Period Grooming via Linear Programming DualityCOLBOURN, Charles J; QUATTROCCHI, Gaetano; SYROTIUK, Violet R et al.Networks (New York, NY). 2008, Vol 52, Num 4, pp 299-306, issn 0028-3045, 8 p.Article
Tabu search for covering arrays using permutation vectorsWALKER, Robert A; COLBOURN, Charles J.Journal of statistical planning and inference. 2009, Vol 139, Num 1, pp 69-80, issn 0378-3758, 12 p.Article
Quorum systems constructed from combinatorial designsCOLBOURN, Charles J; DINITZ, Jeffrey H; STINSON, Douglas R et al.Information and computation (Print). 2001, Vol 169, Num 2, pp 160-173, issn 0890-5401Article
Cluttered orderings for the complete graphCOHEN, Myra B; COLBOURN, Charles J; FRONCEK, Dalibor et al.Lecture notes in computer science. 2001, pp 420-431, issn 0302-9743, isbn 3-540-42494-6Conference Paper
Mixed covering arrays of strength three with few factorsCOLBOURN, Charles J; CE SHI; CHENGMIN WANG et al.Journal of statistical planning and inference. 2011, Vol 141, Num 11, pp 3640-3647, issn 0378-3758, 8 p.Article
Optical grooming with grooming ratio nineCOLBOURN, Charles J; GENNIAN GE; LING, Alan C. H et al.Discrete mathematics. 2011, Vol 311, Num 1, pp 8-15, issn 0012-365X, 8 p.Article
Construction of optimal quality control for oligo arraysCOLBOURN, Charles J; LING, Alan C. H; TOMPA, Martin et al.Bioinformatics (Oxford. Print). 2002, Vol 18, Num 4, pp 529-535, issn 1367-4803Article
Monte Carlo and Markov chain techniques for network reliability and samplingBUCHSBAUM, A. L; MIHAIL, M.Networks (New York, NY). 1995, Vol 25, Num 3, pp 117-130, issn 0028-3045Article
On the asymptotic existence of partial complex Hadamard matrices and related combinatorial objectsDE LAUNEY, W.Discrete applied mathematics. 2000, Vol 102, Num 1-2, pp 37-45, issn 0166-218XConference Paper
Software performance testing using covering arrays : Efficient screening designs with categorical factorsHOSKINS, Dean S; COLBOURN, Charles J; MONTGOMERY, Douglas C et al.International Workshop on Software and Performance. 2005, pp 131-136, isbn 1-59593-087-6, 1Vol, 6 p.Conference Paper
Minimum weights of point codes of Steiner triple systemsCOLBOURN, Charles J.Journal of statistical planning and inference. 2001, Vol 95, Num 1-2, pp 161-166, issn 0378-3758Article
On cocyclic weighing matrices and the regular group actions of certain paley matricesDE LAUNEY, W; STAFFORD, R. M.Discrete applied mathematics. 2000, Vol 102, Num 1-2, pp 63-101, issn 0166-218XConference Paper
Homogeneous bent functionsCHENGXIN QU; SEBERRY, J; PIEPRZYK, J et al.Discrete applied mathematics. 2000, Vol 102, Num 1-2, pp 133-139, issn 0166-218XConference Paper
Optimal and pessimal orderings of Steiner triple systems in disk arraysCOHEN, Myra B; COLBOURN, Charles J.Theoretical computer science. 2003, Vol 297, Num 1-3, pp 103-117, issn 0304-3975, 15 p.Conference Paper
Equireplicate balanced binary codes for oligo arraysALON, Noga; COLBOURN, Charles J; LING, Alan C. H et al.SIAM journal on discrete mathematics (Print). 2001, Vol 14, Num 4, pp 481-497, issn 0895-4801Article
Just-in-Time Scheduling for Multichannel EPONsMCGARRY, Michael P; REISSLEIN, Martin; COLBOURN, Charles J et al.Journal of lightwave technology. 2008, Vol 26, Num 9-12, pp 1204-1216, issn 0733-8724, 13 p.Article