993 results on '"Colbourn, Charles J."'
Search Results
52. Variable-weight topology-transparent scheduling
53. Kirkman Triple Systems of Order 21 with Nontrivial Automorphism Group
54. Detecting Arrays for Main Effects
55. Sequence Covering Arrays and Linear Extensions
56. Partial Covering Arrays: Algorithms and Asymptotics
57. Asymptotic and constructive methods for covering perfect hash families and covering arrays
58. Improved Strength Four Covering Arrays with Three Symbols
59. Algorithmic methods for covering arrays of higher index
60. Scalable level-wise screening experiments using locating arrays
61. Counting Subwords and Regular Languages
62. Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures
63. Randomized Post-optimization for t-Restrictions
64. Variable Weight Sequences for Adaptive Scheduled Access in MANETs
65. Efficient Conditional Expectation Algorithms for Constructing Hash Families
66. Randomized Postoptimization of Covering Arrays
67. Binary Covering Arrays and Existentially Closed Graphs
68. Faithful Enclosing of Triple Systems: A Generalization of Stern’s Theorem
69. Covering and packing for pairs
70. The Spectrum of R-Orthogonal Latin Squares
71. Construction Techniques for Mutually Orthogonal Latin Squares
72. Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
73. Augmentation of Covering Arrays of Strength Two
74. Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm
75. Randomized post-optimization of covering arrays
76. Steiner Systems for Topology-Transparent Access Control in MANETs
77. Multiple Access Communications Using Combinatorial Designs
78. Cluttered Orderings for the Complete Graph
79. Grade of Service Steiner Trees in Series-Parallel Networks
80. Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays
81. Reliability Issues In Telecommunications Network Planning
82. Cover starters for covering arrays of strength two
83. Grooming traffic to minimize load
84. Partial Covering Arrays: Algorithms and Asymptotics
85. Concerning Difference Matrices
86. Making the Mols Table
87. Mixed covering arrays of strength three with few factors
88. Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
89. A recursive construction for perfect hash families
90. Perfect Hash Families: Constructions and Existence
91. Wang tilings and distributed orientation on anonymous torus networks (extended abstract)
92. Resolvable Covering Arrays
93. The Existence of (K 2 × K 6)-Designs
94. Optical grooming with grooming ratio nine
95. SHARPER BOUNDS IN ADAPTIVE GROUP TESTING
96. Chip firing and all-terminal network reliability bounds
97. Tabu search for covering arrays using permutation vectors
98. Graph designs for the eight-edge five-vertex graphs
99. Minimum embedding of Steiner triple systems into [formula omitted]-designs II
100. Steiner Triple Systems of Order 19 with Nontrivial Automorphism Group
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.