Charles J. Colbourn

ORCID

Publication Activity (10 Years)

Years Active: 1978-2024
Publications (10 Years): 54

Top Venues

CoRR

SIAM J. Discret. Math.

Des. Codes Cryptogr.

IWOCA

Publications

Charles J. Colbourn
Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions. SN Comput. Sci. 5 (2) (2024)
Charles J. Colbourn, Violet R. Syrotiuk
Detecting arrays for effects of multiple interacting factors. Inf. Comput. 301 (2024)
Dylan Lusi, Charles J. Colbourn
The spectrum of resolvable Bose triple systems. Discret. Math. 346 (7) (2023)
Erin Lanus, Charles J. Colbourn, Gail-Joon Ahn
Guaranteeing Anonymity in Attribute-Based Authorization. CoRR (2023)
Michael Wagner, Charles J. Colbourn, Dimitris E. Simos
Summary of In-Parameter-Order strategies for covering perfect hash families. ICSTW (2023)
Ryan E. Dougherty, Kristoffer Kleine, Michael Wagner, Charles J. Colbourn, Dimitris E. Simos
Algorithmic methods for covering arrays of higher index. J. Comb. Optim. 45 (1) (2023)
Charles J. Colbourn
Egalitarian Steiner quadruple systems of doubly even order. Discret. Math. 345 (7) (2022)
Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. CoRR (2022)
Charles J. Colbourn, Colin Ingalls, Jonathan Jedwab, Mark Saaltink, Ken W. Smith, Brett Stevens
Sets of mutually orthogoval projective and affine planes. CoRR (2022)
Soumen Maity, Charles J. Colbourn
Mixed covering arrays on graphs of small treewidth. Discret. Math. Algorithms Appl. 14 (1) (2022)
Michael Wagner, Charles J. Colbourn, Dimitris E. Simos
In-Parameter-Order strategies for covering perfect hash families. Appl. Math. Comput. 421 (2022)
Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. ISIT (2022)
Charles J. Colbourn
Egalitarian Edge Orderings of Complete Graphs. Graphs Comb. 37 (4) (2021)
Charles J. Colbourn
Egalitarian Steiner triple systems for data popularity. Des. Codes Cryptogr. 89 (10) (2021)
Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol
Network reliability: Heading out on the highway. Networks 77 (1) (2021)
Charles J. Colbourn
Popularity Block Labelling for Steiner Systems. ACCT (2020)
Yanxun Chang, Charles J. Colbourn, Adam Gowty, Daniel Horsley, Junling Zhou
New bounds on the maximum size of Sperner partition systems. Eur. J. Comb. 90 (2020)
Nadia Pisanti, Charles J. Colbourn, Roberto Grossi
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019). Theory Comput. Syst. 64 (7) (2020)
Erin Lanus, Charles J. Colbourn
Algorithms for Constructing Anonymizing Arrays. IWOCA (2020)
Yeow Meng Chee, Charles J. Colbourn, Hoang Dau, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic
Access balancing in storage systems by labeling partial Steiner systems. Des. Codes Cryptogr. 88 (11) (2020)
Ryan Gabrys, Son Hoang Dau, Charles J. Colbourn, Olgica Milenkovic
Set-Codes with Small Intersections and Small Discrepancies. SIAM J. Discret. Math. 34 (2) (2020)
Charles J. Colbourn, Violet R. Syrotiuk
Detecting Arrays for Main Effects. CAI (2019)
Charles J. Colbourn, Douglas R. Stinson, Shannon Veitch
Constructions of optimal orthogonal arrays with repeated rows. Discret. Math. 342 (9) (2019)
Ryan Gabrys, Son Hoang Dau, Charles J. Colbourn, Olgica Milenkovic
Set-Codes with Small Intersections and Small Discrepancies. CoRR (2019)
Yeow Meng Chee, Charles J. Colbourn, Hoang Dau, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic
Access Balancing in Storage Systems by Labeling Partial Steiner Systems. CoRR (2019)
Ryan Gabrys, Hoang Dau, Charles J. Colbourn, Olgica Milenkovic
Set-Codes with Small Intersections and Small Discrepancies. ISIT (2019)
Matthew J. Mellott, Domenico Garlisi, Charles J. Colbourn, Violet R. Syrotiuk, Ilenia Tinnirello
Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation. Comput. Commun. 145 (2019)
Charles J. Colbourn, Ryan E. Dougherty, Daniel Horsley
Distributing hash families with few rows. Theor. Comput. Sci. 800 (2019)
Ryan E. Dougherty, Erin Lanus, Charles J. Colbourn, Stephanie Forrest
-restrictions. GECCO (Companion) (2019)
Erin Lanus, Charles J. Colbourn, Douglas C. Montgomery
Partitioned Search with Column Resampling for Locating Array Construction. ICST Workshops (2019)
Stephen A. Seidel, Charles J. Colbourn, Violet R. Syrotiuk
Robustness of Recovery in Locating Array-Based Screening Experiments. SpringSim (2019)
Stephen A. Seidel, Michael T. Mehari, Charles J. Colbourn, Eli De Poorter, Ingrid Moerman, Violet R. Syrotiuk
Analysis of large-scale experimental data from wireless networks. INFOCOM Workshops (2018)
Charles J. Colbourn, Erin Lanus, Kaushik Sarkar
Asymptotic and constructive methods for covering perfect hash families and covering arrays. Des. Codes Cryptogr. 86 (4) (2018)
Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan, Charles J. Colbourn
Improved Strength Four Covering Arrays with Three Symbols. Graphs Comb. 34 (1) (2018)
Charles J. Colbourn, Violet R. Syrotiuk
On a Combinatorial Framework for Fault Characterization. Math. Comput. Sci. 12 (4) (2018)
Matthew J. Mellott, Charles J. Colbourn, Violet R. Syrotiuk, Ilenia Tinnirello
Testbed Evaluation of Optimized REACT over Multi-hop Paths. WWIC (2018)
Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
A hierarchical framework for recovery in compressive sensing. Discret. Appl. Math. 236 (2018)
Charles J. Colbourn, Ryan E. Dougherty
Fractal Perfect Hash Families (Extended Abstract). Electron. Notes Discret. Math. 65 (2018)
Guanqiu Qi, Wei-Tek Tsai, Charles J. Colbourn, Jie Luo, Zhiqin Zhu
Test-Algebra-Based Fault Location Analysis for the Concurrent Combinatorial Testing. IEEE Trans. Reliab. 67 (3) (2018)
Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit
Counting Subwords and Regular Languages. DLT (2018)
Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro
Partial Covering Arrays: Algorithms and Asymptotics. Theory Comput. Syst. 62 (6) (2018)
Charles J. Colbourn, Erin Lanus
Subspace restrictions and affine composition for covering perfect hash families. Art Discret. Appl. Math. 1 (2) (2018)
Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit
Counting Subwords and Regular Languages. CoRR (2018)
Stephen A. Seidel, Kaushik Sarkar, Charles J. Colbourn, Violet R. Syrotiuk
Separating Interaction Effects Using Locating and Detecting Arrays. IWOCA (2018)
Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin
Compressed Sensing With Combinatorial Designs: Theory and Simulations. IEEE Trans. Inf. Theory 63 (8) (2017)
Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
Variable-weight topology-transparent scheduling. Comput. Networks 122 (2017)
Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Ian M. Wanless
Steiner Triple Systems with High Chromatic Index. SIAM J. Discret. Math. 31 (4) (2017)
Kaushik Sarkar, Charles J. Colbourn
Upper Bounds on the Size of Covering Arrays. SIAM J. Discret. Math. 31 (2) (2017)
Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro
Partial Covering Arrays: Algorithms and Asymptotics. CoRR (2016)
Charles J. Colbourn, Bingli Fan, Daniel Horsley
Disjoint Spread Systems and Fault Location. SIAM J. Discret. Math. 30 (4) (2016)
Randy Compton, Michael T. Mehari, Charles J. Colbourn, Eli De Poorter, Violet R. Syrotiuk
Screening interacting factors in a wireless network testbed using locating arrays. INFOCOM Workshops (2016)
Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro
Partial Covering Arrays: Algorithms and Asymptotics. IWOCA (2016)
Charles J. Colbourn, Violet R. Syrotiuk
Coverage, Location, Detection, and Measurement. ICST Workshops (2016)
Kaushik Sarkar, Charles J. Colbourn
Two-stage algorithms for covering array construction. CoRR (2016)
Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin
Compressed sensing and designs: theory and simulations. CoRR (2015)
Charles J. Colbourn, Maria De Lourdes Merlini Giuliani, Alexander Rosa, Izabella Stuhl
Steiner loops satisfying Moufang's theorem. Australas. J Comb. 63 (2015)
Shi-Wei Gao, Jiang-Hua Lv, Bing-Lei Du, Charles J. Colbourn, Shilong Ma
Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm. J. Comput. Sci. Technol. 30 (5) (2015)
Yuichiro Fujiwara, Charles J. Colbourn
A combinatorial approach to X-tolerant compaction circuits. CoRR (2015)
Yeow Meng Chee, Charles J. Colbourn, Alan Chi Hung Ling, Hui Zhang, Xiande Zhang
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses. Des. Codes Cryptogr. 77 (2-3) (2015)
Charles J. Colbourn
Augmentation of Covering Arrays of Strength Two. Graphs Comb. 31 (6) (2015)
Changhai Nie, Huayao Wu, Xintao Niu, Fei-Ching Kuo, Hareton K. N. Leung, Charles J. Colbourn
Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures. Inf. Softw. Technol. 62 (2015)
Abraham N. Aldaco, Charles J. Colbourn, Violet R. Syrotiuk
Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems. ACM SIGOPS Oper. Syst. Rev. 49 (1) (2015)
Huayao Wu, Changhai Nie, Fei-Ching Kuo, Hareton K. N. Leung, Charles J. Colbourn
A Discrete Particle Swarm Optimization for Covering Array Generation. IEEE Trans. Evol. Comput. 19 (4) (2015)
Charles J. Colbourn
Covering arrays, augmentation, and quilting arrays. Discret. Math. Algorithms Appl. 6 (3) (2014)
Patrick C. Murray, Charles J. Colbourn
Sequence Covering Arrays and Linear Extensions. IWOCA (2014)
Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
ATLAS: Adaptive Topology- andLoad-Aware Scheduling. IEEE Trans. Mob. Comput. 13 (10) (2014)
Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
Hierarchical Recovery in Compressive Sensing. CoRR (2014)
Charles J. Colbourn, Melissa S. Keranen, Donald L. Kreher
f-vectors of pure complexes and pure multicomplexes of rank three. Discret. Math. 320 (2014)
Yeow Meng Chee, Charles J. Colbourn, Daniel Horsley, Junling Zhou
Sequence Covering Arrays. SIAM J. Discret. Math. 27 (4) (2013)
Changhai Nie, Jing Jiang, Huayao Wu, Hareton Leung, Charles J. Colbourn
Empirically Identifying the Best Greedy Algorithm for Covering Array Generation. ICST Workshops (2013)
Wei-Tek Tsai, Qingyang Li, Charles J. Colbourn, Xiaoying Bai
Adaptive Fault Detection for Testing Tenant Applications in Multi-tenancy SaaS Systems. IC2E (2013)
Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
ATLAS: Adaptive Topology- and Load-Aware Scheduling CoRR (2013)
Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
Topological Persistence for Medium Access Control. IEEE Trans. Mob. Comput. 12 (8) (2013)
Wei-Tek Tsai, Charles J. Colbourn, Jie Luo, Guanqiu Qi, Qingyang Li, Xiaoying Bai
Test algebra for combinatorial testing. AST (2013)
Toni R. Farley, Jeff Kiefer, Preston Lee, Daniel Von Hoff, Jeffrey M. Trent, Charles J. Colbourn, Spyro Mousses
The BioIntelligence Framework: a new computational platform for biomedical knowledge computing. J. Am. Medical Informatics Assoc. 20 (1) (2013)
Chengmin Wang, Charles J. Colbourn
The Existence of (K 2 × K 6)-Designs. Graphs Comb. 29 (5) (2013)
Charles J. Colbourn, Peyman Nayeri
Randomized Post-optimization for t-Restrictions. Information Theory, Combinatorics, and Search Theory (2013)
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
Randomized post-optimization of covering arrays. Eur. J. Comb. 34 (1) (2013)
Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling, Richard M. Wilson
Covering and packing for pairs. J. Comb. Theory, Ser. A 120 (7) (2013)
Charles J. Colbourn, Daniel Horsley, Chengmin Wang
Trails of triples in partial triple systems. Des. Codes Cryptogr. 65 (3) (2012)
Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, Violet R. Syrotiuk
Grooming traffic to minimize load. Discret. Math. 312 (3) (2012)
Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
Strengthening hash families and compressive sensing. J. Discrete Algorithms 16 (2012)
Jason R. Lobb, Charles J. Colbourn, Peter Danziger, Brett Stevens, Jose Torres-Jimenez
Cover starters for covering arrays of strength two. Discret. Math. 312 (5) (2012)
Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
Variable Weight Sequences for Adaptive Scheduled Access in MANETs. SETA (2012)
Renée C. Bryce, Charles J. Colbourn, D. Richard Kuhn
Finding Interaction Faults Adaptively Using Distance-Based Strategies. ECBS (2011)
Charles J. Colbourn, Daniel Horsley, Christopher McLean
Compressive Sensing Matrices and Hash Families. IEEE Trans. Commun. 59 (7) (2011)
Charles J. Colbourn, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19. Discret. Math. 311 (10-11) (2011)
Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk
Grooming Traffic to Maximize Throughput in SONET Rings. JOCN 3 (1) (2011)
Charles J. Colbourn, Gennian Ge, Alan C. H. Ling
Optical grooming with grooming ratio nine. Discret. Math. 311 (1) (2011)
Charles J. Colbourn
Efficient Conditional Expectation Algorithms for Constructing Hash Families. IWOCA (2011)
Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
Frameproof codes and compressive sensing. Allerton (2010)
Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM J. Discret. Math. 24 (2) (2010)
Yuichiro Fujiwara, Charles J. Colbourn
A combinatorial approach to X-tolerant compaction circuits. IEEE Trans. Inf. Theory 56 (7) (2010)
Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
Apples and oranges: comparing schedule- and contention-based medium access control. MSWiM (2010)
Charles J. Colbourn, Gerzson Kéri, P. P. Rivas Soriano, Jan-Christoph Schlage-Puchta
Covering and radius-covering arrays: Constructions and classification. Discret. Appl. Math. 158 (11) (2010)
Charles J. Colbourn
Covering arrays from cyclotomy. Des. Codes Cryptogr. 55 (2-3) (2010)
Charles J. Colbourn, Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen
Properties of the Steiner Triple Systems of Order 19. Electron. J. Comb. 17 (1) (2010)
Charles J. Colbourn, Alan C. H. Ling
Linear hash families and forbidden configurations. Des. Codes Cryptogr. 52 (1) (2009)
Toni R. Farley, Charles J. Colbourn
Multi-Terminal Network Connectedness on Series-Parallel Networks. Discret. Math. Algorithms Appl. 1 (2) (2009)
Toni R. Farley, Charles J. Colbourn
Multiterminal measures for network reliability and resilience. DRCN (2009)

Charles J. Colbourn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Charles J. Colbourn