{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T10:25:29Z","timestamp":1749205529771},"reference-count":30,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/s0167-8191(05)80001-8","type":"journal-article","created":{"date-parts":[[2005,7,14]],"date-time":"2005-07-14T10:59:21Z","timestamp":1121338761000},"page":"1323-1342","source":"Crossref","is-referenced-by-count":9,"title":["Automatic test pattern generation on parallel processors"],"prefix":"10.1016","volume":"17","author":[{"given":"Sunil","family":"Arvindam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vipin","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Nageshwara Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vineet","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(05)80001-8_bib1","series-title":"Test Generation for VLSI Chips","author":"Agrawal","year":"1988"},{"key":"10.1016\/S0167-8191(05)80001-8_bib2","series-title":"Proc. 1989 Internat. Conf. on Computer Design (ICCD-89)","article-title":"Floorplan optimization on multiprocessors","author":"Arvindam","year":"1989"},{"key":"10.1016\/S0167-8191(05)80001-8_bib3","series-title":"Proc. Internat. Conf. on Knowledge-Based Systems","article-title":"Automatic test pattern generation on multiprocessors","author":"Arvindam","year":"1989"},{"key":"10.1016\/S0167-8191(05)80001-8_bib4","series-title":"Proc. Internat. Workshop on Parallel Algorithms and Architectures","article-title":"Parallel processing of combinatorial search trees","author":"Vornberger","year":"1987"},{"key":"10.1016\/S0167-8191(05)80001-8_bib5","series-title":"Design of Testable Logic Circuits","author":"Bennetts","year":"1984"},{"key":"10.1016\/S0167-8191(05)80001-8_bib6","series-title":"Proc. Internat. Test Conf.","first-page":"705","article-title":"Applications of testability analysis: From atpg to critical delay path","author":"Brglez","year":"1983"},{"key":"10.1016\/S0167-8191(05)80001-8_bib7","series-title":"Proc. IEEE Internat. Conf. on Computer Design","article-title":"Test generation in a parallel processing environment","author":"Chandra","year":"1988"},{"key":"10.1016\/S0167-8191(05)80001-8_bib8","first-page":"217","article-title":"Derivation of a termination detection algorithm for a distributed computation","volume":"16(5)","author":"Dijkstra","year":"1983"},{"issue":"2","key":"10.1016\/S0167-8191(05)80001-8_bib9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/22719.24067","article-title":"DIB \u2014 a distributed implementation of backtracking","volume":"9","author":"Finkel","year":"1987","journal-title":"ACM Trans. Progr. Lang. Systems"},{"key":"10.1016\/S0167-8191(05)80001-8_bib10","series-title":"17th ACM\/IEEE Design Automation Conf.","article-title":"Test generation cost analysis and projections","author":"Goel","year":"1980"},{"issue":"3","key":"10.1016\/S0167-8191(05)80001-8_bib11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/TC.1981.1675757","article-title":"An implicit enumeration algorithm to generate tests for combinatorial logic circuits","volume":"C-30","author":"Goel","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0167-8191(05)80001-8_bib12","doi-asserted-by":"crossref","DOI":"10.1109\/T-C.1975.224205","article-title":"Polynomially complete fault detection problems","volume":"C-24","author":"Ibarra","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(05)80001-8_bib13","series-title":"IJCAI","first-page":"416","article-title":"A parallel searching scheme for multiprocessor systems and its application to combinatorial problems","author":"Imai","year":"1979"},{"key":"10.1016\/S0167-8191(05)80001-8_bib14","series-title":"Proc. Internat. Conf. on Parallel Processing","first-page":"278","article-title":"Randomized parallel algorithms for prolog programs and backtracking applications","author":"Janakiram","year":"1987"},{"issue":"12","key":"10.1016\/S0167-8191(05)80001-8_bib15","doi-asserted-by":"crossref","DOI":"10.1109\/12.9745","article-title":"A randomized parallel backtracking algorithm","volume":"C-37","author":"Janakiram","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(05)80001-8_bib16","series-title":"Parallel Algorithms for Machine Intelligence and Vision","article-title":"Scalable parallel formulations of depth-first search","author":"Kumar","year":"1990"},{"issue":"6","key":"10.1016\/S0167-8191(05)80001-8_bib17","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF01389001","article-title":"Parallel depth-first search, part II: Analysis","volume":"16","author":"Kumar","year":"1987","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/S0167-8191(05)80001-8_bib18","series-title":"Proc. 1889 Conf. on Hypercubes, Concurrent Computers and Applications","first-page":"603","article-title":"Load balancing on the hypercube architecture","author":"Kumar","year":"1989"},{"key":"10.1016\/S0167-8191(05)80001-8_bib19","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","article-title":"Anomalies in parallel branch and bound algorithms","author":"Lai","year":"1984","journal-title":"Commun. ACM"},{"key":"10.1016\/S0167-8191(05)80001-8_bib20","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1986.5009434","article-title":"Coping with anomalies in parallel branch-and-bound algorithms","volume":"C-35","author":"Li","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/S0167-8191(05)80001-8_bib21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/43.21836","article-title":"Logic verification algorithms and their parallel implementation","volume":"8","author":"Ma","year":"1980","journal-title":"IEEE Trans. Comput. Aided Design"},{"key":"10.1016\/S0167-8191(05)80001-8_bib22","series-title":"Proc. Internat. Conf. on Computer-Aided Design","article-title":"A parallel scheme for test pattern generation","author":"Motohara","year":"1986"},{"issue":"6","key":"10.1016\/S0167-8191(05)80001-8_bib23","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/BF01389000","article-title":"Parallel depth-first search, part I: Implementation","volume":"16","author":"Nageshwara Rao","year":"1987","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/S0167-8191(05)80001-8_bib24","series-title":"Proc. 1988 Foundation of Software Technology and Theoretical Computer Science","article-title":"Superlinear speedup in state-space search","volume":"338","author":"Nageshwara Rao","year":"1988"},{"key":"10.1016\/S0167-8191(05)80001-8_bib25","series-title":"Proc. 1991 Conf. on Distributed Memory and Concurrent Computers","article-title":"On the efficiency of parallel ordered depth-first search","author":"Nageshwara Rao","year":"1991"},{"key":"10.1016\/S0167-8191(05)80001-8_bib26","series-title":"23rd ACM\/IEEE Design Automation Conf.","article-title":"Effectiveness of heuristic measures for automatic test pattern generation","author":"Patel","year":"1986"},{"key":"10.1016\/S0167-8191(05)80001-8_bib27","series-title":"26th ACM\/IEEE Design Automation Conf.","article-title":"A parallel branch-and-bound algorithm for test generation","author":"Patil","year":"1989"},{"issue":"3","key":"10.1016\/S0167-8191(05)80001-8_bib28","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/43.46806","article-title":"A parallel branch-and-bound algorithm for test generation","volume":"9","author":"Patil","year":"1990","journal-title":"IEEE Trans. Comput. Aided Design"},{"key":"10.1016\/S0167-8191(05)80001-8_bib29","article-title":"On the efficiency of parallel depth-first search, Technical report, Techn.","author":"Nageshwara Rao","year":"1990"},{"key":"10.1016\/S0167-8191(05)80001-8_bib30","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1984.1676453","article-title":"Manip \u2014 a multicomputer architecture for solving combinatorial extremum-search problems","volume":"C-33","author":"Wah","year":"1984","journal-title":"IEEE Trans. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819105800018?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819105800018?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,6]],"date-time":"2019-03-06T11:29:06Z","timestamp":1551871746000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819105800018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":30,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["S0167819105800018"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(05)80001-8","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}