993 results on '"Colbourn, Charles J."'
Search Results
202. Compressed Sensing With Combinatorial Designs: Theory and Simulations
203. Partial Covering Arrays: Algorithms and Asymptotics
204. Asymptotic and constructive methods for covering perfect hash families and covering arrays
205. Upper Bounds on the Size of Covering Arrays
206. Steiner Triple Systems with High Chromatic Index
207. The 3-GDDs of type $g^3u^2$
208. Locating one pairwise interaction: Three recursive constructions
209. Screening interacting factors in a wireless network testbed using locating arrays
210. Coverage, Location, Detection, and Measurement
211. Disjoint Spread Systems and Fault Location
212. The Existence of Well‐Balanced Triple Systems
213. Legacy of the Luoshu: The 4,000 Year Search for the Meaning of the Magic Square of Order Three Frank J. Swetz
214. Edge-coloured designs with block size four
215. Hybrid triple systems and cubic feedback sets
216. Quadratic leaves of maximal partial triple systems
217. Counting almost minimum cutsets with reliability applications
218. Element neighbourhoods in twofold triple systems
219. Minimizing setups in ordered sets of fixed width
220. Group divisible covering designs with block size four.
221. Improved Strength Four Covering Arrays with Three Symbols.
222. Locating one pairwise interaction: Three recursive constructions.
223. The 3-GDDs of type g³u².
224. A Discrete Particle Swarm Optimization for Covering Array Generation
225. Locating Arrays
226. DROP COST AND WAVELENGTH OPTIMAL TWO-PERIOD GROOMING WITH RATIO 4∗
227. ATLAS: Adaptive Topology- and Load-Aware Scheduling
228. Computational Issues in Network Reliability
229. Drop cost and wavelength optimal two-period grooming with ratio 4
230. An Optimal Algorithm for Directing Triple Systems Using Eulerian Circuits
231. Edge-Packings of Graphs and Network Reliability
232. Concurrent transmissions in broadcast networks
233. The Complexity of Combinatorial Isomorphism Problems
234. The Analysis of Directed Triple Systems by Refinement
235. The Computational Complexity of Finding Subdesigns in Combinatorial Designs
236. The Computational Complexity of Decomposing Block Designs
237. Partitions into Indecomposable Triple Systems
238. Kotzig Factorizations: Existence and Computational Results
239. Cubic Neighbourhoods in Triple Systems
240. Preface
241. Bounds for All-Terminal Reliability in Planar Networks
242. Percentages in Pairwise Balanced Designs
243. Deciding Hadamard equivalence of Hadamard matrices
244. Boolean Aspects of Network Reliability
245. Covering arrays, augmentation, and quilting arrays
246. f-vectors of pure complexes and pure multicomplexes of rank three
247. Routing in mobile aerial networks
248. Applications of combinatorial designs in computer science
249. Resolvable Covering Arrays
250. Covering and packing for pairs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.