{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:41:57Z","timestamp":1648539717228},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1995,4]]},"DOI":"10.1016\/0020-0190(94)00226-o","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:50:09Z","timestamp":1027605009000},"page":"23-33","source":"Crossref","is-referenced-by-count":0,"title":["Multiprocessor simulation strategies with optimal speed-up"],"prefix":"10.1016","volume":"54","author":[{"given":"Paul E.","family":"Dunne","sequence":"first","affiliation":[]},{"given":"Chris J.","family":"Gittings","sequence":"additional","affiliation":[]},{"given":"Paul H.","family":"Leng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(94)00226-O_BIB1","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1137\/0221002","article-title":"On the average size of intersection of binary trees","volume":"21","author":"Baeza-Yates","year":"1992","journal-title":"SIAM J. Comput."},{"issue":"7","key":"10.1016\/0020-0190(94)00226-O_BIB2","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/0010-4485(91)90049-3","article-title":"Lazy simulation of digital logic","volume":"23","author":"Charlton","year":"1991","journal-title":"Comput. Aided Design"},{"key":"10.1016\/0020-0190(94)00226-O_BIB3","article-title":"Allocation of multiple processors to lazy Boolean function trees \u2014 Justification of the magic number 2\/3","author":"Dix","year":"1992"},{"key":"10.1016\/0020-0190(94)00226-O_BIB4","series-title":"The Complexity of Boolean Networks","author":"Dunne","year":"1988"},{"issue":"4","key":"10.1016\/0020-0190(94)00226-O_BIB5","first-page":"269","article-title":"An algorithm for optimising signal selection in demand-driven circuit simulation","volume":"8","author":"Dunne","year":"1991","journal-title":"Trans. Soc. Comput. Simulation"},{"key":"10.1016\/0020-0190(94)00226-O_BIB6","series-title":"Proc. 28th Annual Allerton Conf. on Communication, Control, and Computing","first-page":"938","article-title":"Parallel demand-driven evaluation of logic networks","author":"Dunne","year":"1990"},{"key":"10.1016\/0020-0190(94)00226-O_BIB7","series-title":"An analysis of speed-up ratios in demand-driven multiprocessor simulation algorithms","author":"Dunne","year":"1994"},{"key":"10.1016\/0020-0190(94)00226-O_BIB8","series-title":"IEEE. Trans. Comput.","article-title":"On the complexity of Boolean functions computed by lazy oracles","author":"Dunne","year":"1993"},{"key":"10.1016\/0020-0190(94)00226-O_BIB9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","article-title":"The average height of binary trees and other simple trees","volume":"25","author":"Flajolet","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)00226-O_BIB10","article-title":"Parallel demand-driven simulation of logic networks","author":"Gittings","year":"1992"},{"key":"10.1016\/0020-0190(94)00226-O_BIB11","article-title":"The generation of systems for microarchitectural simulation","author":"Jackson","year":"1986"},{"key":"10.1016\/0020-0190(94)00226-O_BIB12","series-title":"Proc. 16th IASTED Internat. Symp. on Identification, Modelling and Simulation","first-page":"86","article-title":"Modelling and simulation of digital logic: an alternative approach","author":"Jackson","year":"1987"},{"key":"10.1016\/0020-0190(94)00226-O_BIB13","series-title":"The Art of Computer Programming: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(94)00226-O_BIB14","first-page":"151","article-title":"The heigh of binary search trees","volume":"11","author":"Robson","year":"1979","journal-title":"Austral. Comput. J."},{"key":"10.1016\/0020-0190(94)00226-O_BIB15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0020-0190(88)90132-9","article-title":"Time-optimal short-circuit evaluation of Boolean expressions","volume":"29","author":"Sassa","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00226-O_BIB16","series-title":"Proc. 24th ACM \/ IEEE Design Automation Conf.","first-page":"181","article-title":"Demand driven simulation: BACKSIM","author":"Smith","year":"1987"},{"key":"10.1016\/0020-0190(94)00226-O_BIB17","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/C-M.1975.218898","article-title":"Digital logic simulation in a time-based, table-driven environment, Part 1: Design verification","author":"Szygenda","year":"1975","journal-title":"Computer"},{"issue":"2","key":"10.1016\/0020-0190(94)00226-O_BIB18","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/362848.362870","article-title":"Exclusive simulation of activity in digital networks","volume":"12","author":"Ulrich","year":"1969","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400226O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400226O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T01:55:47Z","timestamp":1556502947000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400226O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["002001909400226O"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00226-o","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}