Color critical hypergraphs and forbidden configurations, Proc. EuroComb2005, pp.117-122, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-01184389
Neural Network Learning: Theoretical Foundations, 1999. ,
DOI : 10.1017/CBO9780511624216
On exact specification by examples, Proceedings of the fifth annual workshop on Computational learning theory , COLT '92, pp.311-318, 1992. ,
DOI : 10.1145/130385.130420
Poisson approximation, 1992. ,
Asymptotic overview on separating codes, 2003. ,
Upper Bounds on Separating Codes, IEEE Transactions on Information Theory, vol.50, issue.6, pp.1291-1295, 2004. ,
DOI : 10.1109/TIT.2004.828140
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels, Theor. Comput. Sci, vol.306, issue.1-3, pp.223-243, 2003. ,
Bounds on the length of disjunctive codes, Prob. Info. Transmission, vol.18, pp.166-171, 1983. ,
Interval Packing and Covering in the Boolean Lattice, Combinatorics, Probability and Computing, vol.3, issue.04, pp.373-384, 1996. ,
DOI : 10.1007/BF01788531
Families of finite sets in which no set is covered by the union of two others, Journal of Combinatorial Theory, Series A, vol.33, issue.2, pp.158-166, 1982. ,
DOI : 10.1016/0097-3165(82)90004-8
An introduction to probability theory and its applications, volume I, 1968. ,
Onr-Cover-free Families, Journal of Combinatorial Theory, Series A, vol.73, issue.1, pp.172-173, 1996. ,
DOI : 10.1006/jcta.1996.0012
Non-adaptive hypergeometric group testing, Stud. Sci. Math. Hung, vol.22, issue.1- 4, pp.257-263, 1987. ,
Coupling and Poisson approximation, Acta Applicandae Mathematicae, vol.11, issue.1-2, pp.7-15, 1994. ,
DOI : 10.1007/BF00994254
Nonrandom binary superimposed codes, IEEE Transactions on Information Theory, vol.10, issue.4, pp.363-377, 1964. ,
DOI : 10.1109/TIT.1964.1053689
Some new results on superimposed codes, Journal of Combinatorial Designs, vol.90, issue.4, pp.276-285, 2005. ,
DOI : 10.1002/jcd.20029
Constructions of 2-cover-free families and related separating hash families, Journal of Combinatorial Designs, vol.1556, issue.6, 2005. ,
DOI : 10.1002/jcd.20109
Key storage in secure networks, Discrete Applied Mathematics, vol.21, issue.3, pp.215-228, 1988. ,
DOI : 10.1016/0166-218X(88)90068-6
On the Upper Bound of the Size of the R-Cover-Free Families, Proceedings. IEEE International Symposium on Information Theory, pp.302-310, 1994. ,
DOI : 10.1109/ISIT.1993.748683
On the density of families of sets, Journal of Combinatorial Theory, Series A, vol.13, issue.1, pp.145-147, 1972. ,
DOI : 10.1016/0097-3165(72)90019-2
Existence of submatrices with all possible columns, Journal of Combinatorial Theory, Series A, vol.24, issue.1, pp.84-88, 1978. ,
DOI : 10.1016/0097-3165(78)90046-8
The VC dimension ofk-uniform random hypergraphs, Random Structures and Algorithms, vol.1541, issue.4, 2006. ,
DOI : 10.1002/rsa.20142
VC-dimensions of random function classes, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00853123