{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:03Z","timestamp":1742617203603,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_70","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:52:51Z","timestamp":1330278771000},"page":"282-290","source":"Crossref","is-referenced-by-count":16,"title":["Fast meldable priority queues"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"10","key":"25_CR1","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1145\/6617.6621","volume":"29","author":"M. D. Atkinson","year":"1986","unstructured":"M. D. Atkinson, J.-R. Sack, N. Santoro, and T. Strothotte. Min-max heaps and generalized priority queues. Communications of the ACM, 29(10):996\u20131000, 1986.","journal-title":"Communications of the ACM"},{"key":"25_CR2","first-page":"1","volume-title":"volume 318 of Lecture Notes in Computer Science","author":"S. Carlsson","year":"1988","unstructured":"Svante Carlsson, Patricio V. Poblete, and J. Ian Munro. An implicit binomial queue with constant insertion time. In Proc. 1st Scandinavian Workshop on Algorithm Theory (SWAT), volume 318 of Lecture Notes in Computer Science, pages 1\u201313. Springer Verlag, Berlin, 1988."},{"key":"25_CR3","series-title":"volume 468 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/3-540-53504-7_66","volume-title":"Advances in Computing and Information \u2014 ICCI '90","author":"P. F. Dietz","year":"1990","unstructured":"Paul F. Dietz and Rajeev Raman. A constant update time finger search tree. In Advances in Computing and Information \u2014 ICCI '90, volume 468 of Lecture Notes in Computer Science, pages 100\u2013109. Springer Verlag, Berlin, 1990."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01179371","volume":"30","author":"Y. Ding","year":"1993","unstructured":"Yuzheng Ding and Mark Allen Weiss. The relaxed min-max heap. ACTA Informatica, 30:215\u2013231, 1993.","journal-title":"ACTA Informatica"},{"issue":"11","key":"25_CR5","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1145\/50087.50096","volume":"31","author":"J. R. Driscoll","year":"1988","unstructured":"James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan. Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation. Communications of the ACM, 31(11):1343\u20131354, 1988.","journal-title":"Communications of the ACM"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/174644.174645","volume":"41","author":"M. J. Fischer","year":"1994","unstructured":"Michael J. Fischer and Michael S. Paterson. Fishspear: A priority queue algorithm. Journal of the ACM, 41(1):3\u201330, 1994.","journal-title":"Journal of the ACM"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"M. L. Fredman","year":"1986","unstructured":"Michael L. Fredman, Robert Sedgewick, Daniel D. Sleator, and Robert E. Tarjan. The pairing heap: A new form of self-adjusting heap. Algorithmica, 1:111\u2013129, 1986.","journal-title":"Algorithmica"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Michael L. Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. In Proc. 25rd Ann. Symp. on Foundations of Computer Science (FOCS), pages 338\u2013346, 1984.","DOI":"10.1109\/SFCS.1984.715934"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Leo J. Guibas, Edward M. McCreight, Michael F. Plass, and Janet R. Roberts. A new representation for linear lists. In Proc. 9thAnn. ACM Symp. on Theory of Computing (STOC), pages 49\u201360, 1977.","DOI":"10.1145\/800105.803395"},{"key":"25_CR10","unstructured":"Peter H\u00f8yer. A general technique for implementation of efficient priority queues. Technical Report IMADA-94-33, Odense University, 1994."},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"Robert Endre Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, 6:306\u2013318, 1985.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"25_CR12","unstructured":"Jan van Leeuwen. The composition of fast priority queues. Technical Report RUU-CS-78-5, Department of Computer Science, University of Utrecht, 1978."},{"issue":"4","key":"25_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1978","unstructured":"Jean Vuillemin. A data structure for manipulating priority queues. Communications of the ACM, 21(4):309\u2013315, 1978.","journal-title":"Communications of the ACM"},{"issue":"6","key":"25_CR14","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J. W. J. Williams","year":"1964","unstructured":"J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7(6):347\u2013348, 1964.","journal-title":"Communications of the 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-60220-8_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:55:43Z","timestamp":1742597743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}