{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:48:31Z","timestamp":1773816511640,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"This work was supported by the Natural Sciences and Engineering Research Council of Canada and the Canada Research Chairs Programme."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00453-019-00634-0","type":"journal-article","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T04:30:17Z","timestamp":1571805017000},"page":"509-588","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["QuickXsort: A Fast Sorting Scheme in Theory and Practice"],"prefix":"10.1007","volume":"82","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armin","family":"Wei\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6061-9177","authenticated-orcid":false,"given":"Sebastian","family":"Wild","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,22]]},"reference":[{"issue":"4","key":"634_CR1","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"issue":"12","key":"634_CR2","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1002\/spe.4380251203","volume":"25","author":"H-J Boehm","year":"1995","unstructured":"Boehm, H.-J., Atkinson, R.R., Plass, M.F.: Ropes: an alternative to strings. Softw. Pract. Exp. 25(12), 1315\u20131330 (1995). https:\/\/doi.org\/10.1002\/spe.4380251203","journal-title":"Softw. Pract. Exp."},{"issue":"1","key":"634_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(01)00288-2","volume":"285","author":"D Cantone","year":"2002","unstructured":"Cantone, D., Cincotti, G.: Quickheapsort, an efficient mix of classical sorting algorithms. Theor. Comput. Sci. 285(1), 25\u201342 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00288-2","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"634_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00224-015-9656-y","volume":"59","author":"V Diekert","year":"2016","unstructured":"Diekert, V., Wei\u00df, A.: QuickHeapsort: modifications and improved analysis. Theory Comput. Syst. 59(2), 209\u2013230 (2016). https:\/\/doi.org\/10.1007\/s00224-015-9656-y","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"634_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0019-9958(84)80053-4","volume":"61","author":"EE Doberkat","year":"1984","unstructured":"Doberkat, E.E.: An average case analysis of Floyd\u2019s algorithm to construct heaps. Inf. Control 61(2), 114\u2013131 (1984). https:\/\/doi.org\/10.1016\/S0019-9958(84)80053-4","journal-title":"Inf. Control"},{"issue":"3","key":"634_CR6","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/BF01990520","volume":"33","author":"RD Dutton","year":"1993","unstructured":"Dutton, R.D.: Weak-heap sort. BIT 33(3), 372\u2013381 (1993)","journal-title":"BIT"},{"key":"634_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/944618.944623","volume":"7","author":"Stefan Edelkamp","year":"2002","unstructured":"Edelkamp, S., Stiegeler, P.: Implementing HEAPSORT with $$n \\log n - 0.9n$$ and QUICKSORT with $$n \\log n + 0.2 n$$ comparisons. ACM J. Exp. Algorithm. 10(5) (2002). https:\/\/doi.org\/10.1145\/944618.944623","journal-title":"Journal of Experimental Algorithmics"},{"key":"634_CR8","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-46541-3_21","volume-title":"STACS 2000","author":"Stefan Edelkamp","year":"2000","unstructured":"Edelkamp, S., Wegener, I.: On the performance of Weak-Heapsort. In: Symposium on Theoretical Aspects of Computer Science (STACS) 2000, vol. 1770, pp. 254\u2013266. Springer (2000). https:\/\/doi.org\/10.1007\/3-540-46541-3_21"},{"key":"634_CR9","unstructured":"Edelkamp, S., Wei\u00df, A.: QuickXsort: efficient sorting with $$n \\log n - 1.399n + o(n)$$ comparisons on average (2013). arXiv:1307.3033"},{"key":"634_CR10","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: International Computer Science Symposium in Russia, pages 139\u2013152. Springer, Berlin (2014). https:\/\/doi.org\/10.1007\/978-3-319-06686-8_11"},{"key":"634_CR11","doi-asserted-by":"publisher","unstructured":"Edelkamp, S., Wei\u00df, A.: BlockQuicksort: avoiding branch mispredictions in Quicksort. In: P.\u00a0Sankowski and C.\u00a0D. Zaroliagis, editors, European Symposium on Algorithms (ESA) 2016, volume\u00a057 of LIPIcs, pp. 38:1\u201338:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2016.38","DOI":"10.4230\/LIPIcs.ESA.2016.38"},{"key":"634_CR12","unstructured":"Edelkamp, S., Wei\u00df, A.: QuickMergesort: practically efficient constant-factor optimal sorting, 2018. arXiv:1804.10062"},{"key":"634_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/1.9781611975499.1","volume-title":"2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Stefan Edelkamp","year":"2019","unstructured":"Edelkamp, S., Wei\u00df, A.: Worst-case efficient sorting with quickmergesort. In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7\u20138, pp. 1\u201314 (2019). https:\/\/doi.org\/10.1137\/1.9781611975499.1"},{"key":"634_CR14","unstructured":"Edelkamp, S., Wei\u00df, A., Wild, S.: Quickxsort\u2014a fast sorting scheme in theory and practice (2018). arXiv:1811.01259"},{"key":"634_CR15","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-30850-5_15","volume":"2012","author":"A Elmasry","year":"2012","unstructured":"Elmasry, A., Katajainen, J., Stenmark, M.: Branch mispredictions don\u2019t affect mergesort. Int. Sympos. Exp. Algorithms (SEA) 2012, 160\u2013171 (2012). https:\/\/doi.org\/10.1007\/978-3-642-30850-5_15","journal-title":"Int. Sympos. Exp. Algorithms (SEA)"},{"issue":"7","key":"634_CR16","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/BF01177551","volume":"31","author":"P Flajolet","year":"1994","unstructured":"Flajolet, P., Golin, M.: Mellin transforms and asymptotics. Acta Inform. 31(7), 673\u2013696 (1994). https:\/\/doi.org\/10.1007\/BF01177551","journal-title":"Acta Inform."},{"key":"634_CR17","unstructured":"Ford, L.R., Jr., Johnson, S.M.: A tournament problem. Am. Math. Mon. 66(5), 387\u2013389 (1959). URL: http:\/\/www.jstor.org\/stable\/2308750"},{"issue":"5","key":"634_CR18","doi-asserted-by":"publisher","first-page":"387","DOI":"10.2307\/2308750","volume":"66","author":"LR Ford","year":"1959","unstructured":"Ford, L.R., Johnson, S.M.: A tournament problem. Am. Mathe. Mon. 66(5), 387 (1959). https:\/\/doi.org\/10.2307\/2308750","journal-title":"Am. Mathe. Mon."},{"issue":"1\u20132","key":"634_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(98)00162-5","volume":"237","author":"V Geffert","year":"2000","unstructured":"Geffert, V., Katajainen, J., Pasanen, T.: Asymptotically efficient in-place merging. Theor. Comput. Sci. 237(1\u20132), 159\u2013181 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(98)00162-5","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"634_CR20","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0190(93)90088-q","volume":"48","author":"MJ Golin","year":"1993","unstructured":"Golin, M.J., Sedgewick, R.: Queue-mergesort. Inf. Process. Lett. 48(5), 253\u2013259 (1993). https:\/\/doi.org\/10.1016\/0020-0190(93)90088-q","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"634_CR21","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0215068","volume":"15","author":"GH Gonnet","year":"1986","unstructured":"Gonnet, G.H., Munro, J.I.: Heaps on heaps. SIAM J. Comput. 15(4), 964\u2013971 (1986). https:\/\/doi.org\/10.1137\/0215068","journal-title":"SIAM J. Comput."},{"key":"634_CR22","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: A Foundation For Computer Science. Addison-Wesley, Concrete Mathematics (1994)"},{"issue":"3","key":"634_CR23","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1051\/ita\/1989230303171","volume":"23","author":"P. Hennequin","year":"1989","unstructured":"Hennequin, P.: Combinatorial analysis of quicksort algorithm. RAIRO\u2014Theoretical Informatics and Applications\u2014Informatique Th\u00e9orique et Applications 23(3), 317\u2013333 (1989). http:\/\/eudml.org\/doc\/92337","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"issue":"7","key":"634_CR24","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366647","volume":"4","author":"CAR Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Algorithm 65: find. Commun. ACM 4(7), 321\u2013322 (1961). https:\/\/doi.org\/10.1145\/366622.366647","journal-title":"Commun. ACM"},{"issue":"4","key":"634_CR25","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/(SICI)1098-2418(199607)8:4<319::AID-RSA3>3.0.CO;2-0","volume":"8","author":"Hsien-Kuei Hwang","year":"1996","unstructured":"Hwang, H.-K.: Limit theorems for mergesort. Random Struct. Algorithms 8(4), 319\u2013336 (1996). https:\/\/doi.org\/10.1002\/(sici)1098-2418(199607)8:4<319::aid-rsa3>3.0.co;2-0","journal-title":"Random Structures and Algorithms"},{"issue":"11","key":"634_CR26","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s002360050147","volume":"35","author":"H-K Hwang","year":"1998","unstructured":"Hwang, H.-K.: Asymptotic expansions of the mergesort recurrences. Acta Inf. 35(11), 911\u2013919 (1998). https:\/\/doi.org\/10.1007\/s002360050147","journal-title":"Acta Inf."},{"key":"634_CR27","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-319-62127-2_41","volume-title":"Lecture Notes in Computer Science","author":"Kazuo Iwama","year":"2017","unstructured":"Iwama, K., Teruyama, J.: Improved average complexity for comparison-based sorting. In Ellen, F., Kolokolova, A., Sack, J. (eds.) Workshop on Algorithms and Data Structures (WADS), Proceedings, volume 10389 of Lecture Notes in Computer Science, pp. 485\u2013496. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_41"},{"key":"634_CR28","unstructured":"Katajainen, J.: The ultimate heapsort. In: Proceedings of the Computing: The 4th Australasian Theory Symposium, Australian Computer Science Communications, pp. 87\u201396. Springer-Verlag Singapore Pte. Ltd., (1998). URL: http:\/\/www.diku.dk\/~jyrki\/Myris\/Kat1998C.html"},{"key":"634_CR29","unstructured":"Katajainen, J., Pasanen, T., Teuhola, J.: Practical in-place mergesort. Nordic J. Comput. 3(1), 27\u201340 (1996). http:\/\/www.diku.dk\/~jyrki\/Myris\/KPT1996J.html"},{"key":"634_CR30","doi-asserted-by":"publisher","unstructured":"Kim, P.-S., Kutzner, A.: Ratio based stable in-place merging. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi\u2019an, China, April 25\u201329, 2008. Proceedings, volume 4978 of Lecture Notes in Computer Science, pp. 246\u2013257. Springer, (2008). https:\/\/doi.org\/10.1007\/978-3-540-79228-4 , https:\/\/doi.org\/10.1007\/978-3-540-79228-4_22","DOI":"10.1007\/978-3-540-79228-4_22"},{"key":"634_CR31","volume-title":"The Art Of Computer Programming: Searching and Sorting","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art Of Computer Programming: Searching and Sorting, 2nd edn. Addison Wesley, Boston (1998)","edition":"2"},{"key":"634_CR32","unstructured":"Knuth, D.E.: Selected Papers on Analysis of Algorithms, volume 102 of CSLI Lecture Notes. Center for the Study of Language and Information Publications (2000)"},{"key":"634_CR33","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032886","volume-title":"Sorting: A distribution theory","author":"HM Mahmoud","year":"2000","unstructured":"Mahmoud, H.M.: Sorting: A distribution theory. Wiley, New York (2000)"},{"issue":"4","key":"634_CR34","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0020-0190(84)90112-1","volume":"18","author":"H Mannila","year":"1984","unstructured":"Mannila, H., Ukkonen, E.: A simple linear-time algorithm for in situ merging. Inf. Process. Lett. 18(4), 203\u2013208 (1984). https:\/\/doi.org\/10.1016\/0020-0190(84)90112-1","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"634_CR35","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/S0097539700382108","volume":"31","author":"C Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez, C., Roura, S.: Optimal sampling strategies in Quicksort and Quickselect. SIAM J. Comput. 31(3), 683\u2013705 (2001). https:\/\/doi.org\/10.1137\/S0097539700382108","journal-title":"SIAM J. Comput."},{"key":"634_CR36","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-12788-9_6","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"CJH McDiarmid","year":"1998","unstructured":"McDiarmid, C.J.H.: Concentration. In: Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B. (eds.) Probabilistic Methods for Algorithmic Discrete Mathematics, pp. 195\u2013248. Springer, Berlin (1998)"},{"key":"634_CR37","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/0196-6774(89)90033-3","volume":"10","author":"CJH McDiarmid","year":"1989","unstructured":"McDiarmid, C.J.H., Reed, B.A.: Building heaps fast. J. Algorithms 10, 352\u2013365 (1989)","journal-title":"J. Algorithms"},{"key":"634_CR38","unstructured":"Mike McFadden. WikiSort. Github repository at https:\/\/github.com\/BonzaiThePenguin\/WikiSort . https:\/\/github.com\/BonzaiThePenguin\/WikiSort"},{"issue":"8","key":"634_CR39","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1002\/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-#","volume":"27","author":"DR Musser","year":"1997","unstructured":"Musser, D.R.: Introspective sorting and selection algorithms. Softw. Pract. Exp. 27(8), 983\u2013993 (1997)","journal-title":"Softw. Pract. Exp."},{"key":"634_CR40","unstructured":"NIST Digital Library of Mathematical Functions. Release 1.0.10; Release date 2015-08-07. URL: http:\/\/dlmf.nist.gov"},{"issue":"4","key":"634_CR41","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/BF01294131","volume":"14","author":"W Panny","year":"1995","unstructured":"Panny, W., Prodinger, H.: Bottom-up mergesort\u2014a detailed analysis. Algorithmica 14(4), 340\u2013354 (1995). https:\/\/doi.org\/10.1007\/BF01294131","journal-title":"Algorithmica"},{"key":"634_CR42","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(\\log n)$$ comparisons and $$\\epsilon n \\log n+O(1)$$ transports. In: International Symposium on Algorithms and Computation (ISAAC), pp. 489\u2013498 (1992). https:\/\/doi.org\/10.1007\/3-540-56279-6_101"},{"key":"634_CR43","unstructured":"Roura, S.: Divide-and-Conquer Algorithms and Data Structures. Tesi doctoral (Ph.\u00a0D. thesis, Universitat Polit\u00e8cnica de Catalunya (1997)"},{"issue":"2","key":"634_CR44","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/375827.375837","volume":"48","author":"S Roura","year":"2001","unstructured":"Roura, S.: Improved master theorems for divide-and-conquer recurrences. J. ACM 48(2), 170\u2013205 (2001). https:\/\/doi.org\/10.1145\/375827.375837","journal-title":"J. ACM"},{"issue":"4","key":"634_CR45","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF00289467","volume":"7","author":"R Sedgewick","year":"1977","unstructured":"Sedgewick, R.: The analysis of Quicksort programs. Acta Inf. 7(4), 327\u2013355 (1977). https:\/\/doi.org\/10.1007\/BF00289467","journal-title":"Acta Inf."},{"key":"634_CR46","volume-title":"An Introduction to the Analysis of Algorithms","author":"R Sedgewick","year":"2013","unstructured":"Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms, 2nd edn. Addison-Wesley-Longman, Boston (2013)","edition":"2"},{"key":"634_CR47","volume-title":"Algorithms","author":"R Sedgewick","year":"2011","unstructured":"Sedgewick, R., Wayne, K.: Algorithms, 4th edn. Addison-Wesley, Boston (2011)","edition":"4"},{"key":"634_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4939-1841-6","volume-title":"Basic Real Analysis","author":"HH Sohrab","year":"2014","unstructured":"Sohrab, H.H.: Basic Real Analysis, 2nd edn. Springer Birkh\u00e4user, Berlin (2014)","edition":"2"},{"key":"634_CR49","first-page":"417","volume-title":"Lecture Notes in Computer Science","author":"Florian Stober","year":"2019","unstructured":"Stober, F., Wei\u00df, A.: On the average case of MergeInsertion. In: International Workshop on Combinatorial Algorithms (IWOCA) 2019 (2019). arXiv:1905.09656"},{"issue":"1","key":"634_CR50","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). Theor. Comput. Sci. 118(1), 81\u201398 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"634_CR51","unstructured":"Wild, S.: Dual-pivot quicksort and beyond: analysis of multiway partitioning and its practical potential. Doktorarbeit (Ph.D. thesis), Technische Universit\u00e4t Kaiserslautern, 2016. ISBN 978-3-00-054669-3. http:\/\/nbn-resolving.de\/urn\/resolver.pl?urn:nbn:de:hbz:386-kluedo-44682"},{"key":"634_CR52","doi-asserted-by":"publisher","unstructured":"Wild, S.: Average cost of QuickXsort with pivot sampling. In Fill, J.A., Ward, M.D. (eds.) International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), LIPIcs (2018). https:\/\/doi.org\/10.4230\/LIPIcs.AofA.2018.36","DOI":"10.4230\/LIPIcs.AofA.2018.36"},{"key":"634_CR53","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1137\/1.9781611975062.2","volume-title":"2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)","author":"Sebastian Wild","year":"2018","unstructured":"Wild, S.: Quicksort is optimal for many equal keys. In: Workshop on Analytic Algorithmics and Combinatorics (ANALCO) 2018, pp. 8\u201322. SIAM, January (2018). arXiv:1608.04906 , https:\/\/doi.org\/10.1137\/1.9781611975062.2"},{"key":"634_CR54","doi-asserted-by":"publisher","unstructured":"Wild, S.: Supplementary mathematica notebook for variance computation (2018). https:\/\/doi.org\/10.5281\/zenodo.1463020","DOI":"10.5281\/zenodo.1463020"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00634-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00634-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00634-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T23:51:40Z","timestamp":1695340300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00634-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,22]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["634"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00634-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,22]]},"assertion":[{"value":"16 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}