{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:29:13Z","timestamp":1725456553683},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540513711"},{"type":"electronic","value":"9783540462019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035773","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:00:28Z","timestamp":1133427628000},"page":"405-422","source":"Crossref","is-referenced-by-count":1,"title":["A pointer-free data structure for merging heaps and min-max heaps"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"26_CR1","first-page":"2","volume":"19","author":"H. Alt","year":"1984","unstructured":"H. Alt, K. Mehlhorn, J.I. Munro, \"Partial match retrieval in implicit data structures\", Inf. Proc. Let., 19, 2, (1984).","journal-title":"Inf. Proc. Let."},{"key":"26_CR2","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, Ma., (1974)."},{"key":"26_CR3","first-page":"10","volume":"29","author":"M.D. Atkinson","year":"1986","unstructured":"M.D. Atkinson, J.R. Sack, N. Santoro, T. Strothotte \"Min-Max heaps and generalized priority queues\" Comm. A.C.M., 29, 10, (1986).","journal-title":"Comm. A.C.M."},{"key":"26_CR4","first-page":"2","volume":"12","author":"A. Borodin","year":"1981","unstructured":"A. Borodin, L.J. Guibas, N.A. Lynch, A.C. Yao, \"Efficient searching using partial ordering\", Inf. Proc. Let., 12, 2, (1981).","journal-title":"Inf. Proc. Let."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"A.Borodin, F.E.Fich, F.Meyer auf der Heide, E.Upfal, A.Widgerson, \"A tradeoff between search and update time for the implicit dictionary problem\", 13th ICALP, Rennes, France, (1986).","DOI":"10.1007\/3-540-16761-7_54"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"J.L.Bentley, J.B.Saxe \"Decomposable searching problems I. Static to dynamic transformation\" J. of Algorithms, 1, (1980).","DOI":"10.1016\/0196-6774(80)90015-2"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1137\/0205051","volume":"5","author":"D. Cheriton","year":"1976","unstructured":"D. Cheriton, R.E. Tarjan \"Finding minimum spanning trees\" SIAM J. Comput., 5, 4, (1976).","journal-title":"SIAM J. Comput."},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322358.322364","volume":"30","author":"G.N. Frederickson","year":"1983","unstructured":"G.N. Frederickson \"Implicit data structures for the dictionary problem\" J. Ass. Comp. Mach., 30, 1, (1983).","journal-title":"J. Ass. Comp. Mach."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(84)90013-6","volume":"29","author":"G.N. Frederickson","year":"1984","unstructured":"G.N. Frederickson \"Recursively rotated orders and implicit data structures: a lower bound\" Theoret. Comp. Sci., 29, 1, (1984).","journal-title":"Theoret. Comp. Sci."},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"M.L. Fredman, R.E. Tarjan \"Fibonacci heaps and their uses in improved network optimization algorithms\", J. Ass. Comp. Mach., 34, 3, (1987).","journal-title":"J. Ass. Comp. Mach."},{"key":"26_CR11","volume-title":"The art of computer programming, volume 3: sorting and searching","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth, The art of computer programming, volume 3: sorting and searching, Addison-Wesley, Reading, Ma., (1973)."},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(80)90037-9","volume":"21","author":"J.I. Munro","year":"1980","unstructured":"J.I. Munro, H. Suwanda \"Implicit data structures for fast search and update\" J. Comp. Syst. Sci., 21, 2, (1980).","journal-title":"J. Comp. Syst. Sci."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-0000(86)90040-1","volume":"33","author":"J.I. Munro","year":"1986","unstructured":"J.I. Munro \"An implicit data structure supporting insertion, deletion and search in O(lg2n) time\" J. Comp. Syst. Sci., 33, 1, (1986).","journal-title":"J. Comp. Syst. Sci."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"J.R.Sack, T.Strothotte \"An algorithm for merging heaps\" Acta Informatica 22, (1985).","DOI":"10.1007\/BF00264229"},{"key":"26_CR15","volume-title":"Data Structures and Network Algorithms, CBMS Regional Conference Series in Applied Mathematics 44","author":"R.E. Tarjan","year":"1983","unstructured":"R.E. Tarjan, Data Structures and Network Algorithms, CBMS Regional Conference Series in Applied Mathematics 44, SIAM, Philadelphia, (1983)."},{"key":"26_CR16","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1137\/0606031","volume":"6","author":"R.E. Tarjan","year":"1985","unstructured":"R.E. Tarjan \"Amortized Computational Complexity\" SIAM J. Alg. Disc. Meth., 6, 2, (1985).","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"26_CR17","unstructured":"J.W.J.Williams \"Algorithm 232: Heapsort\" Comm. Ass. Comp. Mach., 7, (1964)."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:31:59Z","timestamp":1586593919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0035773","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}