{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:16Z","timestamp":1742913496931,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360442"},{"type":"electronic","value":"9783642360466"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36046-6_5","type":"book-chapter","created":{"date-parts":[[2013,1,16]],"date-time":"2013-01-16T00:56:22Z","timestamp":1358297782000},"page":"43-52","source":"Crossref","is-referenced-by-count":0,"title":["Quicksort and Large Deviations"],"prefix":"10.1007","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. MIT Press, McGraw Hill (2001)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1145\/5925.5930","volume":"33","author":"L. Devroye","year":"1986","unstructured":"Devroye, L.: A note on the height of binary search trees. Journal of the ACM\u00a033, 489\u2013498 (1986)","journal-title":"Journal of the ACM"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Durrett, R.: Probability: Theory and Examples, 4th edn. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511779398"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1214\/aop\/1176996452","volume":"3","author":"D.A. Freedman","year":"1975","unstructured":"Freedman, D.A.: On tail probabilities for martingales. Ann. Probab.\u00a03, 100\u2013118 (1975)","journal-title":"Ann. Probab."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Grimmett, G.R., Stirzaker, D.R.: Probability and Random Processes, 3rd edn. Oxford University Press (2001)","DOI":"10.1093\/oso\/9780198572237.001.0001"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1051\/ita\/1989230303171","volume":"23","author":"P. Hennequin","year":"1989","unstructured":"Hennequin, P.: Combinatorial analysis of quicksort algorithm. Theoretical Informatics and Applications\u00a023, 317\u2013333 (1989)","journal-title":"Theoretical Informatics and Applications"},{"key":"5_CR7","first-page":"321","volume":"7","author":"C.A.R. Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Partition (algorithm 63), quicksort (algorithm 64), and find (algorithm 65). J. ACM\u00a07, 321\u2013322 (1961)","journal-title":"J. ACM"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. Computer J.\u00a05, 10\u201315 (1962)","journal-title":"Computer J."},{"key":"5_CR9","unstructured":"Knuth, D.: The Art of Computer Programming vol. 3: Sorting and Searching, 3rd edn. Addison-Wesley (1997)"},{"key":"5_CR10","volume-title":"Evolution of Random Search Trees","author":"H.M. Mahmoud","year":"1992","unstructured":"Mahmoud, H.M.: Evolution of Random Search Trees. Wiley, New York (1992)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Siemons, J. (ed.) Surveys in Combinatorics. London Math Society (1989)","DOI":"10.1017\/CBO9781107359949.008"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: Concentration. In: Habib, M., McDiarmid, C., Ramirez, J., Reed, B. (eds.) Probabilistic Methods for Algorithmic Discrete Mathematics, pp. 195\u2013248. Springer (1998)","DOI":"10.1007\/978-3-662-12788-9_6"},{"key":"5_CR13","unstructured":"McDiarmid, C., Hayward, R.: Strong concentration for quicksort. In: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 414\u2013421 (1992)"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1006\/jagm.1996.0055","volume":"21","author":"C. McDiarmid","year":"1996","unstructured":"McDiarmid, C., Hayward, R.: Large deviations for Quicksort. J. Algorithms\u00a021, 476\u2013507 (1996)","journal-title":"J. Algorithms"},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1051\/ita\/1989230303351","volume":"23","author":"M. R\u00e9gnier","year":"1989","unstructured":"R\u00e9gnier, M.: A limiting distribution for quicksort. Theoretical Informatics and Applications\u00a023, 335\u2013343 (1989)","journal-title":"Theoretical Informatics and Applications"},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1051\/ita\/1991250100851","volume":"25","author":"U. R\u00f6sler","year":"1991","unstructured":"R\u00f6sler, U.: A limit theorem for quicksort. Theoretical Informatics and Applications\u00a025, 85\u2013100 (1991)","journal-title":"Theoretical Informatics and Applications"},{"key":"5_CR17","unstructured":"Sedgewick, R.: Quicksort, 1st edn. Garland Publishing Inc. (1980)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Shiryaev, A.N.: Probability, 2nd edn. Graduate Texts in Mathematics, vol.\u00a095. Springer (1996)","DOI":"10.1007\/978-1-4757-2539-1"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/362736.362753","volume":"13","author":"M.H. VanEmden","year":"1970","unstructured":"VanEmden, M.H.: Increasing the efficiency of quicksort. Communications of the ACM\u00a013, 563\u2013567 (1970)","journal-title":"Communications of the ACM"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Williams, D.: Probability with Martingales. Cambridge University Press (1991)","DOI":"10.1017\/CBO9780511813658"}],"container-title":["Lecture Notes in Computer Science","Mathematical and Engineering Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36046-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T19:16:20Z","timestamp":1714850180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-36046-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360442","9783642360466"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36046-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}