62 results on '"Colbourn, Charles J."'
Search Results
2. Algorithmic methods for covering arrays of higher index
3. Egalitarian Steiner triple systems for data popularity
4. Egalitarian Edge Orderings of Complete Graphs
5. Access balancing in storage systems by labeling partial Steiner systems
6. On a Combinatorial Framework for Fault Characterization
7. Partial Covering Arrays: Algorithms and Asymptotics
8. Asymptotic and constructive methods for covering perfect hash families and covering arrays
9. Improved Strength Four Covering Arrays with Three Symbols
10. Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
11. Augmentation of Covering Arrays of Strength Two
12. Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm
13. Resolvable Covering Arrays
14. The Existence of (K 2 × K 6)-Designs
15. Trails of triples in partial triple systems
16. Improving Two Recursive Constructions for Covering Arrays
17. Optimality and Constructions of Locating Arrays
18. Constructing heterogeneous hash families by puncturing linear transversal designs
19. Covering arrays from cyclotomy
20. D-Optimal Designs with Interaction Coverage
21. Linear hash families and forbidden configurations
22. Small stopping sets in Steiner triple systems
23. The configuration polytope of ℓ-line configurations in Steiner triple systems
24. Locating and detecting arrays for interaction faults
25. Transport schemes for topology-transparent scheduling
26. The effects of synchronization on topology-transparent scheduling
27. Roux-type constructions for covering arrays of strengths three and four
28. Constructions for Permutation Codes in Powerline Communications
29. Cover-Free Families and Topology-Transparent Scheduling for MANETs
30. The Existence of Kirkman Squares—Doubly Resolvable (v,3,1)-BIBDs
31. Maximum Kirkman Signal Sets for Synchronous Uni-Polar Multi-UserCommunication Systems
32. Covering Arrays of Strength Three
33. Group testing for consecutive positives
34. Pooling, lattice square, and union jack designs
35. Weakly union-free maximum packings
36. Point Code Minimum Steiner Triple Systems
37. Weakly union-free twofold triple systems
38. Existence of Incomplete Transversal Designs with Block Size Five and Any Index λ
39. Pairwise Balanced Designs with Consecutive Block Sizes
40. Concerning Difference Matrices
41. Concerning difference matrices
42. Non-Stanley Bounds for Network Reliability
43. Non-Stanley bounds for network reliability
44. Thwarts in transversal designs
45. The complexity of computing the tutte polynomial on transversal matroids
46. Network reliability and the probabilistic estimation of damage from fire spread
47. Anti-mitre steiner triple systems
48. Evaluating performability: Most probable states and bounds
49. The spectrum of maximal partial steiner triple systems
50. Concerning multiplier automorphisms of cyclic Steiner triple systems
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.