{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T15:16:34Z","timestamp":1712762194982},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8052,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1016\/0304-3975(91)90262-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"107-126","source":"Crossref","is-referenced-by-count":9,"title":["A pointer-free data structure for merging heaps and min-max heaps"],"prefix":"10.1016","volume":"84","author":[{"given":"Giorgio","family":"Gambosi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Nardelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Talamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90262-Z_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0020-0190(84)90098-X","article-title":"Partial match retrieval in implicit data structures","volume":"19","author":"Alt","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(91)90262-Z_BIB2","series-title":"The design and analysis of computer algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(91)90262-Z_BIB3","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/6617.6621","article-title":"Min-Max heaps and generalized priority queues","volume":"29","author":"Atkinson","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(91)90262-Z_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0020-0190(81)90005-3","article-title":"Efficient searching using partial ordering","volume":"12","author":"Borodin","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(91)90262-Z_BIB5","article-title":"A tradeoff between search and update time for the implicit dictionary problem","author":"Borodin","year":"1986","journal-title":"13th ICALP"},{"key":"10.1016\/0304-3975(91)90262-Z_BIB6","doi-asserted-by":"crossref","DOI":"10.1016\/0196-6774(80)90015-2","article-title":"Decomposable searcing problems I. Static to dynamic transformation","volume":"1","author":"Bentley","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(91)90262-Z_BIB7","series-title":"Proc. SWAT 88, LNCS 318","article-title":"An implicit binomial queue with constant insertion time","author":"Carlsson","year":"1988"},{"key":"10.1016\/0304-3975(91)90262-Z_BIB8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"5","author":"Cheriton","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90262-Z_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322358.322364","article-title":"Implicit data structures for the dictionary problem","volume":"30","author":"Frederickson","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(91)90262-Z_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(84)90013-6","article-title":"Recursively rotated orders and implicit data structures: a lower bound","volume":"29","author":"Frederickson","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90262-Z_BIB11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(91)90262-Z_BIB12","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(91)90262-Z_BIB13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(80)90037-9","article-title":"Implicit data structures for fast search and updata","volume":"21","author":"Munro","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90262-Z_BIB14","first-page":"1","article-title":"An implicit data structure supporting insertion, deletion and search in O(lg2 n) time","volume":"33","author":"Munro","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90262-Z_BIB15","doi-asserted-by":"crossref","DOI":"10.1007\/BF00264229","article-title":"An algorithm for merging heaps","volume":"22","author":"Sack","year":"1985","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(91)90262-Z_BIB16","article-title":"Data Structures and Network Algorithms","volume":"44","author":"Tarjan","year":"1983","journal-title":"CBMS-NSF Regional Conf. Ser. in Appl. Math."},{"key":"10.1016\/0304-3975(91)90262-Z_BIB17","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1137\/0606031","article-title":"Amortized Computational Complexity","volume":"6","author":"Tarjan","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(91)90262-Z_BIB18","doi-asserted-by":"crossref","DOI":"10.1145\/359460.359478","article-title":"A data structure for manipulating priority queues","volume":"21","author":"Vuillemin","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(91)90262-Z_BIB19","article-title":"Algorithm 232: Heapsort","volume":"7","author":"Williams","year":"1964","journal-title":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190262Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190262Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:54:17Z","timestamp":1555113257000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190262Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["030439759190262Z"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90262-z","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}