41 results on '"Colbourn, Charles J."'
Search Results
2. Egalitarian Steiner triple systems for data popularity
3. Access balancing in storage systems by labeling partial Steiner systems
4. Partial Covering Arrays: Algorithms and Asymptotics
5. Asymptotic and constructive methods for covering perfect hash families and covering arrays
6. The Spectrum of R-Orthogonal Latin Squares
7. Construction Techniques for Mutually Orthogonal Latin Squares
8. Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
9. Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm
10. Grade of Service Steiner Trees in Series-Parallel Networks
11. Reliability Issues In Telecommunications Network Planning
12. Concerning Difference Matrices
13. Making the Mols Table
14. Trails of triples in partial triple systems
15. Covering arrays from cyclotomy
16. Linear hash families and forbidden configurations
17. Small stopping sets in Steiner triple systems
18. Locating and detecting arrays for interaction faults
19. Transport schemes for topology-transparent scheduling
20. Grade of Service Steiner Trees in Series-Parallel Networks
21. A New Connection Between Convex Geometry and Threshold Logic
22. The Unity of Combinatorics
23. Some Mathematical Problems Arising in Molecular Bioinformatics: The Concept of Bioinformatics
24. An Algorithmic Approach to Tilings
25. General Theory of Translation Invariant Systems
26. Some Problems in Total Graph Theory
27. Bounding Two-Terminal Network Reliability via Surface Duality
28. Defining Sets for Block Designs: An Update
29. Directed Quadruple Designs
30. Vector-Weighted Matchings
31. On a Conjecture of A. Hartman
32. The NSM of a Graph
33. Exploring the Spectrum of Values of Permanents by Simulated Annealing
34. An Asymptotic Existence Result for Orthogonal Designs
35. Zero-Knowledge Proofs for Independent Set and Dominating Set Problems
36. Decomposition of Complete Tripartite Graphs Into 5-Cycles
37. A Linear-Time Algorithm for Minimum Cost Flow on Undirected One-Trees
38. A Simple Polynomial Time Algorithm for a Convex Hull Problem Equivalent to Linear Programming
39. (F, 2)—Rotational Steiner Triple Systems
40. Unsolved Problems in Combinatorial Games
41. Open Problems at the Combinatorics Workshop of Aimc25 (Tehran, 1994)
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.