{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T20:50:57Z","timestamp":1680468657781},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,4,1]],"date-time":"1985-04-01T00:00:00Z","timestamp":481161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,4]]},"DOI":"10.1007\/bf00290143","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T01:53:34Z","timestamp":1096941214000},"page":"15-33","source":"Crossref","is-referenced-by-count":10,"title":["Analysis of tree algorithms for the simulation event list"],"prefix":"10.1007","volume":"22","author":[{"given":"Jeffrey H.","family":"Kingston","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1145\/358800.358805","volume":"24","author":"J.H. Blackstone","year":"1981","unstructured":"Blackstone, J.H., Hogg, G.L, Phillips, D.T.: A Two-List Synchronization Procedure for Discrete Event Simulation. Commun. ACM 24, 825?829 (1981)","journal-title":"Commun. ACM"},{"key":"CR2","unstructured":"Cox, D.R.: Renewal Theory. Methuen 1962"},{"key":"CR3","first-page":"41","volume":"18","author":"D. Davey","year":"1980","unstructured":"Davey, D., Vaucher, J.G.: Self-optimizing partitioned sequencing sets for discrete event simulation. INFOR 18, 41?61 (1980)","journal-title":"INFOR"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1287\/mnsc.24.13.1417","volume":"24","author":"R. Engelbrecht-Wiggans","year":"1978","unstructured":"Engelbrecht-Wiggans, R., Maxwell, W.L.: Analysis of the time indexed list procedure for synchronization of discrete event simulations. Manage. Sci. 24, 1417?1427 (1978)","journal-title":"Manage. Sci."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/359763.359801","volume":"20","author":"W.R. Franta","year":"1977","unstructured":"Franta, W.R., Maly, K.: An efficient data structure for the simulation event set. Commun. ACM 20, 596?602 (1977)","journal-title":"Commun. ACM"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/360248.360261","volume":"19","author":"G.H. Gonnet","year":"1976","unstructured":"Gonnet, G.H.: Heaps applied to event driven mechanisms. Commun. ACM 19, 417?418 (1976)","journal-title":"Commun. ACM"},{"key":"CR7","unstructured":"Henriksen, J.O.: An improved events list algorithm. Proc. Winter Simulation Conf., pp. 547?557, 1977"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01931680","volume":"15","author":"A. Jonassen","year":"1975","unstructured":"Jonassen, A., Dahl, O.-J.: Analysis of an algorithm for priority queue administration. BIT 15, 409?422 (1975)","journal-title":"BIT"},{"key":"CR9","volume-title":"The Art of Computer Programming, Vol. 11: Fundamental Algorithms","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol. 11: Fundamental Algorithms. Reading, MA: Addison-Wesley 1973"},{"key":"CR10","volume-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol. 3: Sorting and Searching. Reading, MA: Addison-Wesley 1973"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1145\/358800.358803","volume":"24","author":"W.M. McCormack","year":"1981","unstructured":"McCormack, W.M., Sargent, R.G.: Analysis of future event set algorithms for discrete event simulation. Commun. ACM 24, 801?812 (1981)","journal-title":"Commun. ACM"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1145\/359588.359611","volume":"21","author":"E.D. Ulrich","year":"1978","unstructured":"Ulrich, E.D.: Event manipulation for discrete simulations requiring large numbers of events. Commun. ACM 21, 777?785 (1978)","journal-title":"Commun. ACM"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/360715.360758","volume":"18","author":"J.G. Vaucher","year":"1975","unstructured":"Vaucher, J.G., Duval, P.A.: Comparison of simulation event list algorithms. Commun. ACM 18, 223?230 (1975)","journal-title":"Commun. ACM"},{"key":"CR14","first-page":"171","volume":"15","author":"J.G. Vaucher","year":"1977","unstructured":"Vaucher, J.G.: On the distribution of event times for the notices in a simulation event list. INFOR 15, 171?182 (1977)","journal-title":"INFOR"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290143.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00290143\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:15:19Z","timestamp":1554743719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00290143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,4]]}},"alternative-id":["BF00290143"],"URL":"https:\/\/doi.org\/10.1007\/bf00290143","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,4]]}}}