Find Scholarly Works

Search concepts
Selected Filters
2013
Resource allocation
Wireless networks
Network protocols
Communication
Innovation
9 Citations (Scopus)

Covering and packing for pairs

Chee, Y. M., Colbourn, C., Ling, A. C. H. & Wilson, R. M., Sep 2013, In : Journal of Combinatorial Theory. Series A. 120, 7, p. 1440-1449 10 p.

Research output: Contribution to journalArticle

Packing
Covering
Balanced Incomplete Block Design
Subset
Divisibility
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
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
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
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
23 Citations (Scopus)

Randomized post-optimization of covering arrays

Nayeri, P., Colbourn, C. & Konjevod, G., 2013, In : European Journal of Combinatorics. 34, 1, p. 91-103 13 p.

Research output: Contribution to journalArticle

Covering Array
Coverage
Optimization
Computational methods
Metaheuristics

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
14 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
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
6 Citations (Scopus)

The biointelligence Framework: A new computational platform for biomedical knowledge computing

Farley, T., Kiefer, J., Lee, P., Von Hoff, D., Trent, J. M., Colbourn, C. & Mousses, S., 2013, In : Journal of the American Medical Informatics Association. 20, 1, p. 128-133 6 p.

Research output: Contribution to journalArticle

Database Management Systems
Knowledge Bases
Semantics
Biomedical Research
Language
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
2 Citations (Scopus)

Topological persistence for medium access control

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

Research output: Contribution to journalArticle

Medium access control
Parallel algorithms
Network protocols
Transmitters
Wireless networks
2012
11 Citations (Scopus)

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

Covering Array
Starters
Cover
Exhaustive Search
Heuristic Search
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
10 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
10 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
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
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
5 Citations (Scopus)

Variable weight sequences for adaptive scheduled access in MANETs

Lutz, J., Colbourn, C. & Syrotiuk, V., 2012, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7280 LNCS. p. 53-64 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7280 LNCS).

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

Fairness
Scheduling
Throughput
Topology
Mobile ad hoc networks
2011
14 Citations (Scopus)

Compressive sensing matrices and hash families

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

Research output: Contribution to journalArticle

Recovery

Constructing heterogeneous hash families by puncturing linear transversal designs

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

Research output: Contribution to journalArticle

Transversal Design
Covering Array
Finite Geometry
Efficacy
Family
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
7 Citations (Scopus)

Finding interaction faults adaptively using distance-based strategies

Bryce, R. C., Colbourn, C. & Kuhn, D. R., 2011, Proceedings - 18th IEEE International Conference and Workshops on Engineering of Computer-Based Systems, ECBS 2011. p. 4-13 10 p. 5934799

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

Hamming distance
Testing
Collision avoidance
Experiments
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
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
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
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
2010
8 Citations (Scopus)

A combinatorial approach to X-tolerant compaction circuits

Fujiwara, Y. & Colbourn, C., Jul 2010, In : IEEE Transactions on Information Theory. 56, 7, p. 3196-3206 11 p., 5485008.

Research output: Contribution to journalArticle

Compaction
Networks (circuits)
fan
Design for testability
Values
4 Citations (Scopus)

Apples and oranges: Comparing schedule- and contention-based medium access control

Lutz, J., Colbourn, C. & Syrotiuk, V., 2010, MSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems. p. 319-326 8 p.

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

Apple
Frequency allocation
Medium Access Control
Medium access control
Contention
36 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
25 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
3 Citations (Scopus)

Drop cost and wavelength optimal two-period grooming with ratio 4

Bermond, J. C., Colbourn, C., Gionfriddo, L., Quattrocchi, G. & Sau, I., 2010, In : SIAM Journal on Discrete Mathematics. 24, 2, p. 400-419 20 p.

Research output: Contribution to journalArticle

Wavelength
Costs
Complete Graph
Subgraph
Traffic Grooming
8 Citations (Scopus)

Frameproof codes and compressive sensing

Colbourn, C., Horsley, D. & Syrotiuk, V., 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. p. 985-990 6 p. 5707016

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

Testing
13 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