Find Scholarly Works

Search in all content

Filters for Scholarly Works

Search concepts
Selected Filters

Publication Year

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

Author

  • Charles Colbourn
Article

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

3 Scopus citations

Asymptotic and constructive methods for covering perfect hash families and covering arrays

Colbourn, C., Lanus, E. & Sarkar, K., May 26 2017, (Accepted/In press) In : Designs, Codes, and Cryptography. p. 1-31 31 p.

Research output: Contribution to journalArticle

14 Scopus citations

ATLAS: Adaptive topology-andload-aware scheduling

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

Research output: Contribution to journalArticle

10 Scopus citations

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

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

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

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

Constructions of optimal orthogonal arrays with repeated rows

Colbourn, C., Stinson, D. R. & Veitch, S., Sep 1 2019, In : Discrete Mathematics. 342, 9, p. 2455-2466 12 p.

Research output: Contribution to journalArticle

Covering and packing for pairs

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

Research output: Contribution to journalArticle

11 Scopus citations

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

1 Scopus citations

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

Distributing hash families with few rows

Colbourn, C. J., Dougherty, R. E. & Horsley, D., Dec 31 2019, In : Theoretical Computer Science. 800, p. 31-41 11 p.

Research output: Contribution to journalArticle

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

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

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

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

Grooming traffic to maximize throughput in SONET rings

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

Research output: Contribution to journalArticle

2 Scopus citations

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

Group divisible covering designs with block size four

Wei, H., Ge, G. & Colbourn, C., Mar 2018, In : Journal of Combinatorial Designs. 26, 3, p. 101-118 18 p.

Research output: Contribution to journalArticle

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

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

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

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

6 Scopus citations

New bounds on the maximum size of Sperner partition systems

Chang, Y., Colbourn, C. J., Gowty, A., Horsley, D. & Zhou, J., Dec 2020, In : European Journal of Combinatorics. 90, 103165.

Research output: Contribution to journalArticle

On a Combinatorial Framework for Fault Characterization

Colbourn, C. & Syrotiuk, V., Jan 1 2018, (Accepted/In press) In : Mathematics in Computer Science.

Research output: Contribution to journalArticle

5 Scopus citations

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

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

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

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

15 Scopus citations

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

3 Scopus citations

Randomized post-optimization of covering arrays

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

Research output: Contribution to journalArticle

26 Scopus citations

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

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

Sequence covering arrays

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

Research output: Contribution to journalArticle

18 Scopus citations

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

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

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

3 Scopus citations

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., Jan 8 2013, In : Journal of the American Medical Informatics Association. 20, 1, p. 128-133 6 p.

Research output: Contribution to journalArticle

6 Scopus citations

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

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

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

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

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

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
Chapter

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
Conference contribution

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

Algorithms for Constructing Anonymizing Arrays

Lanus, E. & Colbourn, C. J., 2020, Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Proceedings. Gasieniec, L., Gasieniec, L., Klasing, R. & Radzik, T. (eds.). Springer, p. 382-394 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12126 LNCS).

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

Open Access

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

Counting Subwords and Regular Languages

Colbourn, C., Dougherty, R. E., Lidbetter, T. F. & Shallit, J., Jan 1 2018, Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Hoshi, M. & Seki, S. (eds.). Springer Verlag, p. 231-242 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11088 LNCS).

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

1 Scopus citations

Detecting arrays for main effects

Colbourn, C. & Syrotiuk, V., Jan 1 2019, Algebraic Informatics - 8th International Conference, CAI 2019, Proceedings. Ćirić, M., Pin, J-É. & Droste, M. (eds.). Springer Verlag, p. 112-123 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11545 LNCS).

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

1 Scopus citations