Colbourn, Charles J., 1953-....
Colbourn, Charles J.
Colbourn, C. J. (Charles J.), 1953-
Charles Colbourn
Colbourn, Charles Joseph, 1953-
VIAF ID: 85208714 (Personal)
Permalink: http://viaf.org/viaf/85208714
Preferred Forms
- 100 0 _ ‡a Charles Colbourn
- 200 _ | ‡a Colbourn ‡b Charles J. ‡f 1953-....
-
- 100 1 _ ‡a Colbourn, C. J. ‡q (Charles J.), ‡d 1953-
-
-
-
- 100 1 _ ‡a Colbourn, Charles J.
-
-
- 100 1 _ ‡a Colbourn, Charles J. ‡d 1953-
- 100 1 _ ‡a Colbourn, Charles J. ‡d 1953-
- 100 1 _ ‡a Colbourn, Charles J. ‡d 1953-
-
- 100 1 _ ‡a Colbourn, Charles J., ‡d 1953-....
-
4xx's: Alternate Name Forms (17)
5xx's: Related Names (2)
Works
Title | Sources |
---|---|
Algebraic design theory and Hadamard matrices : ADTHM, Lethbridge, Alberta, Canada, July 2014 | |
Algorithms in combinatorial design theory, 1985: | |
Assessing reliability of multistage interconnection networks | |
The BioIntelligence Framework: a new computational platform for biomedical knowledge computing | |
Coding, cryptography and computer security | |
Combinatorial Algorithms : 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings | |
Combinatorics advances | |
Combining Monte Carlo estimates and bounds for network reliability | |
The complexity of completing partial Latin squares | |
The complexity of graph isomorphism and related problems | |
Conflict-free access to parallel memories | |
A conjecture on dominating cycles | |
Construction of optimal quality control for oligo arrays | |
Designs and graphs | |
Edge-coloured designs with block size four | |
Handbook of combinatorial designs, 2007: | |
Indecomposable 1-factorizations of the complete multigraph | |
Intersections and supports of quadruple systems | |
Linear time automorphism algorithms for trees, interval graphs and planar graphs | |
Locating a broadcast facility in an unreliable network | |
Lower bounds on multiple sequence alignment using exact 3-way alignment | |
Matroid Steiner problems, the Tutte polynomial and network reliability | |
Network reliability : experiments with a symbolic algebra environment | |
The Number of t-wise balanced designs | |
On two dual classes of planar graphs | |
Orderly algorithms for generating restricted classes of graphs | |
Reliable assignments of processors to tasks | |
Repeated edges in 3-factorizations | |
Roux type constructions for covering arrays of strengths three and four | |
Test-Algebra-Based Fault Location Analysis for the Concurrent Combinatorial Testing | |
Threshold channel graphs | |
Triple systems | |
Truncated D-Optimal Designs for Screening Experiments | |
Unit disk graphs | |
Unranking and ranking spanning trees of a graph |