{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:03:04Z","timestamp":1742392984258},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_9","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"86-98","source":"Crossref","is-referenced-by-count":11,"title":["Improved Combinatorial Group Testing for Real-World Problem Sizes"],"prefix":"10.1007","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel S.","family":"Hirschberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Algorithmic Number Theory, Efficient Algorithms","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory, Efficient Algorithms. MIT Press, Cambridge (1996)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM\u00a013, 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"9_CR3","series-title":"London Mathematical Society Lecture Note Series","volume-title":"Surveys in Combinatorics","author":"C.J. Colbourn","year":"1999","unstructured":"Colbourn, C.J., Dinitz, J.H., Stinson, D.R.: Applications of combinatorial designs to communications, cryptography, and networking. In: Walker (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a0187, Cambridge University Press, Cambridge (1999)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-45061-0_8","volume-title":"Automata, Languages and Programming","author":"A. DeBonis","year":"2003","unstructured":"DeBonis, A., Gasieniec, L., Vaccaro, U.: Generalized framework for selectors with applications in optimal group testing. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 81\u201396. Springer, Heidelberg (2003)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Du, D.-Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications, 2nd edn. World Scientific, Singapore (2000)","DOI":"10.1142\/9789812798107"},{"key":"9_CR6","unstructured":"Dusart, P.: Encadrements effectifs des functions de Chebyshev (sharper bounds for \u03c6, \u03b8, \u03c0, p k ). Report, Laboratoire dArithm\u00e9tique, de Calcul formel et dOptimisation, Rapport no. 1998-06, http:\/\/www.unilim.fr\/laco\/rapports\/1998\/R1998_06.pdf"},{"issue":"225","key":"9_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1090\/S0025-5718-99-01037-6","volume":"68","author":"P. Dusart","year":"1999","unstructured":"Dusart, P.: The kth prime is greater than k(ln k\u2009+\u2009ln ln k\u2009\u2212\u20091) for k\u2009\u2265\u20092. Math. Comp.\u00a068(225), 411\u2013415 (1999)","journal-title":"Math. Comp."},{"key":"9_CR8","first-page":"357","volume-title":"SEQUENCES","author":"M. Farach","year":"1997","unstructured":"Farach, M., Kannan, S., Knill, E., Muthukrishnan, S.: Group testing problems with sequences in experimental molecular biology. In: SEQUENCES, p. 357. IEEE Press, Los Alamitos (1997)"},{"key":"9_CR9","first-page":"257","volume":"22","author":"F.K. Hwang","year":"1987","unstructured":"Hwang, F.K., S\u00f3s, V.T.: Non-adaptive hypergeometric group testing. Studia Scient. Math. Hungarica\u00a022, 257\u2013263 (1987)","journal-title":"Studia Scient. Math. Hungarica"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W.H. Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Th.\u00a010, 363\u2013377 (1964)","journal-title":"IEEE Trans. Inf. Th."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0378-3758(97)00092-X","volume":"66","author":"A.J. Macula","year":"1998","unstructured":"Macula, A.J., Reuter, G.R.: Simplified searching for two defects. J. Stat. Plan. Inf.\u00a066, 77\u201382 (1998)","journal-title":"J. Stat. Plan. Inf."},{"key":"9_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","volume":"66","author":"M. Ruszink\u00f3","year":"1994","unstructured":"Ruszink\u00f3, M.: On the upper bound of the size of the r-cover-free families. J. Combin. Th. Ser. A\u00a066, 302\u2013310 (1994)","journal-title":"J. Combin. Th. Ser. A"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T02:11:14Z","timestamp":1711332674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11534273_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}