{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:30Z","timestamp":1725559470325},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_52","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:38:24Z","timestamp":1279042704000},"page":"597-601","source":"Crossref","is-referenced-by-count":3,"title":["An Empirical Study for Inversions-Sensitive Sorting Algorithms"],"prefix":"10.1007","author":[{"given":"Amr","family":"Elmasry","sequence":"first","affiliation":[]},{"given":"Abdelrahman","family":"Hammad","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Brodal, G., Fagerberg, R., Moruz, G.: On the adaptiveness of quicksort. In: 7th (ALENEX) Workshop on Algorithm Engineering and Experiments (2005)","DOI":"10.7146\/brics.v11i27.21852"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S009753979732699X","volume":"30","author":"R. Cole","year":"2000","unstructured":"Cole, R.: On the dynamic finger conjecture for splay trees. Part II: The proof. SIAM J. Computing\u00a030, 44\u201385 (2000)","journal-title":"SIAM J. Computing"},{"key":"52_CR3","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/359024.359026","volume":"23","author":"R. Cook","year":"1980","unstructured":"Cook, R., Kim, J.: Best sorting algorithms for nearly sorted lists. Commun. ACM\u00a023, 620\u2013624 (1980)","journal-title":"Commun. ACM"},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Elmasry, A.: Adaptive sorting with AVL trees. In: 3rd IFIP-WCC International Conference on Theoretical Computer Science, pp. 315\u2013324 (2004)","DOI":"10.1007\/1-4020-8141-3_25"},{"issue":"4","key":"52_CR5","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/146370.146381","volume":"24","author":"V. Estivill-Castro","year":"1992","unstructured":"Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Computing Surveys\u00a024(4), 441\u2013476 (1992)","journal-title":"ACM Computing Surveys"},{"key":"52_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/800105.803395","volume":"9","author":"L. Guibas","year":"1977","unstructured":"Guibas, L., McCreight, E., Plass, M., Roberts, J.: A new representation of linear lists. 9th ACM (STOC) Symposium on Theory of Computing\u00a09, 49\u201360 (1977)","journal-title":"9th ACM (STOC) Symposium on Theory of Computing"},{"issue":"7","key":"52_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C. Hoare","year":"1961","unstructured":"Hoare, C.: Algorithm 64: Quicksort. Commun. ACM\u00a04(7), 321 (1961)","journal-title":"Commun. ACM"},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(91)90181-G","volume":"39","author":"C. Levcopoulos","year":"1991","unstructured":"Levcopoulos, C., Petersson, O.: Splitsort - An adaptive sorting algorithm. Information Processing Letters\u00a039, 205\u2013211 (1991)","journal-title":"Information Processing Letters"},{"key":"52_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1006\/jagm.1993.1021","volume":"14","author":"C. Levcopoulos","year":"1993","unstructured":"Levcopoulos, C., Petersson, O.: Adaptive Heapsort. J. Alg.\u00a014, 395\u2013413 (1993)","journal-title":"J. Alg."},{"issue":"7","key":"52_CR10","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1002\/(SICI)1097-024X(199607)26:7<781::AID-SPE35>3.0.CO;2-B","volume":"126","author":"A. Moffat","year":"1996","unstructured":"Moffat, A., Eddy, G., Petersson, O.: Splaysort: fast, versatile, practical. Softw. Pract. and Exper.\u00a0126(7), 781\u2013797 (1996)","journal-title":"Softw. Pract. and Exper."},{"issue":"3","key":"52_CR11","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Self-adjusting binary search trees. J. ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"key":"52_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Commu. ACM\u00a023, 229\u2013239 (1980)","journal-title":"Commu. ACM"},{"issue":"4","key":"52_CR13","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/3341.3348","volume":"28","author":"R. Wainwrigh","year":"1985","unstructured":"Wainwrigh, R.: A class of sorting algorithms based on quicksort. Commun. ACM\u00a028(4), 396\u2013402 (1985)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:55:51Z","timestamp":1605624951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11427186_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}