{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:03:09Z","timestamp":1743134589652,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250041"},{"type":"electronic","value":"9783030250058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25005-8_34","type":"book-chapter","created":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T23:02:23Z","timestamp":1563145343000},"page":"417-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Average Case of MergeInsertion"],"prefix":"10.1007","author":[{"given":"Florian","family":"Stober","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7645-5867","authenticated-orcid":false,"given":"Armin","family":"Wei\u00df","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"issue":"12","key":"34_CR1","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1002\/spe.4380251203","volume":"25","author":"HJ Boehm","year":"1995","unstructured":"Boehm, H.J., Atkinson, R., Plass, M.: Ropes: an alternative to strings. Softw. Pract. Exper. 25(12), 1315\u20131330 (1995)","journal-title":"Softw. Pract. Exper."},{"issue":"1","key":"34_CR2","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF01934989","volume":"25","author":"T Bui","year":"1985","unstructured":"Bui, T., Thanh, M.: Significant improvements to the Ford-Johnson algorithm for sorting. BIT Numer. Math. 25(1), 70\u201375 (1985)","journal-title":"BIT Numer. Math."},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-06686-8_11","volume-title":"Computer Science - Theory and Applications","author":"Stefan Edelkamp","year":"2014","unstructured":"Edelkamp, S., Wei\u00df, A.: QuickXsort: efficient sorting with n log $${n}-1.399{n}+{o}({n})$$ comparisons on average. In: Hirsch, E.A., Kuznetsov, S.O., Pin, J.\u00c9., Vereshchagin, N.K. (eds.) CSR 2014. LNCS, vol. 8476, pp. 139\u2013152. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06686-8_11"},{"key":"34_CR4","unstructured":"Edelkamp, S., Wei\u00df, A., Wild, S.: Quickxsort - A fast sorting scheme in theory and practice. CoRR abs\/1811.01259 (2018)"},{"issue":"5","key":"34_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/00029890.1959.11989306","volume":"66","author":"LR Ford","year":"1959","unstructured":"Ford, L.R., Johnson, S.M.: A tournament problem. Am. Math. Monthly 66(5), 387\u2013389 (1959)","journal-title":"Am. Math. Monthly"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-319-62127-2_41","volume-title":"Algorithms and Data Structures","author":"K Iwama","year":"2017","unstructured":"Iwama, K., Teruyama, J.: Improved average complexity for comparison-based sorting. Algorithms and Data Structures. LNCS, vol. 10389, pp. 485\u2013496. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_41"},{"key":"34_CR7","unstructured":"Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, 2nd Edn, vol. 3. Addison Wesley Longman, Redwood City (1998)"},{"issue":"3","key":"34_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/322139.322145","volume":"26","author":"GK Manacher","year":"1979","unstructured":"Manacher, G.K.: The Ford-Johnson sorting algorithm is not optimal. J. ACM 26(3), 441\u2013456 (1979)","journal-title":"J. ACM"},{"issue":"2","key":"34_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00453-004-1100-7","volume":"40","author":"M Peczarski","year":"2004","unstructured":"Peczarski, M.: New results in minimum-comparison sorting. Algorithmica 40(2), 133\u2013145 (2004)","journal-title":"Algorithmica"},{"issue":"3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ipl.2006.09.001","volume":"101","author":"M Peczarski","year":"2007","unstructured":"Peczarski, M.: The Ford-Johnson algorithm still unbeaten for less than 47 elements. Inf. Process. Lett. 101(3), 126\u2013128 (2007)","journal-title":"Inf. Process. Lett."},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/3-540-56279-6_101","volume-title":"Algorithms and Computation","author":"Klaus Reinhardt","year":"1992","unstructured":"Reinhardt, K.: Sorting in-place with a worst case complexity of n log n-1.3n + O(logn) comparisons and epsilon n log n + O(1) transports. In: Proceedings of Algorithms and Computation, ISAAC 1992, pp. 489\u2013498 (1992)"},{"key":"34_CR12","unstructured":"Stober, F.: Source code and generated data (2018). https:\/\/github.com\/CodeCrafter47\/merge-insertion"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Stober, F., Wei\u00df, A.: On the Average Case of MergeInsertion. arXiv e-prints. abs\/1905.09656 (2019)","DOI":"10.1007\/978-3-030-25005-8_34"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25005-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:15:57Z","timestamp":1710350157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25005-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250041","9783030250058"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25005-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2019.di.unipi.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5-6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}