61 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. Perfect Hash Families: The Generalization to Higher Indices
6. Algorithms for Constructing Anonymizing Arrays
7. There Must be Fifty Ways to Miss a Cover
8. Detecting Arrays for Main Effects
9. Counting Subwords and Regular Languages
10. Testbed Evaluation of Optimized REACT over Multi-hop Paths
11. Separating Interaction Effects Using Locating and Detecting Arrays
12. Faithful Enclosing of Triple Systems: A Generalization of Stern’s Theorem
13. Partial Covering Arrays: Algorithms and Asymptotics
14. Sequence Covering Arrays and Linear Extensions
15. Suitable Permutations, Binary Covering Arrays, and Paley Matrices
16. Randomized Post-optimization for t-Restrictions
17. Variable Weight Sequences for Adaptive Scheduled Access in MANETs
18. Efficient Conditional Expectation Algorithms for Constructing Hash Families
19. Binary Covering Arrays and Existentially Closed Graphs
20. Randomized Postoptimization of Covering Arrays
21. Steiner Systems for Topology-Transparent Access Control in MANETs
22. Multiple Access Communications Using Combinatorial Designs
23. Cluttered Orderings for the Complete Graph
24. Grade of Service Steiner Trees in Series-Parallel Networks
25. Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays
26. Reliability Issues In Telecommunications Network Planning
27. Rosa triple systems
28. Making the Mols Table
29. Concerning Difference Matrices
30. The Spectrum of R-Orthogonal Latin Squares
31. Construction Techniques for Mutually Orthogonal Latin Squares
32. Chapter 11 Network reliability
33. Wang tilings and distributed orientation on anonymous torus networks (extended abstract)
34. ON IMPLEMENTING AN ENVIRONMENT FOR INVESTIGATING NETWORK RELIABILITY
35. Unit Disk Graphs
36. Permutation Graphs: Connected Domination and Steiner Trees
37. An Optimal Algorithm for Directing Triple Systems Using Eulerian Circuits
38. Edge-Packings of Graphs and Network Reliability
39. Concurrent transmissions in broadcast networks
40. Decomposition of block designs: Computational issues
41. The Complexity of Combinatorial Isomorphism Problems
42. The Analysis of Directed Triple Systems by Refinement
43. The Computational Complexity of Finding Subdesigns in Combinatorial Designs
44. The Computational Complexity of Decomposing Block Designs
45. Partitions into Indecomposable Triple Systems
46. Kotzig Factorizations: Existence and Computational Results
47. Cubic Neighbourhoods in Triple Systems
48. Preface
49. Bounds for All-Terminal Reliability in Planar Networks
50. Percentages in 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.