{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:37:42Z","timestamp":1649036262541},"reference-count":16,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"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":[[1986,4]]},"DOI":"10.1016\/0020-0190(86)90100-6","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"237-242","source":"Crossref","is-referenced-by-count":0,"title":["Experiments with trees for the storage and retrieval of future events"],"prefix":"10.1016","volume":"22","author":[{"given":"John B.","family":"Evans","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90100-6_BIB1_1","first-page":"1259","article-title":"An algorithm for the organisation of information","volume":"3","author":"Adel'son-Vel'skii","year":"1962","journal-title":"Soviet Math."},{"key":"10.1016\/0020-0190(86)90100-6_BIB1_2","first-page":"263","article-title":"An algorithm for the organisation of information","volume":"146","author":"Adel'son-Vel'skii","year":"1962","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0020-0190(86)90100-6_BIB2","series-title":"Proc. 12th Annual Simulation Symp.","first-page":"115","article-title":"A taxonomy and analysis of event set management algorithms for discrete event simulation","author":"Comfort","year":"1979"},{"issue":"8","key":"10.1016\/0020-0190(86)90100-6_BIB3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1145\/355609.362340","article-title":"A generalisation of AVL trees","volume":"16","author":"Foster","year":"1973","journal-title":"Comm. ACM"},{"issue":"7","key":"10.1016\/0020-0190(86)90100-6_BIB4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/360248.360261","article-title":"Heaps applied to event driven mechanisms","volume":"19","author":"Gonnet","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(86)90100-6_BIB5","series-title":"Proc. Winter Simulation Conf.","first-page":"547","article-title":"An improved events list algorithm","author":"Henriksen","year":"1977"},{"key":"10.1016\/0020-0190(86)90100-6_BIB6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01931680","article-title":"Analysis of an algorithm for priority queue administration","volume":"15","author":"Jonassen","year":"1975","journal-title":"Bit"},{"key":"10.1016\/0020-0190(86)90100-6_BIB7","first-page":"152","author":"Knuth","year":"1973"},{"issue":"4","key":"10.1016\/0020-0190(86)90100-6_BIB8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/356635.356640","article-title":"Structured programming with go to statements","volume":"6","author":"Knuth","year":"1974","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"10.1016\/0020-0190(86)90100-6_BIB9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/TSE.1977.231160","article-title":"Deletions that preserve randomness","volume":"SE-3","author":"Knuth","year":"1977","journal-title":"IEEE Trans. on Software Engrg."},{"issue":"12","key":"10.1016\/0020-0190(86)90100-6_BIB10","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1145\/358800.358803","article-title":"Analysis of future event algorithms for discrete event simulation","volume":"24","author":"McCormack","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(86)90100-6_BIB11","series-title":"Simulation Techniques for Discrete Event Systems","author":"Mitrani","year":"1982"},{"key":"10.1016\/0020-0190(86)90100-6_BIB12","article-title":"Sequencing set efficiency","author":"Myhrhaug","year":"1965"},{"issue":"3","key":"10.1016\/0020-0190(86)90100-6_BIB13","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1093\/comjnl\/22.3.220","article-title":"Priority queue administration by sublist index","volume":"22","author":"Nevalainen","year":"1979","journal-title":"Comput. J."},{"issue":"4","key":"10.1016\/0020-0190(86)90100-6_BIB14","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(86)90100-6_BIB15","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","article-title":"Algorithm 232","volume":"7","author":"Williams","year":"1964","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086901006?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086901006?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T12:30:57Z","timestamp":1622896257000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086901006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["0020019086901006"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90100-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}