Tracing a single user

European Journal of Combinatorics

Volumn 27, Issue 8 SPEC. ISS., 2006, Pages 1227-1234

  Alon, Noga ^a   Asodi, Vera ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748563108     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2006.05.001     Document Type: Article

References (15)

1. Alon N., Babai L., and Itai A. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7 (1986) 567-583
2. N. Alon, D. Moshkovitz, M. Safra, Algorithmic construction of sets for k-restrictions, ACM Trans. Algorithms (in press)
3. th IEEE FOCS (2002), IEEE 197-206 Also:
4. Alon N., Beigel R., Kasif S., Rudich S., and Sudakov B. Learning a hidden matching. SIAM J. Computing 33 (2004) 487-501
5. R. Beigel, N. Alon, M.S. Apaydin, L. Fortnow, S. Kasif, An optimal procedure for gap closing in whole genome shotgun sequencing, in: Proc. 2001 RECOMB, ACM Press, pp. 22-30
6. Balding D.J., Bruno W.J., Knill E., and Torney D.C. A comparative survey of non-adaptive pooling designs, Genetic mapping and DNA sequencing. In: Speed T.P., and Waterman M.S. (Eds). IMA Volumes in Mathematics and its Applications vol. 81 (1996), Springer-Verlag, New York 133-154
7. Colbourn C.C., Ling A.C.H., and Tompa M. Construction of optimal quality control for oligo arrays. Bioinformatics 18 4 (2002) 529-535
8. Csu{double acute}rös M., and Ruszinkó M. Single-user tracing and disjointly superimposed codes. IEEE Trans. Inform. Theory 51 4 (2005) 1606-1611
9. Coppersmith D., and Shearer J.B. New bounds for union-free families of sets. Electron. J. Combin. 5 1 (1998) #R39
10. Dyachkov A.G., and Rykov V.V. Bounds on the length of disjunctive codes. Probl. Pereda. Inf. 18 3 (1982) 158-166
11. Erdo{double acute}s P., Frankl P., and Füredi Z. Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51 (1985) 79-89
12. Füredi Z. A note on r-cover-free families. J. Combin. Theory Ser. A 73 1 (1996) 172-173
13. Hwang F.K., and Sós V.T. Non-adaptive hypergeometric group testing. Studia Sci. Math. Hungar. 22 (1987) 257-263
14. Kautz W.H., and Singleton R.C. Nonrandom binary superimposed codes. IEEE Trans. Inform. Theory 10 (1964) 363-377
15. Ruszinkó M. On the upper bound of the size of the r-cover-free families. J. Combin. Theory Ser. A 66 2 (1994) 302-310