344 results on '"Colbourn, Charles J."'
Search Results
2. An Efficient Screening Method for Identifying Parameters and Interactions that Impact Wireless Network Performance
3. Network reliability
4. Covering strong separating hash families
5. Scalable level-wise screening experiments using locating arrays
6. The spectrum of resolvable Bose triple systems
7. Perfect Hash Families: The Generalization to Higher Indices
8. Algorithms for Constructing Anonymizing Arrays
9. There Must be Fifty Ways to Miss a Cover
10. Summary of In-Parameter-Order strategies for covering perfect hash families
11. Detecting Arrays for Main Effects
12. Algorithmic methods for covering arrays of higher index
13. Counting Subwords and Regular Languages
14. Testbed Evaluation of Optimized REACT over Multi-hop Paths
15. Separating Interaction Effects Using Locating and Detecting Arrays
16. Egalitarian Steiner quadruple systems of doubly even order
17. Faithful Enclosing of Triple Systems: A Generalization of Stern’s Theorem
18. In-Parameter-Order strategies for covering perfect hash families
19. Partial Covering Arrays: Algorithms and Asymptotics
20. Egalitarian Steiner triple systems for data popularity
21. Sequence Covering Arrays and Linear Extensions
22. Suitable Permutations, Binary Covering Arrays, and Paley Matrices
23. Egalitarian Edge Orderings of Complete Graphs
24. Mixed covering arrays on graphs of small treewidth
25. New bounds on the maximum size of Sperner partition systems
26. Randomized Post-optimization for t-Restrictions
27. Popularity Block Labelling for Steiner Systems
28. Variable Weight Sequences for Adaptive Scheduled Access in MANETs
29. Efficient Conditional Expectation Algorithms for Constructing Hash Families
30. Binary Covering Arrays and Existentially Closed Graphs
31. Randomized Postoptimization of Covering Arrays
32. Network reliability: Heading out on the highway
33. Access balancing in storage systems by labeling partial Steiner systems
34. On the maximum double independence number of Steiner triple systems
35. Distributing hash families with few rows
36. Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation
37. Constructions of optimal orthogonal arrays with repeated rows
38. Steiner Systems for Topology-Transparent Access Control in MANETs
39. Multiple Access Communications Using Combinatorial Designs
40. Cluttered Orderings for the Complete Graph
41. Grade of Service Steiner Trees in Series-Parallel Networks
42. Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays
43. Reliability Issues In Telecommunications Network Planning
44. Rosa triple systems
45. Making the Mols Table
46. Concerning Difference Matrices
47. The Spectrum of R-Orthogonal Latin Squares
48. Construction Techniques for Mutually Orthogonal Latin Squares
49. Chapter 11 Network reliability
50. Genetic algorithms for affine transformations to existential t -restrictions
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.