{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T06:39:19Z","timestamp":1780555159665,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642276590","type":"print"},{"value":"9783642276606","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27660-6_18","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T10:14:28Z","timestamp":1326708868000},"page":"214-225","source":"Crossref","is-referenced-by-count":20,"title":["Randomized Group Testing Both Query-Optimal and Minimal Adaptive"],"prefix":"10.1007","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Azam Sheikh","family":"Muhammad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1080\/07408170490426206","volume":"36","author":"I. Ben-Gal","year":"2004","unstructured":"Ben-Gal, I.: An Upper Bound on the Weight-Balanced Testing Procedure with Multiple Testers. IIE Trans.\u00a036, 481\u2013493 (2004)","journal-title":"IIE Trans."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.dam.2006.10.009","volume":"155","author":"H.B. Chen","year":"2007","unstructured":"Chen, H.B., Hwang, F.K.: Exploring the Missing Link Among d-Separable, d\u0304-Separable and d-Disjunct Matrices. Discr. Appl. Math.\u00a0155, 662\u2013664 (2007)","journal-title":"Discr. Appl. Math."},{"key":"18_CR3","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. J. Comp. Biol.\u00a015, 195\u2013205 (2008)","journal-title":"J. Comp. Biol."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective Families, Superimposed Codes, and Broadcasting on Unknown Radio Networks. In: SODA 2001, pp. 709\u2013718. ACM\/SIAM (2001)","DOI":"10.1145\/383962.384040"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/1061318.1061325","volume":"30","author":"G. Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s Hot and What\u2019s Not: Tracking Most Frequent Items Dynamically. ACM Trans. Database Systems\u00a030, 249\u2013278 (2005)","journal-title":"ACM Trans. Database Systems"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1142\/S179383091000067X","volume":"2","author":"P. Damaschke","year":"2010","unstructured":"Damaschke, P., Sheikh, M.A.: Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. Discr. Math. Algor. Appl.\u00a02, 291\u2013311 (2010)","journal-title":"Discr. Math. Algor. Appl."},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-17461-2_10","volume-title":"Combinatorial Optimization and Applications","author":"P. Damaschke","year":"2010","unstructured":"Damaschke, P., Muhammad, A.S.: Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol.\u00a06509, pp. 117\u2013130. Springer, Heidelberg (2010)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539703428002","volume":"34","author":"A. Bonis De","year":"2005","unstructured":"De Bonis, A., Gasieniec, L., Vaccaro, U.: Optimal Two-Stage Algorithms for Group Testing Problems. SIAM J. Comp.\u00a034, 1253\u20131270 (2005)","journal-title":"SIAM J. Comp."},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(03)00281-0","volume":"306","author":"A. Bonis De","year":"2003","unstructured":"De Bonis, A., Vaccaro, U.: Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels. Theor. Comp. Sc.\u00a0306, 223\u2013243 (2003)","journal-title":"Theor. Comp. Sc."},{"key":"18_CR10","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. The Annals of Math. Stat.\u00a014, 436\u2013440 (1943)","journal-title":"The Annals of Math. Stat."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Hwang, F.K.: Pooling Designs and Nonadaptive Group Testing. Series on Appl. Math., vol.\u00a018. World Scientific (2006)","DOI":"10.1142\/6122"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1137\/050631847","volume":"36","author":"D. Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. Comp.\u00a036, 1360\u20131375 (2007)","journal-title":"SIAM J. Comp."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10878-007-9087-z","volume":"15","author":"M.T. Goodrich","year":"2008","unstructured":"Goodrich, M.T., Hirschberg, D.S.: Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis. J. Comb. Optim.\u00a015, 95\u2013121 (2008)","journal-title":"J. Comb. Optim."},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1287\/opre.32.2.423","volume":"32","author":"R. Hassin","year":"1984","unstructured":"Hassin, R.: A Dichotomous Search for a Geometric Random Variable. Oper. Res.\u00a032, 423\u2013439 (1984)","journal-title":"Oper. Res."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1142\/S0218539396000041","volume":"3","author":"Q.M. He","year":"1996","unstructured":"He, Q.M., Gerchak, Y., Grosfeld-Nir, A.: Optimal Inspection Order When Process Failure Rate is Constant. Int. J. Reliability, Quality and Safety Eng.\u00a03, 25\u201341 (1996)","journal-title":"Int. J. Reliability, Quality and Safety Eng."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D.A. Huffman","year":"1952","unstructured":"Huffman, D.A.: A Method for the Construction of Minimum-Redundancy Codes. Proc. IRE\u00a040, 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"key":"18_CR17","unstructured":"Iwen, M.A., Tewfik, A.H.: Adaptive Group Testing Strategies for Target Detection and Localization in Noisy Environments. IMA Preprint Series no. 2311. Univ. of Minnesota (2010)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TCAD.2005.854635","volume":"25","author":"A.B. Kahng","year":"2006","unstructured":"Kahng, A.B., Reda, S.: New and Improved BIST Diagnosis Methods from Combinatorial Group Testing Theory. IEEE Trans. CAD of Integr. Circuits and Systems\u00a025, 533\u2013543 (2006)","journal-title":"IEEE Trans. CAD of Integr. Circuits and Systems"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1186\/1471-2105-11-299","volume":"11","author":"R.M. Kainkaryam","year":"2010","unstructured":"Kainkaryam, R.M., Bruex, A., Gilbert, A.C., Schiefelbein, J., Woolf, P.J.: poolMC: Smart Pooling of mRNA Samples in Microarray Experiments. BMC Bioinf.\u00a011, 299 (2010)","journal-title":"BMC Bioinf."},{"key":"18_CR20","volume-title":"Algorithm Design","author":"J. Kleinberg","year":"2006","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley, Boston (2006)"},{"key":"18_CR21","first-page":"215","volume-title":"Theory of Graphs, Colloq. Proc.","author":"D. Kleitman","year":"1968","unstructured":"Kleitman, D.: On a Conjecture of Erd\u00f6s\u2013Katona on Commensurable Pairs Among Subsets of an n\u2013Set. In: Erd\u00f6s, P., Katona, G. (eds.) Theory of Graphs, Colloq. Proc., pp. 215\u2013218. Akademiai Kiado, Budapest (1968)"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0021-9800(66)80035-2","volume":"1","author":"D. Lubell","year":"1966","unstructured":"Lubell, D.: A Short Proof of Sperner\u2019s Lemma. J. Comb. Theory\u00a01, 299 (1966)","journal-title":"J. Comb. Theory"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1109\/TIT.2010.2103752","volume":"57","author":"M. M\u00e9zard","year":"2011","unstructured":"M\u00e9zard, M., Toninelli, C.: Group Testing With Random Pools: Optimal Two-Stage Algorithms. IEEE Trans. Info. Th.\u00a057, 1736\u20131745 (2011)","journal-title":"IEEE Trans. Info. Th."},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge Univ. Press (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1017\/S0963548304006649","volume":"14","author":"J. Schlaghoff","year":"2005","unstructured":"Schlaghoff, J., Triesch, E.: Improved Results for Competitive Group Testing. Comb. Prob. and Comp.\u00a014, 191\u2013202 (2005)","journal-title":"Comb. Prob. and Comp."},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/S0021-9800(70)80038-2","volume":"8","author":"J. Spencer","year":"1970","unstructured":"Spencer, J.: Minimal Completely Separating Systems. J. Combin. Theory\u00a08, 446\u2013447 (1970)","journal-title":"J. Combin. Theory"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E. Sperner","year":"1928","unstructured":"Sperner, E.: Ein Satz \u00fcber Untermengen einer endlichen Menge. Math. Zeitschrift\u00a027, 544\u2013548 (1928) (in German)","journal-title":"Math. Zeitschrift"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2012: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27660-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:35:20Z","timestamp":1558298120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27660-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276590","9783642276606"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27660-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}