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