110 results on '"Colbourn, Charles J."'
Search Results
2. The spectrum of resolvable Bose triple systems
3. Egalitarian Steiner quadruple systems of doubly even order
4. In-Parameter-Order strategies for covering perfect hash families
5. New bounds on the maximum size of Sperner partition systems
6. Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation
7. A hierarchical framework for recovery in compressive sensing
8. Variable-weight topology-transparent scheduling
9. Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures
10. Covering and packing for pairs
11. Randomized post-optimization of covering arrays
12. Cover starters for covering arrays of strength two
13. Grooming traffic to minimize load
14. Mixed covering arrays of strength three with few factors
15. Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
16. Optical grooming with grooming ratio nine
17. Chip firing and all-terminal network reliability bounds
18. Tabu search for covering arrays using permutation vectors
19. Graph designs for the eight-edge five-vertex graphs
20. Minimum embedding of Steiner triple systems into [formula omitted]-designs II
21. Fully gated graphs: Recognition and convex operations
22. Constructing strength three covering arrays with augmented annealing
23. Strength two covering arrays: Existence tables and projection
24. Directed complete bipartite graph decompositions: Indirect constructions
25. Prioritized interaction testing for pair-wise coverage with seeding and constraints
26. Embedding path designs into kite systems
27. Ovals and hyperovals in nets
28. Grooming in unidirectional rings: K4− e designs
29. Optimal ( n,4,2)-OOC of small orders
30. Fractal Perfect Hash Families (Extended Abstract)
31. Optimal and pessimal orderings of Steiner triple systems in disk arrays
32. Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs
33. Projective planes and congestion-free networks
34. Quorum Systems Constructed from Combinatorial Designs
35. Asymptotically optimal erasure-resilient codes for large disk arrays
36. Modified group divisible designs with block size four
37. Kirkman school project designs
38. Coding, Cryptography, and Computer Security
39. Minimum embedding of Steiner triple systems into [formula omitted]-designs I
40. Quorums from difference covers
41. Detecting and Locating Interaction Faults
42. Transversal Designs in Classical Planes and Spaces
43. PII: S0012-365X(02)00472-7
44. PII: S0012-365X(00)00407-6
45. Preface
46. Analysis and synthesis problems for network resilience
47. Conflict-free access to parallel memories
48. Neighbor designs and m-wheel systems
49. Recursive constructions for cyclic block designs
50. Quintessential pairwise balanced designs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.