{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T19:56:30Z","timestamp":1676750190730},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1977,6,1]],"date-time":"1977-06-01T00:00:00Z","timestamp":233971200000},"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":[[1977,6]]},"DOI":"10.1016\/0020-0190(77)90032-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"83-86","source":"Crossref","is-referenced-by-count":4,"title":["An adaptive time advancement algorithm for discrete simulation"],"prefix":"10.1016","volume":"6","author":[{"given":"A.","family":"J\u00e1vor","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(77)90032-1_BIB1","series-title":"Proc. IFIP Working Conf. on Simulation Programming Languages","first-page":"175","article-title":"Two proposals towards discrete modelling","author":"Laski","year":"1968"},{"issue":"2","key":"10.1016\/0020-0190(77)90032-1_BIB2","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"},{"key":"10.1016\/0020-0190(77)90032-1_BIB3","article-title":"On the simulation of time in the case of quasi-synchronous discrete event distributions","author":"J\u00e1vor","year":"1974","journal-title":"Report of the Central Research Institute for Physics of the Hungarian Academy of Sciences"},{"key":"10.1016\/0020-0190(77)90032-1_BIB4","first-page":"257","article-title":"On the problems of timing and hazards in the simulation of digital networks","author":"J\u00e1vor","year":"1974","journal-title":"European Conf. Circuit Theory and Design"},{"issue":"4","key":"10.1016\/0020-0190(77)90032-1_BIB5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/360715.360758","article-title":"A comparison of simulation event list algorithms","volume":"18","author":"Vaucher","year":"1975","journal-title":"Comm. ACM"},{"issue":"6","key":"10.1016\/0020-0190(77)90032-1_BIB6","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/360825.360873","article-title":"Improved event-scanning mechanisms for discrete event simulation","volume":"18","author":"Wyman","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(77)90032-1_BIB7","series-title":"Simulation of Systems","first-page":"439","article-title":"An event scanning algorithm of nearly constant complexity","author":"Franta","year":"1976"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019077900321?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019077900321?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:26:09Z","timestamp":1555086369000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019077900321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,6]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977,6]]}},"alternative-id":["0020019077900321"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(77)90032-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1977,6]]}}}