Find Scholarly Works

Search in all content

Filters for Scholarly Works

Search concepts
Selected Filters

Publication Year

  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011

Author

  • Charles Colbourn
2017

Faithful enclosing of triple systems: A generalization of stern’s theorem

Bigelow, D. C. & Colbourn, C., Jan 1 2017, Graphs, Matrices, and Designs. CRC Press, p. 31-42 12 p.

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Scopus citations
2013

Expected time to detection of interaction faults

Bryce, R. C. & Colbourn, C., Aug 1 2013, In : Journal of Combinatorial Mathematics and Combinatorial Computing. 86, p. 87-110 24 p.

Research output: Contribution to journalArticle

4 Scopus citations
2014

Foreword

Colbourn, C., Jan 1 2014, In : SpringerBriefs in Computer Science. 9783662434284, p. v

Research output: Contribution to journalEditorial

2019

Partitioned search with column resampling for locating array construction

Lanus, E., Colbourn, C. J. & Montgomery, D. C., Apr 2019, Proceedings - 2019 IEEE 12th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2019. Institute of Electrical and Electronics Engineers Inc., p. 214-223 10 p. 8728931. (Proceedings - 2019 IEEE 12th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2019).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations
2011

Efficient conditional expectation algorithms for constructing hash families

Colbourn, C., Nov 28 2011, Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Revised Selected Papers. p. 144-155 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7056 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations
2018

On a latin square problem of fuchs

Colbourn, C., Jan 1 2018, In : Australasian Journal of Combinatorics. 71, 3, p. 501-536 36 p.

Research output: Contribution to journalArticle

1 Scopus citations

Separating interaction effects using locating and detecting arrays

Seidel, S. A., Sarkar, K., Colbourn, C. & Syrotiuk, V., Jan 1 2018, Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Proceedings. Leong, H. W., Iliopoulos, C. & Sung, W-K. (eds.). Springer Verlag, p. 349-360 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10979 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations
2013

Randomized post-optimization for t-restrictions

Colbourn, C. & Nayeri, P., Apr 15 2013, Information Theory, Combinatorics, and Search Theory: In Memory of Rudolf Ahlswede. Aydinian, H., Deppe, C. & Cicalese, F. (eds.). p. 597-608 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7777).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations
2015

Steiner loops satisfying moufang’s theorem

Colbourn, C., Giuliani, M. D. L. M., Rosa, A. & Stuhl, I., Aug 20 2015, In : Australasian Journal of Combinatorics. 63, 1, p. 170-181 12 p.

Research output: Contribution to journalArticle

3 Scopus citations
2019

Robustness of recovery in locating array-based screening experiments

Seidel, S. A., Colbourn, C. J. & Syrotiuk, V. R., Jan 1 2019, Simulation Series. 4 ed. The Society for Modeling and Simulation International, (Simulation Series; vol. 51, no. 4).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2018

Analysis of large-scale experimental data from wireless networks

Seidel, S. A., Mehari, M. T., Colbourn, C., De Poorter, E., Moerman, I. & Syrotiuk, V., Jul 6 2018, INFOCOM 2018 - IEEE Conference on Computer Communications Workshops. Institute of Electrical and Electronics Engineers Inc., p. 535-540 6 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations
2013

Topological persistence for medium access control

Lutz, J., Colbourn, C. & Syrotiuk, V., Jul 19 2013, In : IEEE Transactions on Mobile Computing. 12, 8, p. 1598-1612 15 p., 6212511.

Research output: Contribution to journalArticle

2 Scopus citations
2012

Strengthening hash families and compressive sensing

Colbourn, C., Horsley, D. & Syrotiuk, V., Oct 1 2012, In : Journal of Discrete Algorithms. 16, p. 170-186 17 p.

Research output: Contribution to journalArticle

5 Scopus citations

Trails of triples in partial triple systems

Colbourn, C., Horsley, D. & Wang, C., Dec 1 2012, In : Designs, Codes, and Cryptography. 65, 3, p. 199-212 14 p.

Research output: Contribution to journalArticle

4 Scopus citations
2015

Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses

Chee, Y. M., Colbourn, C., Ling, A. C. H., Zhang, H. & Zhang, X., Dec 3 2015, In : Designs, Codes, and Cryptography. 77, 2-3, p. 479-491 13 p.

Research output: Contribution to journalArticle

2011

Compressive sensing matrices and hash families

Colbourn, C., Horsley, D. & McLean, C., Jul 1 2011, In : IEEE Transactions on Communications. 59, 7, p. 1840-1845 6 p., 5773644.

Research output: Contribution to journalArticle

14 Scopus citations
2019

Genetic algorithms for affine transformations to existential T-restrictions

Dougherty, R. E., Colbourn, C. J., Lanus, E. & Forrest, S., Jul 13 2019, GECCO 2019 Companion - Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion. Association for Computing Machinery, Inc, p. 1707-1708 2 p. (GECCO 2019 Companion - Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2015

Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures

Nie, C., Wu, H., Niu, X., Kuo, F. C., Leung, H. & Colbourn, C., 2015, In : Information and Software Technology. 62, 1, p. 198-213 16 p.

Research output: Contribution to journalArticle

28 Scopus citations
2013

The Existence of (K2 × K6)-Designs

Wang, C. & Colbourn, C., Sep 1 2013, In : Graphs and Combinatorics. 29, 5, p. 1557-1567 11 p.

Research output: Contribution to journalArticle

2 Scopus citations
2015

Augmentation of Covering Arrays of Strength Two

Colbourn, C., Jan 13 2015, In : Graphs and Combinatorics. 31, 6, p. 2137-2147 11 p.

Research output: Contribution to journalArticle

3 Scopus citations
2018

Improved Strength Four Covering Arrays with Three Symbols

Maity, S., Akhtar, Y., Chandrasekharan, R. C. & Colbourn, C., Jan 1 2018, In : Graphs and Combinatorics. 34, 1, p. 223-239 17 p.

Research output: Contribution to journalArticle

1 Scopus citations

Fractal Perfect Hash Families (Extended Abstract)

Colbourn, C. & Dougherty, R. E., Mar 1 2018, In : Electronic Notes in Discrete Mathematics. 65, p. 37-42 6 p.

Research output: Contribution to journalArticle

2015

Preface

Colbourn, C., 2015, In : Unknown Journal. 133, p. V-VI

Research output: Contribution to journalArticle

2017

Variable-weight topology-transparent scheduling

Lutz, J., Colbourn, C. & Syrotiuk, V., Jul 20 2017, In : Computer Networks. 122, p. 16-28 13 p.

Research output: Contribution to journalArticle

5 Scopus citations
2012

Grooming traffic to minimize load

Colbourn, C., Ling, A. C. H., Quattrocchi, G. & Syrotiuk, V., Feb 6 2012, In : Discrete Mathematics. 312, 3, p. 536-544 9 p.

Research output: Contribution to journalArticle

1 Scopus citations
2017

Upper bounds on the size of covering arrays

Sarkar, K. & Colbourn, C., 2017, In : SIAM Journal on Discrete Mathematics. 31, 2, p. 1277-1293 17 p.

Research output: Contribution to journalArticle

14 Scopus citations
2019

Two-stage algorithms for covering array construction

Sarkar, K. & Colbourn, C. J., Aug 2019, In : Journal of Combinatorial Designs. 27, 8, p. 475-505 31 p.

Research output: Contribution to journalArticle

2 Scopus citations
2013

Doubly resolvable nearly Kirkman triple systems

Abel, R. J. R., Chan, N., Colbourn, C., Lamken, E. R., Wang, C. & Wang, J., Aug 1 2013, In : Journal of Combinatorial Designs. 21, 8, p. 342-358 17 p.

Research output: Contribution to journalArticle

12 Scopus citations
2017

Compressed Sensing with Combinatorial Designs: Theory and Simulations

Bryant, D., Colbourn, C., Horsley, D. & O Cathain, P., Aug 2017, In : IEEE Transactions on Information Theory. 63, 8, p. 4850-4859 10 p., 7954982.

Research output: Contribution to journalArticle

2 Scopus citations
2016

Disjoint spread systems and fault location

Colbourn, C., Fan, B. & Horsley, D., 2016, In : SIAM Journal on Discrete Mathematics. 30, 4, p. 2011-2026 16 p.

Research output: Contribution to journalArticle

8 Scopus citations
2011

Optical grooming with grooming ratio nine

Colbourn, C., Ge, G. & Ling, A. C. H., Jan 1 2011, In : Discrete Mathematics. 311, 1, p. 8-15 8 p.

Research output: Contribution to journalArticle

3 Scopus citations
2012

Cover starters for covering arrays of strength two

Lobb, J. R., Colbourn, C., Danziger, P., Stevens, B. & Torres-Jimenez, J., Mar 6 2012, In : Discrete Mathematics. 312, 5, p. 943-956 14 p.

Research output: Contribution to journalArticle

11 Scopus citations
2014

F-vectors of pure complexes and pure multicomplexes of rank three

Colbourn, C., Keranen, M. S. & Kreher, D. L., Apr 6 2014, In : Discrete Mathematics. 320, 1, p. 26-39 14 p.

Research output: Contribution to journalArticle

1 Scopus citations
2011

Constructing heterogeneous hash families by puncturing linear transversal designs

Colbourn, C., Aug 1 2011, In : Journal of Geometry. 101, 1-2, p. 99-113 15 p.

Research output: Contribution to journalArticle

2020

On the maximum double independence number of Steiner triple systems

Lusi, D. & Colbourn, C. J., Jan 1 2020, (Accepted/In press) In : Journal of Combinatorial Designs.

Research output: Contribution to journalArticle

2019

Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation

Mellott, M. J., Garlisi, D., Colbourn, C. J., Syrotiuk, V. R. & Tinnirello, I., Sep 1 2019, In : Computer Communications. 145, p. 273-283 11 p.

Research output: Contribution to journalArticle

1 Scopus citations
2012

Improving two recursive constructions for covering arrays

Colbourn, C. & Zhou, J., Mar 1 2012, In : Journal of Statistical Theory and Practice. 6, 1, p. 30-47 18 p.

Research output: Contribution to journalArticle

11 Scopus citations
2019

Preface

Colbourn, C. J., Grossi, R. & Pisanti, N., Jan 1 2019, In : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 11638 LNCS, p. vi

Research output: Contribution to journalEditorial

2014

Conditional expectation algorithms for covering arrays

Colbourn, C., Aug 2014, In : Journal of Combinatorial Mathematics and Combinatorial Computing. 90, p. 97-115 19 p.

Research output: Contribution to journalArticle

6 Scopus citations
2016

Steiner loops satisfying the statement of Moufang's theorem

De Lourdes Merlini Giuliani, M., Dos Anjos, G. S. & Colbourn, C., 2016, In : Quasigroups and Related Systems. 24, 1, p. 103-108 6 p.

Research output: Contribution to journalArticle

1 Scopus citations
2015

Algebraic design theory and hadamard matrices: ADTHM, lethbridge, Alberta, Canada, july 2014

Colbourn, C., 2015, Springer Proceedings in Mathematics and Statistics. Springer New York LLC, Vol. 133.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Suitable permutations, binary covering arrays, and paley matrices

Colbourn, C., Sep 3 2015, Algebraic Design Theory and Hadamard Matrices: ADTHM, Lethbridge, Alberta, Canada, July 2014. Springer International Publishing, Vol. 133. p. 29-42 14 p.

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Scopus citations
2013

Adaptive fault detection for testing tenant applications in multi-tenancy SaaS systems

Tsai, W. T., Li, Q., Colbourn, C. & Bai, X., Aug 12 2013, Proceedings of the IEEE International Conference on Cloud Engineering, IC2E 2013. p. 183-192 10 p. 6529283. (Proceedings of the IEEE International Conference on Cloud Engineering, IC2E 2013).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations
2018

Testbed evaluation of optimized REACT over multi-hop paths

Mellott, M. J., Colbourn, C., Syrotiuk, V. & Tinnirello, I., Jan 1 2018, Wired/Wireless Internet Communications - 16th IFIP WG 6.2 International Conference, WWIC 2018, Proceedings. Chowdhury, K. R., Di Felice, M., Sheng, B. & Matta, I. (eds.). Springer Verlag, p. 134-145 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10866 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations
2016

Coverage, Location, Detection, and Measurement

Colbourn, C. & Syrotiuk, V., Aug 1 2016, Proceedings - 2016 IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2016. Institute of Electrical and Electronics Engineers Inc., p. 19-25 7 p. 7528941

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations
2015

Locating arrays: A new experimental design for screening complex Engineered systems

Aldaco, A. N., Colbourn, C. & Syrotiuk, V., Jan 20 2015, Operating Systems Review (ACM). 1 ed. Association for Computing Machinery, Vol. 49. p. 31-40 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations
2016

Partial covering arrays: Algorithms and asymptotics

Sarkar, K., Colbourn, C., De Bonis, A. & Vaccaro, U., 2016, Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings. Springer Verlag, Vol. 9843. p. 437-448 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9843).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations
2011

Mixed covering arrays of strength three with few factors

Colbourn, C., Shi, C., Wang, C. & Yan, J., Nov 1 2011, In : Journal of Statistical Planning and Inference. 141, 11, p. 3640-3647 8 p.

Research output: Contribution to journalArticle

2 Scopus citations
2016

Screening interacting factors in a wireless network testbed using locating arrays

Compton, R., Mehari, M. T., Colbourn, C., De Poorter, E. & Syrotiuk, V., Sep 6 2016, 2016 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2016. Institute of Electrical and Electronics Engineers Inc., p. 650-655 6 p. 7562157. (Proceedings - IEEE INFOCOM; vol. 2016-September).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations