{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:48Z","timestamp":1725558948135},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_47","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"552-564","source":"Crossref","is-referenced-by-count":7,"title":["Improved Constructions for Non-adaptive Threshold\u00a0Group\u00a0Testing"],"prefix":"10.1007","author":[{"given":"Mahdi","family":"Cheraghchi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/aoms\/1177731363","volume":"14","author":"R. Dorfman","year":"1943","unstructured":"Dorfman, R.: The detection of defective members of large populations. Annals of Mathematical Statistics\u00a014, 436\u2013440 (1943)","journal-title":"Annals of Mathematical Statistics"},{"key":"47_CR2","volume-title":"Combinatorial Group Testing and its Applications","author":"D.Z. Du","year":"2000","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications, 2nd edn. World Scientific, Singapore (2000)","edition":"2"},{"key":"47_CR3","doi-asserted-by":"publisher","DOI":"10.1142\/9789812773463","volume-title":"Pooling Designs and Nonadaptive Group Testing","author":"D.Z. Du","year":"2006","unstructured":"Du, D.Z., Hwang, F.K.: Pooling Designs and Nonadaptive Group Testing. World Scientific, Singapore (2006)"},{"key":"47_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/11889342_45","volume-title":"General Theory of Information Transfer and Combinatorics","author":"P. Damaschke","year":"2006","unstructured":"Damaschke, P.: Threshold group testing. In: Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol.\u00a04123, pp. 707\u2013718. Springer, Heidelberg (2006)"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Chang, H., Chen, H.B., Fu, H.L., Shi, C.H.: Reconstruction of hidden graphs and threshold group testing. Journal of Combinatorial Optimization (2010)","DOI":"10.1007\/s10878-010-9291-0"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/j.dam.2008.06.003","volume":"157","author":"H.B. Chen","year":"2009","unstructured":"Chen, H.B., Fu, H.L.: Nonadaptive algorithms for threshold group testing. Discrete Applied Mathematics\u00a0157, 1581\u20131585 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Capalbo, M., Reingold, O., Vadhan, S., Wigderson, A.: Randomness conductors and constant-degree expansion beyond the degree\/2 barrier. In: Proceedings of the 34th STOC, pp. 659\u2013668 (2002)","DOI":"10.1145\/510002.510003"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In: Proc. of the 22nd IEEE CCC (2007)","DOI":"10.1109\/CCC.2007.38"},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W. Kautz","year":"1964","unstructured":"Kautz, W., Singleton, R.: Nonrandom binary superimposed codes. IEEE Transactions on Information Theory\u00a010, 363\u2013377 (1964)","journal-title":"IEEE Transactions on Information Theory"},{"key":"47_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1007\/978-3-540-70575-8_61","volume-title":"Automata, Languages and Programming","author":"E. Porat","year":"2008","unstructured":"Porat, E., Rothschild, A.: Explicit non-adaptive combinatorial group testing schemes. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 748\u2013759. Springer, Heidelberg (2008)"},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/mana.19821090103","volume":"109","author":"M.A. Tsfasman","year":"1982","unstructured":"Tsfasman, M.A., Vl\u0103du\u0163, S.G., Zink, T.: Modular curves, Shimura curves, and Goppa codes better than the Varshamov-Gilbert bound. Math. Nachrichten\u00a0109, 21\u201328 (1982)","journal-title":"Math. Nachrichten"},{"key":"47_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10878-006-9634-z","volume":"12","author":"H. Gao","year":"2006","unstructured":"Gao, H., Hwang, F.K., Thai, M.T., Wu, W., Znati, T.: Construction of d(H)-disjunct matrix for group testing in hypergraphs. Journal of Combinatorial Optimization\u00a012, 297\u2013301 (2006)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2-3","key":"47_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10878-007-9067-3","volume":"14","author":"H.B. Chen","year":"2007","unstructured":"Chen, H.B., Du, D.Z., Hwang, F.K.: An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. J. Comb. Opt.\u00a014(2-3), 121\u2013129 (2007)","journal-title":"J. Comb. Opt."},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1006\/jcta.1999.3036","volume":"90","author":"D. Stinson","year":"2000","unstructured":"Stinson, D., Wei, R., Zhu, L.: Some new bounds for cover-free families. Journal of Combinatorial Theory, Series A\u00a090, 224\u2013234 (2000)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"47_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1006\/jcta.2002.3257","volume":"99","author":"A. D\u2019yachkov","year":"2002","unstructured":"D\u2019yachkov, A., Vilenkin, P., Macula, A., Torney, D.: Families of finite sets in which no intersection of \u2113 sets is covered by the union of s others. Journal of Combinatorial Theory, Series A\u00a099, 195\u2013218 (2002)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"47_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/S0012-365X(03)00287-5","volume":"279","author":"D. Stinson","year":"2004","unstructured":"Stinson, D., Wei, R.: Generalized cover-free families. Discrete Mathematics\u00a0279, 463\u2013477 (2004)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"47_CR17","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s11590-007-0070-5","volume":"2","author":"H.B. Chen","year":"2008","unstructured":"Chen, H.B., Fu, H.L., Hwang, F.K.: An upper bound of the number of tests in pooling designs for the error-tolerant complex model. Optimization Letters\u00a02(3), 425\u2013431 (2008)","journal-title":"Optimization Letters"},{"key":"47_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/jcd.10056","volume":"12","author":"H.K. Kim","year":"2004","unstructured":"Kim, H.K., Lebedev, V.: On optimal superimposed codes. Journal of Combinatorial Designs\u00a012, 79\u201391 (2004)","journal-title":"Journal of Combinatorial Designs"},{"key":"47_CR19","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M.: Noise-resilient group testing: Limitations and constructions. In: Ge\u0327bala, M. (ed.) FCT 2009. LNCS, vol.\u00a05699, pp. 62\u201373. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03409-1_7"},{"issue":"2","key":"47_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1089\/cmb.2007.0195","volume":"15","author":"Y. Cheng","year":"2008","unstructured":"Cheng, Y., Du, D.Z.: New constructions of one- and two-stage pooling designs. Journal of Computational Biology\u00a015(2), 195\u2013205 (2008)","journal-title":"Journal of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:21Z","timestamp":1606186101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}