A fast parallel algorithm for the maximal independent set problem
Journal of the ACM (JACM)
Efficient decentralized consensus protocols
IEEE Transactions on Software Engineering
Design theory
Discrete logarithms in finite fields and their cryptographic significance
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Combinatorics of experimental design
Combinatorics of experimental design
Expanders, sorting in rounds and superconcentrators of limited depth
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Non-trivial t-designs without repeated blocks exist for all t
Discrete Mathematics
Tight comparison bounds on the complexity of parallel sorting
SIAM Journal on Computing
Sorting and selecting in rounds
SIAM Journal on Computing
The number of sub-matrics of a given type in a Hadamard matrix and related results
Journal of Combinatorial Theory Series A
Some constructions and bounds for authentication codes
Journal of Cryptology
A construction for authentication/secrecy codes from certain combinatorial designs
Journal of Cryptology
A combinatorial approach to threshold schemes
SIAM Journal on Discrete Mathematics
On splitting sets in block designs and finding roots of polynomials
Discrete Mathematics
Hashing and trie algorithms for partial match retrieval
ACM Transactions on Database Systems (TODS)
Communications of the ACM
Using genetic algorithms to generate Steiner triple systems
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences
Steiner systems and the Boolean satisfiability problem
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Performance Evaluation of an Efficient Multiple Copy Update Algorithm
IEEE Transactions on Parallel and Distributed Systems
Projective planes and congestion-free networks
Discrete Applied Mathematics
Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs
Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
Multiple access communications using combinatorial designs
Theoretical aspects of computer science
Performance Analysis of Disk Arrays under Failure
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Distributed Cooperation During the Absence of Communication
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Multiple Access Communications Using Combinatorial Designs
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
The effects of synchronization on topology-transparent scheduling
Wireless Networks
Coined quantum walks lift the cospectrality of graphs and trees
Pattern Recognition
Combinatorial Designs for Authentication and Secrecy Codes
Foundations and Trends in Communications and Information Theory
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
Journal of Combinatorial Theory Series A
Quasipolynomial-time canonical form for steiner designs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The theory of combinatorial designs has been used in widely different areas of computation concerned with the design and analysis of both algorithms and hardware. Combinatorial designs capture a subtle balancing property that is inherent in many difficult problems and hence can provide a sophisticated tool for addressing these problems. The role of combinatorial designs in solving many problems that are basic to the field of computing is explored in this paper. Case studies of many applications of designs to computation are given; these constitute a first survey, which provides a representative sample of uses of designs. More importantly, they suggest paradigms in which designs can be used profitably in algorithm design and analysis.