{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T02:17:55Z","timestamp":1673317075034},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":[[1993,3]]},"DOI":"10.1007\/bf01179371","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T17:24:20Z","timestamp":1108661060000},"page":"215-231","source":"Crossref","is-referenced-by-count":12,"title":["The relaxed min-max heap"],"prefix":"10.1007","volume":"30","author":[{"given":"Yuzheng","family":"Ding","sequence":"first","affiliation":[]},{"given":"Mark Allen","family":"Weiss","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1145\/6617.6621","volume":"29","author":"M. Atkinson","year":"1986","unstructured":"[ASSS86] Atkinson, M., Sack, J., Santoro, N., Strothotte, T.: Min-max heaps, and generalized priority queues. Commun. ACM29, 996?1000 (1986)","journal-title":"Commun. ACM"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0207026","volume":"7","author":"M. Brown","year":"1978","unstructured":"[B78] Brown, M.: Implementation and analysis of binomial queue algorithms. SIAM J. Comput.7, 298?319 (1978)","journal-title":"SIAM J. Comput."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(87)90033-0","volume":"26","author":"S. Carlsson","year":"1987","unstructured":"[C87] Carlsson, S.: The deap ? a double-ended heap to implement double-ended priority queues. Inf. Process. Lett.26, 33?36 (1987)","journal-title":"Inf. Process. Lett."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1145\/50087.50096","volume":"31","author":"J. Driscoll","year":"1988","unstructured":"[DGST88] Driscoll, J., Gabow, H., Shrairman, R.: Relaxed Heaps: An alternative to fibonacci heaps with applications to parallel computation. Commun. ACM31, 1343?1354 (1988)","journal-title":"Commun. ACM"},{"key":"CR5","first-page":"701","volume":"7","author":"R. Floyd","year":"1964","unstructured":"[F64] Floyd, R.: Algorithm 245: Treesort. Commun. ACM7, 701 (1964)","journal-title":"Algorithm 245: Treesort. Commun. ACM"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"M. Fredman","year":"1986","unstructured":"[FSST86] Fredman, M., Sedgewick, R., Sleator, D., Tarjan, R.: The pairing heap: a new form of self-adjusting heap. Algorithmica1, 111?129 (1986)","journal-title":"Algorithmica"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. Fredman","year":"1987","unstructured":"[FT87] Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM34, 596?615 (1987)","journal-title":"J. ACM"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(91)90262-Z","volume":"84","author":"G. Gambosi","year":"1991","unstructured":"[GNT91] Gambosi, G., Nardelli, E., Talamo, M.: A pointer-free data structure for merging heaps and min-max heaps. Theor. Comput. Sci.84, 107?126 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01933726","volume":"27","author":"A. Hasham","year":"1987","unstructured":"[HS87] Hasham, A., Sack, J.: Bounds for min-max heaps. BIT27, 315?323 (1987)","journal-title":"BIT"},{"key":"CR10","volume-title":"The art of computer programming, vol. 3","author":"D. Knuth","year":"1973","unstructured":"[K73] Knuth, D.: The art of computer programming, vol. 3. Reading, MA: Addison-Wesley 1973"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1093\/comjnl\/34.5.423","volume":"34","author":"S. Olariu","year":"1991","unstructured":"[OOW91] Olariu, S., Overstreet, C., Wen, Z.: A mergeable double-ended priority queue. Comput. J.34, 423?427 (1991)","journal-title":"Comput. J."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00264229","volume":"22","author":"J. Sack","year":"1985","unstructured":"[SS85] Sack, J., Strothotte, T.: An algorithm for merging heaps. Acta Inf.22, 171?186 (1985)","journal-title":"Acta Inf."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/0215004","volume":"15","author":"D. Sleator","year":"1986","unstructured":"[ST86] Sleator, D., Tarjan, R.: Self-adjusting heaps. SIAM J. Comput.15, 52?69 (1986)","journal-title":"SIAM J. Comput."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1978","unstructured":"[V78] Vuillemin, J.: A data structure for manipulating priority queues. Commun. ACM21, 309?315 (1978)","journal-title":"Commun. ACM"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J. Williams","year":"1964","unstructured":"[W64] Williams, J.: Algorithm 232: Heapsort. Commun. ACM7, 347?348 (1964)","journal-title":"Commun. ACM"},{"key":"CR16","volume-title":"Data structures and algorithm analysis","author":"M.A. Weiss","year":"1992","unstructured":"[W92] Weiss, M.A.: Data structures and algorithm analysis. Redwood City, CA: Benjamin\/Cummings 1992"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01179371.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01179371\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01179371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T04:50:22Z","timestamp":1625460622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01179371"}},"subtitle":["A mergeable double-ended priority queue"],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01179371"],"URL":"https:\/\/doi.org\/10.1007\/bf01179371","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}