{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:28:11Z","timestamp":1725485291844},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437864"},{"type":"electronic","value":"9783540480518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48051-x_25","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T12:49:55Z","timestamp":1179492595000},"page":"243-252","source":"Crossref","is-referenced-by-count":5,"title":["A Parallel Transitive Closure Computation Algorithm for VLSI Test Generation"],"prefix":"10.1007","author":[{"given":"Seema","family":"Bawa","sequence":"first","affiliation":[]},{"given":"G. K.","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,4]]},"reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/T-C.1975.224205","volume":"C-24","author":"O. H. Ibarra","year":"1975","unstructured":"O. H. Ibarra and S. K. Sahni, \u201cPolynomially Complete Fault Detection Problems,\u201d IEEE Trans. on Computers, Vol. C-24, No. 3, pp. 242\u2013249, March 1975.","journal-title":"IEEE Trans. on Computers"},{"key":"25_CR2","volume-title":"Test Generation for VLSI Chips","author":"V. D. Agrawal","year":"1988","unstructured":"V. D. Agrawal and S. C. Seth, Test Generation for VLSI Chips, IEEE Computer Society Press, Los Alamitos, CA, 1988."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"P. Goel\u201cAn Implicit Enumeration Algorithm to Generate Tests for Combinational Circuits,\u201d IEEE Trans. on Computers, Vol. C-30, No. 3, pp. 215\u2013222, March 1981.","DOI":"10.1109\/TC.1981.1675757"},{"key":"25_CR4","volume-title":"Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing","author":"E. H. L. Arts","year":"1989","unstructured":"E. H. L. Arts and J. H. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing, Wiley, New York, 1989."},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/2.108056","volume":"25","author":"R. H. Klenke","year":"1992","unstructured":"R. H. Klenke, R. D. Williams and J. H. Aylor \u201cParallel-Processing Techniques for Automatic Test Pattern Generation,\u201d IEEE Computer, Vol. 25, No. 1, pp. 71\u201384, Jan. 1992.","journal-title":"IEEE Computer"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"S. T. Chakradhar, V. D. Agrawal and M. L. Bushnell, \u201cAutomatic test generation using quadratic 0-1 programming,\u201d 27th ACM\/IEEE Design Automation Conference, 1990, 654\u2013659.","DOI":"10.1145\/123186.123430"},{"issue":"9","key":"25_CR7","doi-asserted-by":"publisher","first-page":"2235","DOI":"10.1109\/43.59074","volume":"9","author":"S. T. Chakradhar","year":"1990","unstructured":"S. T. Chakradhar, M. L. Bushnell, and V. D. Agrawal, \u201cTowards massively parallel automatic test generation,\u201d IEEE Transactions on Computer-Aided Design, Vol. 9, No. 9, Sept. 1990, 2235\u20132258.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"7","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1109\/43.238038","volume":"12","author":"S. T. Chakradhar","year":"1993","unstructured":"S. T. Chakradhar, V. D. Agrawal, and S. G. Rothweiler, \u201cA transitive closure algorithm for test generation,\u201d IEEE Transactions on Computer-Aided Design, Vol. 12, No. 7, July 1993, 1015\u20131028.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"4","key":"25_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(87)90136-0","volume":"24","author":"S.R. Pawagi","year":"1987","unstructured":"S.R. Pawagi, P.S. Gopalakrishnan, and I.V. Ramakrishnan, \u201cComputing Dominators in Parallel,\u201d Information Processing Letters, Vol. 24, No. 4, April 1987, 217\u2013221.","journal-title":"Information Processing Letters"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/43.108614","volume":"7","author":"T. Larrabee","year":"1992","unstructured":"T. Larrabee, \u201cTest pattern generation using Boolean Satisfiability,\u201d IEEE Transactions on Computer-Aided Design, Vol. 7, Jan. 1992, 4\u201315.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"25_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Company, San Francisco, 1979."},{"key":"25_CR12","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D. E. Goldberg","year":"1989","unstructured":"D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, Mass., 1989."},{"key":"25_CR13","first-page":"38","volume-title":"Proc. First Workshop Parallel Problem Solving from Nature","author":"K. A. DeJong","year":"1990","unstructured":"K. A. DeJong and W. M. Spears, \u201cAn Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms,\u201d Proc. First Workshop Parallel Problem Solving from Nature, Springer-Verlag, Berlin, 1990, pp. 38\u201347."},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M. Srinivas","year":"1994","unstructured":"M. Srinivas and L. M. Patnaik, \u201cAdaptive Probabilities of Crossover and Mutation in Genetic Algorithms,\u201d IEEE Trans. on Systems, Man and Cybernetics, Vol. 24, No. 4, July\/Aug. 1994, pp. 656\u2013666.","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"},{"issue":"2","key":"25_CR15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01580586","volume":"34","author":"P. Hansen","year":"1986","unstructured":"P. Hansen, B. Jaumard, and M. Minoux, \u201dA Linear Expected-Time Algorithm for Deriving All Logical Conclusions Implied by a Set of Boolean Inequalities\u201d Mathematical Programming, 34(2):223\u2013231, march 1986.","journal-title":"Mathematical Programming"},{"issue":"4","key":"25_CR16","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/71.80177","volume":"1","author":"B.F. Wang","year":"1990","unstructured":"B.F. Wang and G.H. Chen, \u201dConstant Time Angorithm for the Transitive Closure and Some Related Graph problems on Processor Arrays with Reconfigurable Bus System\u201d IEEE Transactions on Parallel and Distributed Systems, 1(4):500\u2013507, October 1990.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"S. Warshall \u201dA Theorem on Boolean Matrices\u201d, Journal of the ACM, 9(1):11\u201312, january 1962.","DOI":"10.1145\/321105.321107"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48051-X_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:45:23Z","timestamp":1556412323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48051-X_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437864","9783540480518"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48051-x_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}