Charles J. Colbourn

Affiliations: 
Arizona State University, Tempe, AZ, United States 
Area:
Computer Science
Google:
"Charles Colbourn"
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Gabrys R, Dau HS, Colbourn CJ, et al. (2020) Set-Codes with Small Intersections and Small Discrepancies Siam Journal On Discrete Mathematics. 34: 1148-1171
Chang Y, Colbourn CJ, Gowty A, et al. (2020) New bounds on the maximum size of Sperner partition systems European Journal of Combinatorics. 90: 103165
Chee YM, Colbourn CJ, Dau H, et al. (2020) Access balancing in storage systems by labeling partial Steiner systems Designs, Codes and Cryptography. 1-16
Colbourn CJ, Stinson DR, Veitch S. (2019) Constructions of optimal orthogonal arrays with repeated rows Discrete Mathematics. 342: 2455-2466
Colbourn CJ, Lanus E, Sarkar K. (2018) Asymptotic and constructive methods for covering perfect hash families and covering arrays Designs, Codes and Cryptography. 86: 907-937
Maity S, Akhtar Y, Chandrasekharan RC, et al. (2018) Improved Strength Four Covering Arrays with Three Symbols Graphs and Combinatorics. 34: 223-239
Sarkar K, Colbourn CJ, Bonis AD, et al. (2018) Partial Covering Arrays: Algorithms and Asymptotics Theory of Computing Systems \/ Mathematical Systems Theory. 62: 1470-1489
Sarkar K, Colbourn CJ. (2017) Upper Bounds on the Size of Covering Arrays Siam Journal On Discrete Mathematics. 31: 1277-1293
Bryant D, Colbourn CJ, Horsley D, et al. (2017) Compressed Sensing With Combinatorial Designs: Theory and Simulations Ieee Transactions On Information Theory. 63: 4850-4859
Colbourn CJ, Fan B, Horsley D. (2016) Disjoint Spread Systems and Fault Location Siam Journal On Discrete Mathematics. 30: 2011-2026
See more...