{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:50Z","timestamp":1725663770339},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_257","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:05:54Z","timestamp":1330239954000},"page":"302-313","source":"Crossref","is-referenced-by-count":2,"title":["The K-D heap: An efficient multi-dimensional priority queue"],"prefix":"10.1007","author":[{"given":"Yuzheng","family":"Ding","sequence":"first","affiliation":[]},{"given":"Mark Alien","family":"Weiss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1145\/6617.6621","volume":"29","author":"M. Atkinson","year":"1986","unstructured":"M. Atkinson, J. Sack, N. Santoro, T. Strothotte, \u201cMin-Max Heaps and Generalized Priority Queues,\u201d Comm. ACM, Vol. 29 (1986), 996\u20131000.","journal-title":"Comm. ACM"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J. Bentley","year":"1975","unstructured":"J. Bentley, \u201cMultidimensional Binary Search Trees Used for Associative Searching,\u201d Comm. ACM, Vol. 18 (1975), 509\u2013517.","journal-title":"Comm. ACM"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0207026","volume":"7","author":"M. Brown","year":"1978","unstructured":"M. Brown, \u201cImplementation and Analysis of Binomial Queue Algorithms,\u201d SIAM J. Comput., Vol. 7 (1978), 298\u2013319.","journal-title":"SIAM J. Comput."},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0020-0190(87)90033-0","volume":"26","author":"S. Carlsson","year":"1987","unstructured":"S. Carlsson, \u201cThe Deap\u2014 A Double-Ended Heap to Implement Double-Ended Priority Queues,\u201d Inform. Process. Lett., Vol. 26 (1987), 33\u201336.","journal-title":"Inform. Process. Lett."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"S. Carlsson, J. Munro, P. Poblete, \u201cAn Implicit Binomial Queue with Constant insertion time,\u201d Proc. SWAT (1988).","DOI":"10.1007\/3-540-19487-8_1"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1145\/50087.50096","volume":"31","author":"J. Driscoll","year":"1988","unstructured":"J. Driscoll, H. Gabow, R. Shrairman, R. Tarjan, \u201cRelaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation,\u201d Comm. ACM, Vol. 31 (1988), 1343\u20131354.","journal-title":"Comm. ACM"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Y. Ding, M. Weiss, \u201cThe Relaxed Min-Max Heap: A Mergeable Double-Ended Priority Queue,\u201d Acta Informatica, Vol.30 (1993), to appear.","DOI":"10.1007\/BF01179371"},{"key":"29_CR8","unstructured":"Y. Ding, M. Weiss, \u201cEfficient Implementations of Multi-dimensional Priority Queues,\u201d School of Computer Science Technical Report, Florida International University, Feb. 1993."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R. Floyd","year":"1964","unstructured":"R. Floyd, \u201cAlgorithm 245: Treesort,\u201d Comm. ACM, Vol. 7 (1964), 701.","journal-title":"Comm. ACM"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"M. Fredman","year":"1986","unstructured":"M. Fredman, R. Sedgewick, D. Sleator, R. Tarjan, \u201cThe Pairing Heap: A New Form of Self-Adjusting Heap,\u201d Algorithmica, Vol. 1 (1986), 111\u2013129.","journal-title":"Algorithmica"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. Fredman","year":"1987","unstructured":"M. Fredman, R. Tarjan, \u201cFibonacci Heaps and Their Uses in Improved Network Optimization Algorithms,\u201d J. ACM, Vol. 34 (1987), 596\u2013615.","journal-title":"J. ACM"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(91)90262-Z","volume":"84","author":"G. Gambosi","year":"1991","unstructured":"G. Gambosi, E. Nardelli, M. Talamo, \u201cA Pointer-free Data Structure for Merging Heaps and Min-Max Heaps,\u201d Theoretical Computer Science, Vol. 84 (1991), 107\u2013126.","journal-title":"Theoretical Computer Science"},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01933726","volume":"27","author":"A. Hasham","year":"1987","unstructured":"A. Hasham, J. Sack, \u201cBounds for Min-Max Heaps,\u201d BIT, Vol. 27 (1987), 315\u2013323.","journal-title":"BIT"},{"key":"29_CR14","volume-title":"The Art of Computer Programming, Vol. 3","author":"D. Knuth","year":"1973","unstructured":"D. Knuth, The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA, 1973."},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1093\/comjnl\/34.5.423","volume":"34","author":"S. Olariu","year":"1991","unstructured":"S. Olariu, C. Overstreet, Z. Wen, \u201cA Mergeable Double-ended Priority Queue,\u201d The Computer Journal, Vol. 34 (1991), 423\u2013427.","journal-title":"The Computer Journal"},{"key":"29_CR16","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00264229","volume":"22","author":"J. Sack","year":"1985","unstructured":"J. Sack, T. Strothotte, \u201cAn Algorithm for Merging Heaps,\u201d Acta Informatica, Vol. 22 (1985), 171\u2013186.","journal-title":"Acta Informatica"},{"key":"29_CR17","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/0215004","volume":"15","author":"D. Sleator","year":"1986","unstructured":"D. Sleator, R. Tarjan, \u201cSelf-Adjusting Heaps,\u201d SIAM J. Comput., Vol. 15 (1986), 52\u201369.","journal-title":"SIAM J. Comput."},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1978","unstructured":"J. Vuillemin, \u201c A Data Structure for Manipulating Priority Queues,\u201d Comm. ACM, Vol. 21 (1978), 309\u2013315.","journal-title":"Comm. ACM"},{"key":"29_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J. Williams","year":"1964","unstructured":"J. Williams, \u201cAlgorithm 232: Heapsort,\u201d Comm. ACM, Vol. 7 (1964), 347\u2013348.","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_257.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:12:40Z","timestamp":1640909560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_257","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}