49 results on '"Colbourn, Charles J."'
Search Results
2. Egalitarian Steiner triple systems for data popularity
3. Egalitarian Edge Orderings of Complete Graphs
4. Access balancing in storage systems by labeling partial Steiner systems
5. On a Combinatorial Framework for Fault Characterization
6. Improved Strength Four Covering Arrays with Three Symbols
7. Partial Covering Arrays: Algorithms and Asymptotics
8. Asymptotic and constructive methods for covering perfect hash families and covering arrays
9. Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm
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. Resolvable Covering Arrays
13. The Existence of (K 2 × K 6)-Designs
14. Improving Two Recursive Constructions for Covering Arrays
15. Optimality and Constructions of Locating Arrays
16. Constructing heterogeneous hash families by puncturing linear transversal designs
17. Trails of triples in partial triple systems
18. D-Optimal Designs with Interaction Coverage
19. Covering arrays from cyclotomy
20. Linear hash families and forbidden configurations
21. Small stopping sets in Steiner triple systems
22. Locating and detecting arrays for interaction faults
23. Lower bounds on multiple sequence alignment using exact 3-way alignment
24. Transport schemes for topology-transparent scheduling
25. Roux-type constructions for covering arrays of strengths three and four
26. The effects of synchronization on topology-transparent scheduling
27. Cover-Free Families and Topology-Transparent Scheduling for MANETs
28. Constructions for Permutation Codes in Powerline Communications
29. Pooling, lattice square, and union jack designs
30. Weakly union-free maximum packings
31. Weakly union-free twofold triple systems
32. Thwarts in transversal designs
33. The complexity of computing the tutte polynomial on transversal matroids
34. Network reliability and the probabilistic estimation of damage from fire spread
35. Anti-mitre steiner triple systems
36. Evaluating performability: Most probable states and bounds
37. The spectrum of maximal partial steiner triple systems
38. Concerning multiplier automorphisms of cyclic Steiner triple systems
39. A note on boundingk-terminal reliability
40. The number oft-wise balanced designs
41. Network reliability: Numbers or insight?
42. Combinatorial aspects of network reliability
43. Counting almost minimum cutsets with reliability applications
44. Hybrid triple systems and cubic feedback sets
45. Edge-coloured designs with block size four
46. Deciding Hadamard equivalence of Hadamard matrices
47. Element neighbourhoods in twofold triple systems
48. Minimizing setups in ordered sets of fixed width
49. Quadratic leaves of maximal partial 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.