{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T07:52:11Z","timestamp":1768722731590,"version":"3.49.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,4,1]],"date-time":"1985-04-01T00:00:00Z","timestamp":481161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,4]]},"DOI":"10.1007\/bf00290148","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T05:53:34Z","timestamp":1096955614000},"page":"101-114","source":"Crossref","is-referenced-by-count":17,"title":["Performance bounds for binary testing with arbitrary weights"],"prefix":"10.1007","volume":"22","author":[{"given":"Donald W.","family":"Loveland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1109\/PGEC.1967.264669","volume":"EC-16","author":"W.W. Chu","year":"1967","unstructured":"Chu, W.W.: A mathematical model for diagnosing system failures. IEEE Trans. Electron. Computers EC-16, 327?331 (1967)","journal-title":"IEEE Trans. Electron. Computers"},{"key":"CR2","volume-title":"Ph.D. dissertation","author":"M.R. Garey","year":"1970","unstructured":"Garey, M.R.: Optimal binary decision trees for diagnostic identification problems. Ph.D. dissertation, U. of Wisconsin, Madison, June1970"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1109\/TC.1972.5009013","volume":"C-21","author":"M.R. Garey","year":"1972","unstructured":"Garey, M.R.: Simple binary identification problems. IEEE Trans. Comput. C-21, 588?590 (1972)","journal-title":"IEEE Trans. Comput."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/0123019","volume":"23","author":"M.R. Garey","year":"1972","unstructured":"Garey, M.R.: Optimal binary identification procedures. SIAM J. Appl. Math. 23, 173?186 (1972)","journal-title":"SIAM J. Appl. Math."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF00263588","volume":"3","author":"M.R. Garey","year":"1974","unstructured":"Garey, M.R., Graham, R.L.: Performance bounds on the splitting algorithm for binary testing. Acta Inf. 3, 347?355 (1974)","journal-title":"Acta Inf."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L. Hyafil","year":"1976","unstructured":"Hyafil, L., Rivest, R.L.: Constructing optimal binary decision trees is NP-complete. Inf. Process. Lett. 5, 15?17 (1976)","journal-title":"Inf. Process. Lett."},{"key":"CR7","first-page":"228","volume-title":"Selecting optimal test procedures from incomplete test sets","author":"D.W. Loveland","year":"1979","unstructured":"Loveland, D.W.: Selecting optimal test procedures from incomplete test sets. Proc. First Int. Symp. Policy Anal. Inf. Sci., pp. 228?235. Duke University, Durham, NC, 1979"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1145\/357114.357120","volume":"2","author":"B.M.E. Moret","year":"1980","unstructured":"Moret, B.M.E., Thomason, M.G, Gonzalez, R.C.: The activity of a variable and its relation to decision trees. ACM Trans. Progr. Lang. Syst 2, 580?595 (1980)","journal-title":"ACM Trans. Progr. Lang. Syst"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.2307\/2982129","volume":"143","author":"R.W. Payne","year":"1980","unstructured":"Payne, R.W., Preece, D.A.: Identification keys and diagnostic tables: a review. J. Royal Stat Soc. (Series A) 143, 253?292 (1980)","journal-title":"J. Royal Stat Soc. (Series A)"},{"key":"CR10","volume-title":"Graphes et Questionaires. Tome 2 Questionaires","author":"C.F. Picard","year":"1972","unstructured":"Picard, C.F.: Graphes et Questionaires. Tome 2 Questionaires, Gauthier-Villars, Paris (1972)"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/321341.321343","volume":"13","author":"L.T. Reinwald","year":"1966","unstructured":"Reinwald, L.T., Soland, R.M.: Conversion of limited-entry decision tables to computer programs I: minimum average processing time. J. ACM 13, 339?358 (1966)","journal-title":"J. ACM"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/321229.321230","volume":"11","author":"J.R. Slagle","year":"1965","unstructured":"Slagle, J.R.: An efficient algorithm for finding certain minimum-cost procedures for making binary decisions. J. ACM 11, 253?264 (1965)","journal-title":"J. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290148.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00290148\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:15:19Z","timestamp":1554758119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00290148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,4]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,4]]}},"alternative-id":["BF00290148"],"URL":"https:\/\/doi.org\/10.1007\/bf00290148","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,4]]}}}