{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:55Z","timestamp":1757629555384,"version":"3.44.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1016\/0743-7315(87)90039-6","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"309-318","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding test-and-treatment procedures using parallel computation"],"prefix":"10.1016","volume":"4","author":[{"given":"Louis D.","family":"Duval","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert A.","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yijie","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald W.","family":"Loveland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0743-7315(87)90039-6_BIB1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/0123019","article-title":"Optimal binary identification procedures","volume":"23","author":"Garey","year":"1972","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0743-7315(87)90039-6_BIB2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF00263588","article-title":"Performance bounds on the splitting algorithm for binary testing","volume":"3","author":"Garey","year":"1974","journal-title":"Acta Inform."},{"article-title":"Algorithms on an n-PE Bit-Serial CCC Network","year":"1984","author":"Han","key":"10.1016\/0743-7315(87)90039-6_BIB3"},{"key":"10.1016\/0743-7315(87)90039-6_BIB4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","article-title":"Constructing optimal binary decision trees is NP-complete","volume":"5","author":"Hyafil","year":"1976","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"10.1016\/0743-7315(87)90039-6_BIB5","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1109\/TC.1984.1676456","article-title":"A parallel algorithm for the knapsack problem","volume":"C-33","author":"Karnin","year":"1984","journal-title":"IEEE Trans. Comput."},{"year":"1978","series-title":"The C Programming Language","author":"Kernighan","key":"10.1016\/0743-7315(87)90039-6_BIB6"},{"key":"10.1016\/0743-7315(87)90039-6_BIB7","series-title":"Proc. First Int. Symp. Policy Anal. Inf. Sci.","first-page":"228","article-title":"Selecting optimal test procedures from incomplete test sets","author":"Loveland","year":"1979"},{"key":"10.1016\/0743-7315(87)90039-6_BIB8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00290148","article-title":"Performance bounds for binary testing with arbitrary weights","volume":"22","author":"Loveland","year":"1985","journal-title":"Acta Inform."},{"key":"10.1016\/0743-7315(87)90039-6_BIB9","first-page":"305","article-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"issue":"3","key":"10.1016\/0743-7315(87)90039-6_BIB10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.2307\/2982129","article-title":"Identification keys and diagnostic tables: A review","volume":"143","author":"Payne","year":"1980","journal-title":"J. Roy. Statist. Soc. Ser. A"},{"issue":"5","key":"10.1016\/0743-7315(87)90039-6_BIB11","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"issue":"6","key":"10.1016\/0743-7315(87)90039-6_BIB12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/MC.1985.1662926","article-title":"Multiprocessing of combinatorial search problems","volume":"18","author":"Wah","year":"1985","journal-title":"Computer"},{"article-title":"A programmer's view of the Boolean Vector Machine","year":"1981","author":"Wagner","key":"10.1016\/0743-7315(87)90039-6_BIB13"},{"key":"10.1016\/0743-7315(87)90039-6_BIB14","doi-asserted-by":"crossref","unstructured":"Wagner, R. A. The Boolean Vector Machine [BVM]. IEEE 1983 Conf. Proc. of 10th Ann. International Symposium on Computer Architecture, pp. 59\u201366.","DOI":"10.1145\/800046.801639"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731587900396?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731587900396?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:41Z","timestamp":1757514581000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731587900396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["0743731587900396"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(87)90039-6","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1987,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Finding test-and-treatment procedures using parallel computation","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(87)90039-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1987 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}