{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:51:53Z","timestamp":1778647913874,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00119-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:07:02Z","timestamp":1027624022000},"page":"83-92","source":"Crossref","is-referenced-by-count":18,"title":["On the cut-off point for combinatorial group testing"],"prefix":"10.1016","volume":"91","author":[{"given":"Paul","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbert","family":"Klasner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingo","family":"Wegenera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00119-X_BIB1","series-title":"Search Problems","author":"Ahlswede","year":"1987"},{"key":"10.1016\/S0166-218X(98)00119-X_BIB2","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0166-218X(98)00119-X_BIB3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1006\/jcss.1995.1004","article-title":"Learning in the presence of finitely or infinitely many irrelevant attributes","volume":"50","author":"Blum","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(98)00119-X_BIB4","series-title":"Proceedings of the 9th Conference on Computational Learning Theory COLT'96","first-page":"235","article-title":"Attribute-efficient learning in query and mistake-bound models","author":"Bshouty","year":"1996"},{"key":"10.1016\/S0166-218X(98)00119-X_BIB5","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1214\/aoms\/1177731363","article-title":"The detection of defective members of large populations","volume":"14","author":"Dorfman","year":"1943","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0166-218X(98)00119-X_BIB6","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1137\/0603053","article-title":"Minimizing a combinatorial function","volume":"3","author":"Du","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(98)00119-X_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-63577-7_60","article-title":"On learning disjunctions of zero-one threshold functions with queries","author":"Heged\u00fcs","year":"1997"},{"key":"10.1016\/S0166-218X(98)00119-X_BIB8","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/234752.234755","article-title":"How many queries are needed to learn","volume":"43","author":"Hellerstein","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(98)00119-X_BIB9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1137\/0602011","article-title":"A boundary problem for group testing","volume":"2","author":"Hu","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(98)00119-X_BIB10","first-page":"229","article-title":"Group-testing to classify all units in a trinomial sample","volume":"5","author":"Kumar","year":"1970","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/S0166-218X(98)00119-X_BIB11","series-title":"Th\u00e9orie des Questionnaires","author":"Picard","year":"1965"},{"key":"10.1016\/S0166-218X(98)00119-X_BIB12","series-title":"Information and Decision Processes","first-page":"127","article-title":"Group testing to classify efficiently all defectives in a binomial sample","author":"Sobel","year":"1960"},{"key":"10.1016\/S0166-218X(98)00119-X_BIB13","first-page":"19","article-title":"Binomial and hypergeometric group testing","volume":"3","author":"Sobel","year":"1968","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/S0166-218X(98)00119-X_BIB14","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1002\/j.1538-7305.1959.tb03914.x","article-title":"Group testing to classify efficiently all defectives in a binomial sample","volume":"38","author":"Sobel","year":"1959","journal-title":"Bell Systems Techn. J."},{"key":"10.1016\/S0166-218X(98)00119-X_BIB15","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1214\/aoms\/1177706807","article-title":"On the detection of defective members of large populations","volume":"28","author":"Sterrett","year":"1957","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/S0166-218X(98)00119-X_BIB16","series-title":"Proceedings of 3rd European Conference on Computational Learning Theory","first-page":"171","article-title":"Optimal attribute-efficient learning of disjunctions, parity, and threshold functions","volume":"vol. 1208","author":"Uehara","year":"1997"},{"key":"10.1016\/S0166-218X(98)00119-X_BIB17","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/cpa.3160130105","article-title":"The cut-off point for group testing","volume":"13","author":"Ungar","year":"1960","journal-title":"Commun. Pure Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9800119X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9800119X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:50:29Z","timestamp":1555984229000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X9800119X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X9800119X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00119-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}