374 results on '"Colbourn, Charles J."'
Search Results
2. Distributing hash families with few rows
3. Detecting arrays for effects of multiple interacting factors
4. The spectrum of resolvable Bose triple systems
5. Algorithmic methods for covering arrays of higher index
6. Egalitarian Steiner quadruple systems of doubly even order
7. In-Parameter-Order strategies for covering perfect hash families
8. Egalitarian Steiner triple systems for data popularity
9. Egalitarian Edge Orderings of Complete Graphs
10. COVERING PERFECT HASH FAMILIES AND COVERING ARRAYS OF HIGHER INDEX.
11. New bounds on the maximum size of Sperner partition systems
12. Access balancing in storage systems by labeling partial Steiner systems
13. Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation
14. A hierarchical framework for recovery in compressive sensing
15. On a Combinatorial Framework for Fault Characterization
16. Variable-weight topology-transparent scheduling
17. Kirkman Triple Systems of Order 21 with Nontrivial Automorphism Group
18. Scalable level-wise screening experiments using locating arrays.
19. Partial Covering Arrays: Algorithms and Asymptotics
20. Asymptotic and constructive methods for covering perfect hash families and covering arrays
21. Improved Strength Four Covering Arrays with Three Symbols
22. Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures
23. Covering and packing for pairs
24. Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
25. Augmentation of Covering Arrays of Strength Two
26. Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm
27. Randomized post-optimization of covering arrays
28. Cover starters for covering arrays of strength two
29. Grooming traffic to minimize load
30. Mixed covering arrays of strength three with few factors
31. Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
32. A recursive construction for perfect hash families
33. Perfect Hash Families: Constructions and Existence
34. Resolvable Covering Arrays
35. The Existence of (K 2 × K 6)-Designs
36. Optical grooming with grooming ratio nine
37. SHARPER BOUNDS IN ADAPTIVE GROUP TESTING
38. Chip firing and all-terminal network reliability bounds
39. Tabu search for covering arrays using permutation vectors
40. Graph designs for the eight-edge five-vertex graphs
41. Minimum embedding of Steiner triple systems into [formula omitted]-designs II
42. Steiner Triple Systems of Order 19 with Nontrivial Automorphism Group
43. Supplement to Transitive Steiner and Kirkman Triple Systems of Order 27
44. Transitive Steiner and Kirkman Triple Systems of Order 27
45. Trails of triples in partial triple systems
46. Improving Two Recursive Constructions for Covering Arrays
47. Optimality and Constructions of Locating Arrays
48. Constructing heterogeneous hash families by puncturing linear transversal designs
49. Fully gated graphs: Recognition and convex operations
50. Constructing strength three covering arrays with augmented annealing
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.