114 results on '"Colbourn, Charles J."'
Search Results
2. Egalitarian Steiner quadruple systems of doubly even order
3. Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation
4. A hierarchical framework for recovery in compressive sensing
5. Variable-weight topology-transparent scheduling
6. Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures
7. Cover starters for covering arrays of strength two
8. Grooming traffic to minimize load
9. Mixed covering arrays of strength three with few factors
10. Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
11. Optical grooming with grooming ratio nine
12. Chip firing and all-terminal network reliability bounds
13. Tabu search for covering arrays using permutation vectors
14. Graph designs for the eight-edge five-vertex graphs
15. Minimum embedding of Steiner triple systems into [formula omitted]-designs II
16. Fully gated graphs: Recognition and convex operations
17. Constructing strength three covering arrays with augmented annealing
18. Strength two covering arrays: Existence tables and projection
19. Directed complete bipartite graph decompositions: Indirect constructions
20. Prioritized interaction testing for pair-wise coverage with seeding and constraints
21. Embedding path designs into kite systems
22. Ovals and hyperovals in nets
23. Grooming in unidirectional rings: K4− e designs
24. Optimal ( n,4,2)-OOC of small orders
25. Fractal Perfect Hash Families (Extended Abstract)
26. Optimal and pessimal orderings of Steiner triple systems in disk arrays
27. Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs
28. Projective planes and congestion-free networks
29. Asymptotically optimal erasure-resilient codes for large disk arrays
30. Modified group divisible designs with block size four
31. Distributing hash families with few rows.
32. Constructions of optimal orthogonal arrays with repeated rows.
33. Kirkman school project designs
34. Coding, Cryptography, and Computer Security
35. Minimum embedding of Steiner triple systems into [formula omitted]-designs I
36. In-Parameter-Order strategies for covering perfect hash families.
37. -vectors of pure complexes and pure multicomplexes of rank three.
38. Strengthening hash families and compressive sensing.
39. Optical grooming with grooming ratio nine
40. Optical grooming with grooming ratio eight
41. Merging covering arrays and compressing multiple sequence alignments
42. A carrier sense multiple access protocol with power backoff (CSMA/PB).
43. Failed disk recovery in double erasure RAID arrays.
44. On constant composition codes
45. Grooming in unidirectional rings: <f>K4-e</f> designs
46. Ladder orderings of pairs and RAID performance
47. Quorums from difference covers
48. Minimum embedding of Steiner triple systems into (K4−e)-designs II
49. Minimum embedding of Steiner triple systems into (K4-e)-designs I
50. Detecting and Locating Interaction Faults
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.