{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:19:09Z","timestamp":1725535149943},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_17","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T10:49:21Z","timestamp":1247222961000},"page":"158-167","source":"Crossref","is-referenced-by-count":2,"title":["On Smoothed Analysis of\u00a0Quicksort\u00a0and\u00a0Hoare\u2019s\u00a0Find"],"prefix":"10.1007","author":[{"given":"Mahmoud","family":"Fouz","sequence":"first","affiliation":[]},{"given":"Manfred","family":"Kufleitner","sequence":"additional","affiliation":[]},{"given":"Bodo","family":"Manthey","sequence":"additional","affiliation":[]},{"given":"Nima Zeini","family":"Jahromi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-45138-9_14","volume-title":"Mathematical Foundations of Computer Science 2003","author":"C. Banderier","year":"2003","unstructured":"Banderier, C., Beier, R., Mehlhorn, K.: Smoothed Analysis of Three Combinatorial Problems. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 198\u2013207. Springer, Heidelberg (2003)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-87744-8_21","volume-title":"Algorithms - ESA 2008","author":"D. Cederman","year":"2008","unstructured":"Cederman, D., Tsigas, P.: A Practical Quicksort Algorithm for Graphics Processors. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol.\u00a05193, pp. 246\u2013258. Springer, Heidelberg (2008)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-39658-1_17","volume-title":"Algorithms - ESA 2003","author":"V. Damerow","year":"2003","unstructured":"Damerow, V.: Meyer auf der Heide, F., R\u00e4cke, H., Scheideler, C., Sohler, C.: Smoothed Motion Complexity. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 161\u2013171. Springer, Heidelberg (2003)"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1093\/comjnl\/27.3.276","volume":"27","author":"H. Erki\u00f6","year":"1984","unstructured":"Erki\u00f6, H.: The worst case permutation for median-of-three quicksort. The Computer Journal\u00a027(3), 276\u2013277 (1984)","journal-title":"The Computer Journal"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Fouz, M., Kufleitner, M., Manthey, B., Zeini Jahromi, N.: On smoothed analysis of quicksort and Hoare\u2019s find. Computing Research Repository, arXiv:0904.3898 [cs.DS] (2009)","DOI":"10.1007\/978-3-642-02882-3_17"},{"issue":"7","key":"17_CR6","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/366622.366644","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Algorithm 64: Quicksort. Comm. ACM\u00a04(7), 322 (1961)","journal-title":"Comm. ACM"},{"issue":"7","key":"17_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Algorithm 65: Find. Comm. ACM\u00a04(7), 321\u2013322 (1961)","journal-title":"Comm. ACM"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1017\/S0963548397003325","volume":"7","author":"P. Kirschenhofer","year":"1998","unstructured":"Kirschenhofer, P., Prodinger, H.: Comparisons in Hoare\u2019s find algorithm. Combin. Probab. Comput.\u00a07(1), 111\u2013120 (1998)","journal-title":"Combin. Probab. Comput."},{"issue":"1-2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<143::AID-RSA7>3.0.CO;2-V","volume":"10","author":"P. Kirschenhofer","year":"1997","unstructured":"Kirschenhofer, P., Prodinger, H., Martinez, C.: Analysis of Hoare\u2019s find algorithm with median-of-three partition. Random Structures Algorithms\u00a010(1-2), 143\u2013156 (1997)","journal-title":"Random Structures Algorithms"},{"key":"17_CR10","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, Reading (1998)","edition":"2"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.tcs.2007.02.035","volume":"378","author":"B. Manthey","year":"2007","unstructured":"Manthey, B., Reischuk, R.: Smoothed analysis of binary search trees. Theoret. Comput. Sci.\u00a0378(3), 292\u2013315 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-85238-4_38","volume-title":"Mathematical Foundations of Computer Science 2008","author":"B. Manthey","year":"2008","unstructured":"Manthey, B., Tantau, T.: Smoothed analysis of binary search trees and quicksort under additive noise. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 467\u2013478. Springer, Heidelberg (2008)"},{"key":"17_CR13","unstructured":"Schmidt, D.C.: qsort.c. C standard library stdlib within glibc 2.7 (2007), http:\/\/ftp.gnu.org\/gnu\/glibc\/"},{"issue":"4","key":"17_CR14","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 Inform.\u00a07(4), 327\u2013355 (1977)","journal-title":"Acta Inform."},{"issue":"10","key":"17_CR15","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1145\/359619.359631","volume":"21","author":"R. Sedgewick","year":"1978","unstructured":"Sedgewick, R.: Implementing quicksort programs. Comm. ACM\u00a021(10), 847\u2013857 (1978)","journal-title":"Comm. ACM"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/362875.362901","volume":"12","author":"R.C. Singleton","year":"1969","unstructured":"Singleton, R.C.: Algorithm 347: An efficient algorithm for sorting with minimal storage. Comm. ACM\u00a012(3), 185\u2013186 (1969)","journal-title":"Comm. ACM"},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM\u00a051(3), 385\u2013463 (2004)","journal-title":"J. ACM"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1017\/CBO9780511721571.010","volume-title":"Foundations of Computational Mathematics, Santander 2005","author":"D.A. Spielman","year":"2006","unstructured":"Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms and heuristics: Progress and open questions. In: Foundations of Computational Mathematics, Santander 2005, pp. 274\u2013342. Cambridge University Press, Cambridge (2006)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T10:45:04Z","timestamp":1558435504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}