128 results on '"Colbourn, Charles J."'
Search Results
2. Asymptotic Existence of Egalitarian Steiner 2-Designs
3. Mixed-Level Covering, Locating, and Detecting Arrays via Cyclotomy
4. Resolutions for an Infinite Family of Bose Triple Systems
5. Perfect Hash Families: The Generalization to Higher Indices
6. Algorithms for Constructing Anonymizing Arrays
7. Detecting Arrays for Main Effects
8. Counting Subwords and Regular Languages
9. Separating Interaction Effects Using Locating and Detecting Arrays
10. Testbed Evaluation of Optimized REACT over Multi-hop Paths
11. Suitable Permutations, Binary Covering Arrays, and Paley Matrices
12. Partial Covering Arrays: Algorithms and Asymptotics
13. Sequence Covering Arrays and Linear Extensions
14. Randomized Post-optimization for t-Restrictions
15. Variable Weight Sequences for Adaptive Scheduled Access in MANETs
16. Efficient Conditional Expectation Algorithms for Constructing Hash Families
17. Randomized Postoptimization of Covering Arrays
18. Binary Covering Arrays and Existentially Closed Graphs
19. The Spectrum of R-Orthogonal Latin Squares
20. Construction Techniques for Mutually Orthogonal Latin Squares
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. Concerning Difference Matrices
28. Making the Mols Table
29. Wang tilings and distributed orientation on anonymous torus networks (extended abstract)
30. Concurrent transmissions in broadcast networks
31. Decomposition of block designs: Computational issues
32. A Survey of Heffter Arrays
33. Constructing Random Steiner Triple Systems: An Experimental Study
34. Small Transitive Homogeneous Designs
35. Colourings of Path Systems
36. A Lower Bound on the Share Size of Leakage-Resilient Secret-Sharing Schemes
37. A Survey on Constructive Methods for the Oberwolfach Problem and Its Variants
38. Private Computations on Set Intersection
39. Tight Heffter Arrays from Finite Fields
40. Orthogonal and Strong Frame Starters: Revisited
41. Mutually Orthogonal Binary Frequency Squares of Mixed Type
42. A Survey of Cover-Free Families: Constructions, Applications, and Generalizations
43. Quaternary Legendre Pairs
44. On a Class of Optimal Constant Weight Codes
45. On the Spectrum of Large Sets Plus of Partitioned Incomplete Latin Squares of Type
46. Block Size Five: Quo Vadis?
47. An Alternative Existence Proof for LSTS
48. Self-Orthogonal Latin Squares and Room Squares
49. Group Rings and Character Sums: Tricks of the Trade
50. On the Optimization of Pippenger’s Bucket Method with Precomputation
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.