{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:05:31Z","timestamp":1725552331401},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_36","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T07:54:59Z","timestamp":1272354899000},"page":"424-435","source":"Crossref","is-referenced-by-count":6,"title":["Policy-Based Benchmarking of Weak Heaps and Their Relatives,"],"prefix":"10.1007","author":[{"given":"Asger","family":"Bruun","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Edelkamp","sequence":"additional","affiliation":[]},{"given":"Jyrki","family":"Katajainen","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Rasmussen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","volume-title":"Compilers: Principles, Techniques, & Tools","author":"A.V. Aho","year":"2007","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, & Tools, 2nd edn. Pearson Education, Inc., London (2007)","edition":"2"},{"key":"36_CR2","volume-title":"Modern C++ Design: Generic Programming and Design Patterns Applied","author":"A. Alexandrescu","year":"2001","unstructured":"Alexandrescu, A.: Modern C++ Design: Generic Programming and Design Patterns Applied. Addison-Wesley, Reading (2001)"},{"key":"36_CR3","unstructured":"Brodal, G.S.: Worst-case efficient priority queues. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 52\u201358. ACM\/SIAM (1996)"},{"issue":"3","key":"36_CR4","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0207026","volume":"7","author":"M.R. Brown","year":"1978","unstructured":"Brown, M.R.: Implementation and analysis of binomial queue algorithms. SIAM Journal on Computing\u00a07(3), 298\u2013319 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"36_CR5","unstructured":"Bruun, A.: Effektivitetsm\u00e5ling p\u00e5 krydsninger af svage og binomiale prioritetsk\u00f8er, CPH STL Report 2010-2, Department of Computer Science, University of Copenhagen (2010)"},{"key":"36_CR6","unstructured":"Chan, T.M.: Quake heaps: A simple alternative to Fibonacci heaps (2009) (unpublished manuscript)"},{"key":"36_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"36_CR8","unstructured":"Department of Computer Science, University of Copenhagen, The CPH STL (2000\u20132010), Website accessible at http:\/\/cphstl.dk\/"},{"issue":"11","key":"36_CR9","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1145\/50087.50096","volume":"31","author":"J.R. Driscoll","year":"1988","unstructured":"Driscoll, J.R., Gabow, H.N., Shrairman, R., Tarjan, R.E.: Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Communications of the ACM\u00a031(11), 1343\u20131354 (1988)","journal-title":"Communications of the ACM"},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/BF01990520","volume":"33","author":"R.D. Dutton","year":"1993","unstructured":"Dutton, R.D.: Weak-heap sort. BIT\u00a033(3), 372\u2013381 (1993)","journal-title":"BIT"},{"key":"36_CR11","unstructured":"Edelkamp, S.: Rank-relaxed weak queues: Faster than pairing and Fibonacci heaps? Technical Report 54, TZI, Universit\u00e4t Bremen (2009)"},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-46541-3_21","volume-title":"STACS 2000","author":"S. Edelkamp","year":"2000","unstructured":"Edelkamp, S., Wegener, I.: On the performance of Weak-Heapsort. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 254\u2013266. Springer, Heidelberg (2000)"},{"key":"36_CR13","unstructured":"Elmasry, A.: Violation heaps: A better substitute for Fibonacci heaps, E-print 0812.2851v1, arXiv.org (2008)"},{"key":"36_CR14","unstructured":"Elmasry, A., Jensen, C., Katajainen, J.: Relaxed weak queues: An alternative to run-relaxed heaps, CPH STL Report 2005-2, Department of Computer Science, University of Copenhagen (2005)"},{"issue":"1","key":"36_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"M.L. Fredman","year":"1986","unstructured":"Fredman, M.L., Sedgewick, R., Sleator, D.D., Tarjan, R.E.: The pairing heap: A new form of self-adjusting heap. Algorithmica\u00a01(1), 111\u2013129 (1986)","journal-title":"Algorithmica"},{"issue":"3","key":"36_CR16","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"Journal of the ACM"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-642-04128-0_59","volume-title":"Algorithms - ESA 2009","author":"B. Haeupler","year":"2009","unstructured":"Haeupler, B., Sen, S., Tarjan, R.E.: Rank-pairing heaps. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 659\u2013670. Springer, Heidelberg (2009)"},{"key":"36_CR18","unstructured":"Jensen, C.: Private communication (2009)"},{"key":"36_CR19","unstructured":"Katajainen, J.: Project proposal: A meldable, iterator-valid priority queue, CPH STL Report 2005-1, Department of Computer Science, University of Copenhagen (2005)"},{"key":"36_CR20","unstructured":"Katajainen, J.: Priority-queue frameworks: Programs, CPH STL Report 2009-7, Department of Computer Science, University of Copenhagen (2009)"},{"key":"36_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-44688-5_4","volume-title":"Algorithm Engineering","author":"J. Katajainen","year":"2001","unstructured":"Katajainen, J., Mortensen, B.B.: Experiences with the design and implementation of space-efficient deques. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol.\u00a02141, pp. 39\u201350. Springer, Heidelberg (2001)"},{"key":"36_CR22","series-title":"The Art of Computer Programming","volume-title":"Fundamental Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: Fundamental Algorithms, 3rd edn. The Art of Computer Programming, vol.\u00a01. Addison Wesley Longman, Amsterdam (1997)","edition":"3"},{"key":"36_CR23","series-title":"The Art of Computer Programming","volume-title":"Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Sorting and Searching, 2nd edn. The Art of Computer Programming, vol.\u00a03. Addison-Wesley Longman, Amsterdam (1998)","edition":"2"},{"key":"36_CR24","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"36_CR25","volume-title":"Algorithms and Data Structures: The Basic Toolbox","author":"K. Mehlhorn","year":"2008","unstructured":"Mehlhorn, K., Sanders, P.: Algorithms and Data Structures: The Basic Toolbox. Springer, Heidelberg (2008)"},{"key":"36_CR26","unstructured":"Paredes, R.: Graphs for metric space searching, Ph.D.\u00a0Thesis, Department of Computer Science, University of Chile (2008)"},{"key":"36_CR27","unstructured":"Rasmussen, J.: Implementing run-relaxed weak queues, CPH STL Report 2008-1, Department of Computer Science, University of Copenhagen (2008)"},{"issue":"3","key":"36_CR28","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1145\/214748.214759","volume":"30","author":"J.T. Stasko","year":"1987","unstructured":"Stasko, J.T., Vitter, J.S.: Pairing heaps: Experiments and analysis. Communications of the ACM\u00a030(3), 234\u2013249 (1987)","journal-title":"Communications of the ACM"},{"issue":"4","key":"36_CR29","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1978","unstructured":"Vuillemin, J.: A data structure for manipulating priority queues. Communications of the ACM\u00a021(4), 309\u2013315 (1978)","journal-title":"Communications of the ACM"},{"key":"36_CR30","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0304-3975(93)90364-Y","volume":"118","author":"I. Wegener","year":"1993","unstructured":"Wegener, I.: Bottom-up-Heapsort, a new variant of Heapsort beating, on an average, Quicksort (if n is not very small). Theoretical Computer Science\u00a0118, 81\u201398 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"36_CR31","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232: Heapsort. Communications of the ACM\u00a07(6), 347\u2013348 (1964)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T15:50:39Z","timestamp":1635263439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}