{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:40:47Z","timestamp":1775054447790,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642157745","type":"print"},{"value":"9783642157752","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_18","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"207-218","source":"Crossref","is-referenced-by-count":11,"title":["Superselectors: Efficient Constructions and Applications"],"prefix":"10.1007","author":[{"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/TIT.2006.887089","volume":"53","author":"N. Alon","year":"2007","unstructured":"Alon, N., Asodi, V.: Tracing many users with almost no rate penalty. IEEE Trans. on Information Theory\u00a053(1), 437\u2013439 (2007)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1109\/TIT.2008.2011507","volume":"55","author":"N. Alon","year":"2009","unstructured":"Alon, N., Hod, R.: Optimal Monotone Encodings. IEEE Trans. on Information Theory\u00a055(3), 1343\u20131353 (2009)","journal-title":"IEEE Trans. on Information Theory"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-1-4612-0751-1_8","volume-title":"Genetic mapping and DNA sequencing, IMA Volumes in Mathematics and its Appl.","author":"D.J. Balding","year":"1996","unstructured":"Balding, D.J., et al.: A comparative survey of non-adaptive pooling design. In: Speed, T.P., Waterman, M.S. (eds.) Genetic mapping and DNA sequencing, IMA Volumes in Mathematics and its Appl., pp. 133\u2013154. Springer, Heidelberg (1996)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Radhakrishnan, J.: Deterministic restrictions in circuit complexity. In: Proc. of 28th STOC, pp. 30\u201336 (1996)","DOI":"10.1145\/237814.237824"},{"issue":"2","key":"18_CR5","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"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11590-008-0109-2","volume":"3","author":"Y. Cheng","year":"2009","unstructured":"Cheng, Y., Du, D.Z., Lin, G.: On the upper bounds of the minimum number of rows of disjunct matrices. Optimization Letters\u00a03, 297\u2013302 (2009)","journal-title":"Optimization Letters"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/11537311_24","volume-title":"Fundamentals of Computation Theory","author":"B.S. Chlebus","year":"2005","unstructured":"Chlebus, B.S., Kowalski, D.R.: Almost Optimal Explicit Selectors. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 270\u2013280. Springer, Heidelberg (2005)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M.: Noise-resilient group testing: Limitations and constructions. In: Proc. of FCT 2009 (2009)","DOI":"10.1007\/978-3-642-03409-1_7"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Gasieniec, L., Rytter, W.: Fast Broadcasting and Gossiping in Radio Networks. In: FOCS 2000, pp. 575\u2013581 (2000)","DOI":"10.1109\/SFCS.2000.892325"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. of Symp. on Discrete Algorithms (SODA 2001), pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11780823_22","volume-title":"Structural Information and Communication Complexity","author":"G. Cormode","year":"2006","unstructured":"Cormode, G., Muthukrishnan, S.: Combinatorial Algorithms for Compressed Sensing. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 280\u2013294. Springer, Heidelberg (2006)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TIT.1973.1054929","volume":"19","author":"T. Cover","year":"1973","unstructured":"Cover, T.: Enumerative source encoding. IEEE Trans. Inf. Th.\u00a019, 73\u201377 (1973)","journal-title":"IEEE Trans. Inf. Th."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Damaschke, P.: Adaptive versus Nonadaptive Attribute-Efficient Learning. In: STOC 1998, pp. 590\u2013596 (1998)","DOI":"10.1145\/276698.276874"},{"key":"18_CR14","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. Theoretical Computer Science\u00a0306, 223\u2013243 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"18_CR15","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. on Comp.\u00a034(5), 1253\u20131270 (2005)","journal-title":"SIAM J. on Comp."},{"key":"18_CR16","doi-asserted-by":"publisher","DOI":"10.1142\/9789812773463","volume-title":"Pooling Design and Nonadaptive Group Testing","author":"D.Z. Du","year":"2006","unstructured":"Du, D.Z., Hwang, F.K.: Pooling Design and Nonadaptive Group Testing. World Scientific, Singapore (2006)"},{"key":"18_CR17","first-page":"7","volume":"11","author":"A.G. D\u2019yachkov","year":"1982","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: Bounds of the length of disjunct codes. Problems Control Inform. Theory\u00a011, 7\u201313 (1982)","journal-title":"Problems Control Inform. Theory"},{"key":"18_CR18","first-page":"237","volume":"18","author":"A.G. D\u2019yachkov","year":"1989","unstructured":"D\u2019yachkov, A.G., Rykov, V.V., Rashad, A.M.: Superimposed distance codes. Problems Control Inform. Theory\u00a018, 237\u2013250 (1989)","journal-title":"Problems Control Inform. Theory"},{"key":"18_CR19","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. on Comp.\u00a036, 1360\u20131375 (2007)","journal-title":"SIAM J. on Comp."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02772959","volume":"51","author":"P. Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s, P., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of r others. Israel J. of Math.\u00a051, 75\u201389 (1985)","journal-title":"Israel J. of Math."},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-92182-0_8","volume-title":"Algorithms and Computation","author":"S. Ganguly","year":"2008","unstructured":"Ganguly, S.: Data stream algorithms via expander graph. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 52\u201363. Springer, Heidelberg (2008)"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Iwen, M.A., Strauss, M.J.: Group Testing and Sparse Signal Recovery. In: 42nd Asilomar Conf. on Signals, Systems, and Computers, pp. 1059\u20131063 (2008)","DOI":"10.1109\/ACSSC.2008.5074574"},{"issue":"1","key":"18_CR23","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s004530010033","volume":"28","author":"V. Grebinsky","year":"2000","unstructured":"Grebinsky, V., Kucherov, G.: Optimal Reconstruction of Graphs under the Additive Model. Algorithmica\u00a028(1), 104\u2013124 (2000)","journal-title":"Algorithmica"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Deterministic superimposed coding with application to pattern matching. In: Proc. of 39th FOCS 1997, pp. 127\u2013136 (1997)","DOI":"10.1109\/SFCS.1997.646101"},{"key":"18_CR25","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1137\/1.9781611973075.91","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Piotr Indyk","year":"2010","unstructured":"Indyk, P., Ngo, H.Q., Rudra, A.: Efficiently Decodable Non-adaptive Group Testing. In: Proc. of 20th SODA, pp. 1126\u20131142 (2010)"},{"key":"18_CR26","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.R.: Nonrandom binary superimposed codes. IEEE Trans. on Inform. Theory\u00a010, 363\u2013377 (1964)","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/3-540-48405-1_38","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"R. Kumar","year":"1999","unstructured":"Kumar, R., Rajagopalan, S., Sahai, A.: Coding constructions for blacklisting problems without computational assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 609\u2013623. Springer, Heidelberg (1999)"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Laczay, B., Ruszink\u00f3, M.: Multiple User Tracing Codes. In: Proc. of ISIT 2006, pp. 1900\u20131904 (2006)","DOI":"10.1109\/ISIT.2006.261811"},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. on Computing\u00a021, 311\u2013312 (1992); Discrete Mathematics 162, 311-312 (1996)","journal-title":"SIAM J. on Computing"},{"key":"18_CR30","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-73420-8_28","volume-title":"Automata, Languages and Programming","author":"T. Moran","year":"2007","unstructured":"Moran, T., Naor, M., Segev, G.: Deterministic history-independent strategies for storing information on write-once memories. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 303\u2013315. Springer, Heidelberg (2007)"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Porat, B., Porat, E.: Exact and Approximate Pattern Matching in the Streaming Model. In: Proc. 50th FOCS, pp. 315\u2013323 (2009)","DOI":"10.1109\/FOCS.2009.11"},{"key":"18_CR33","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":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-75520-3_15","volume-title":"Algorithms \u2013 ESA 2007","author":"R. Clifford","year":"2007","unstructured":"Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: k-Mismatch with Don\u2019t Cares. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 151\u2013162. Springer, Heidelberg (2007)"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Ryabko, B.: Fast Enumerative Source Conding. In: Proc. of 1995 IEEE Intern. Symp. on Inf. Th., p. 395 (1995)","DOI":"10.1109\/ISIT.1995.550382"},{"key":"18_CR36","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TIT.1985.1057026","volume":"31","author":"J. Wolf","year":"1985","unstructured":"Wolf, J.: Born again group testing: Multiaccess Communications. IEEE Trans. Information Theory\u00a031, 185\u2013191 (1985)","journal-title":"IEEE Trans. Information Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T10:51:53Z","timestamp":1740480713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}