Find Scholarly Works

Search concepts
Selected Filters
2017
1 Citation (Scopus)

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

Triple System
Faithful
Theorem
Independent Set
Generalization
2011
3 Citations (Scopus)

Optical grooming with grooming ratio nine

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

Research output: Contribution to journalArticle

Exception
Costs
Subgraph
Graph Decomposition
Decomposition
2014
6 Citations (Scopus)
Covering Array
Conditional Expectation
Covering
Orbit
Upper bound
2018

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

Perfect Hash Family
Fractals
Fractal
Covering
2015
25 Citations (Scopus)

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

Testing
1 Citation (Scopus)

The Existence of Well-Balanced Triple Systems

Wei, H., Ge, G. & Colbourn, C., 2015, (Accepted/In press) In : Journal of Combinatorial Designs.

Research output: Contribution to journalArticle

Triple System
Distributed File System
Group Divisible Design
Set of points
Availability
2013
1 Citation (Scopus)

Randomized post-optimization for t-restrictions

Colbourn, C. & Nayeri, P., 2013, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7777. 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

Restriction
Optimization
Probabilistic Methods
Algebraic Methods
Computational Results
2015
1 Citation (Scopus)
Hadamard Matrix
Cryptography
Combinatorics
Abstract algebra
Quantum Information Theory
2013

Resolvable covering arrays

Colbourn, C., Oct 2 2013, In : Journal of Statistical Theory and Practice. 7, 4, p. 630-649 20 p.

Research output: Contribution to journalArticle

Covering Array
Algebraic Structure
Computational Methods
2017
3 Citations (Scopus)

Partial Covering Arrays: Algorithms and Asymptotics

Sarkar, K., Colbourn, C., de Bonis, A. & Vaccaro, U., May 27 2017, (Accepted/In press) In : Theory of Computing Systems. p. 1-20 20 p.

Research output: Contribution to journalArticle

Covering Array
Software testing
Biological systems
Computer hardware
Polynomials
2013
4 Citations (Scopus)

Expected time to detection of interaction faults

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

Research output: Contribution to journalArticle

Fault
Interaction
Fault Detection
Lowest
Heuristic Search
2019
1 Citation (Scopus)

Partitioned search with column resampling for locating array construction

Lanus, E., Colbourn, C. & Montgomery, D., Apr 1 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

Testing
2017
14 Citations (Scopus)

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

Covering Array
Upper bound
Lemma
Group Action
Hardware
2011
6 Citations (Scopus)

Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19

Colbourn, C., Kaski, P., Stergrd, P. R. J., Pike, D. A. & Pottonen, O., Jun 6 2011, In : Discrete Mathematics. 311, 10-11, p. 827-834 8 p.

Research output: Contribution to journalArticle

Triple System
Decomposition
Triangle
Disjoint
Isomorphism Classes
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

2015
7 Citations (Scopus)

Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm

Gao, S. W., Lv, J. H., Du, B. L., Colbourn, C. & Ma, S. L., Sep 22 2015, In : Journal of Computer Science and Technology. 30, 5, p. 957-968 12 p.

Research output: Contribution to journalArticle

Fault Detection
Fault detection
Balancing
Order Parameter
Fault
2012
4 Citations (Scopus)

Trails of triples in partial triple systems

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

Research output: Contribution to journalArticle

Triple System
Steiner Triple System
Partial
Communication
Disk Array
2015
3 Citations (Scopus)

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

Covering Array
Permutation
Binary
Ruler
Covering number
2019
1 Citation (Scopus)

Two-stage algorithms for covering array construction

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

Research output: Contribution to journalArticle

Covering Array
Cover
Number of Components
Randomized Algorithms
Remainder
2013
11 Citations (Scopus)

Doubly resolvable nearly Kirkman triple systems

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

Research output: Contribution to journalArticle

Triple System
Resolvable Design
Group Divisible Design
Necessary Conditions
Sufficient
2016
5 Citations (Scopus)

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

Disjoint
Fault
Partition
Set Partition
Complex Systems
2017

Group divisible covering designs with block size four

Wei, H., Ge, G. & Colbourn, C., Jan 1 2017, (Accepted/In press) In : Journal of Combinatorial Designs.

Research output: Contribution to journalArticle

Divisible
Covering
Group Divisible Design
Covering number
Software Testing
2018
1 Citation (Scopus)

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

Magic square
Integer Partitions
Integer
Distinct
Partial
2015
1 Citation (Scopus)

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

Hadamard Matrix
Design
2011
2 Citations (Scopus)

Grooming traffic to maximize throughput in SONET rings

Colbourn, C., Quattrocchi, G. & Syrotiuk, V., Jan 2011, In : Journal of Optical Communications and Networking. 3, 1, p. 10-16 7 p.

Research output: Contribution to journalArticle

Throughput
Decomposition
Wavelength
2010
37 Citations (Scopus)

Covering and radius-covering arrays: Constructions and classification

Colbourn, C., Kéri, G., Rivas Soriano, P. P. & Schlage-Puchta, J. C., Jun 6 2010, In : Discrete Applied Mathematics. 158, 11, p. 1158-1180 23 p.

Research output: Contribution to journalArticle

Covering Array
Covering
Radius
Computational methods
Covering Codes
2011
1 Citation (Scopus)

Mixed covering arrays of strength three with few factors

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

Research output: Contribution to journalArticle

Covering Array
Testing
Factors
Assignment
Distinct
2016
6 Citations (Scopus)

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., Vol. 2016-September. p. 650-655 6 p. 7562157

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

Testbeds
Wireless networks
Screening
Network performance
Statistical methods
2012
1 Citation (Scopus)

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

Traffic Grooming
Minimise
Subgraph
Fiber optic networks
Costs
2018
1 Citation (Scopus)

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

Reservation
Multi-hop
Testbeds
Testbed
Mesh Networks
5 Citations (Scopus)

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

Interaction Effects
Heuristic methods
Interaction
Large scale systems
Covering Array
2014
9 Citations (Scopus)

ATLAS: Adaptive topology-andload-aware scheduling

Lutz, J., Colbourn, C. & Syrotiuk, V., 2014, In : IEEE Transactions on Mobile Computing. 13, 10, p. 2255-2268 14 p., 6691951.

Research output: Contribution to journalArticle

Scheduling
Topology
Wireless networks
Network protocols
Telecommunication networks
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

Wi-Fi
Testbeds
Tuning
Network protocols
Wireless ad hoc networks
2012
5 Citations (Scopus)

Strengthening hash families and compressive sensing

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

Research output: Contribution to journalArticle

Compressive Sensing
Strengthening
Replacement
Johnson's theorem
Polynomials
2017
1 Citation (Scopus)

A hierarchical framework for recovery in compressive sensing

Colbourn, C., Horsley, D. & Syrotiuk, V., 2017, (Accepted/In press) In : Discrete Applied Mathematics.

Research output: Contribution to journalArticle

Compressive Sensing
Recovery
Framework
Replacement
Flexibility
2013
16 Citations (Scopus)

Sequence covering arrays

Chee, Y. M., Colbourn, C., Horsley, D. & Zhou, J., 2013, In : SIAM Journal on Discrete Mathematics. 27, 4, p. 1844-1861 18 p.

Research output: Contribution to journalArticle

Covering Array
Permutation
Conditional Expectation
Fault
Subsequence
2010
27 Citations (Scopus)

Covering arrays from cyclotomy

Colbourn, C., May 2010, In : Designs, Codes, and Cryptography. 55, 2-3, p. 201-219 19 p.

Research output: Contribution to journalArticle

Cyclotomy
Covering Array
Cyclotomic
Biased
Character Theory
2013
2 Citations (Scopus)

The Existence of (K2 × K6)-Designs

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

Research output: Contribution to journalArticle

Graph Design
Grid
If and only if
Design
2015

Preface

Colbourn, C., Sep 3 2015, In : Unknown Journal. 133, p. v-xi

Research output: Contribution to journalArticle

2014

Covering arrays, augmentation, and quilting arrays

Colbourn, C. J., Sep 1 2014, In : Discrete Mathematics, Algorithms and Applications. 6, 3, 1450034.

Research output: Contribution to journalArticle

Covering Array
Augmentation
Redundancy
Fusion
Coverage
2013
2 Citations (Scopus)

Empirically identifying the best greedy algorithm for covering array generation

Nie, C., Jiang, J., Wu, H., Leung, H. & Colbourn, C., 2013, Proceedings - IEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013. p. 239-248 10 p. 6571639

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

Testing
Experiments
2012
11 Citations (Scopus)

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

Covering Array
Duplication
Replacement
Recursion
Coverage
11 Citations (Scopus)

Optimality and constructions of locating arrays

Tang, Y., Colbourn, C. & Yin, J., Mar 1 2012, In : Journal of Statistical Theory and Practice. 6, 1, p. 20-29 10 p.

Research output: Contribution to journalArticle

Optimality
Fault
Lower bound
Component-based Systems
Infinite series
2015

Preface

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

Research output: Contribution to journalArticle

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

Crosstalk
Error correction
Error Correction
Chip
Coding
2013
18 Citations (Scopus)

Test algebra for combinatorial testing

Tsai, W. T., Colbourn, C., Luo, J., Qi, G., Li, Q. & Bai, X., 2013, 2013 8th International Workshop on Automation of Software Test, AST 2013 - Proceedings. p. 19-25 7 p. 6595786

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

Algebra
Testing
Cloud computing
Servers
2011
3 Citations (Scopus)

Efficient conditional expectation algorithms for constructing hash families

Colbourn, C., 2011, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7056 LNCS. 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

Conditional Expectation
Set Cover
Polynomials
Covering Array
Family
2018
3 Citations (Scopus)

Test-Algebra-Based Fault Location Analysis for the Concurrent Combinatorial Testing

Qi, G., Tsai, W. T., Colbourn, C., Luo, J. & Zhu, Z., Jun 26 2018, (Accepted/In press) In : IEEE Transactions on Reliability.

Research output: Contribution to journalArticle

Electric fault location
Algebra
Testing
Servers
Cloud computing
2010
12 Citations (Scopus)

Properties of the steiner triple systems of order 19

Colbourn, C., Forbes, A. D., Grannell, M. J., Griggs, T. S., Kaskit, P., Östergård, P. R. J., Pike, D. A. & Pottonen, O., 2010, In : Electronic Journal of Combinatorics. 17, 1, p. 1-30 30 p.

Research output: Contribution to journalArticle

Chromatic Index
Steiner Triple System
Chromatic number
Closed
2017

Steiner triple systems with high chromatic index

Bryant, D., Colbourn, C., Horsley, D. & Wanless, I. M., Jan 1 2017, In : SIAM Journal on Discrete Mathematics. 31, 4, p. 2603-2611 9 p.

Research output: Contribution to journalArticle

Chromatic Index
Steiner Triple System
Exception
Disjoint
Integer