{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:21:39Z","timestamp":1742980899279,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029264"},{"type":"electronic","value":"9783642029271"}],"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-02927-1_62","type":"book-chapter","created":{"date-parts":[[2009,7,4]],"date-time":"2009-07-04T04:37:10Z","timestamp":1246682230000},"page":"750-763","source":"Crossref","is-referenced-by-count":15,"title":["The Number of Symbol Comparisons in QuickSort and QuickSelect"],"prefix":"10.1007","author":[{"given":"Brigitte","family":"Vall\u00e9e","sequence":"first","affiliation":[]},{"given":"Julien","family":"Cl\u00e9ment","sequence":"additional","affiliation":[]},{"given":"James Allen","family":"Fill","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Flajolet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.jnt.2004.08.008","volume":"110","author":"V. Baladi","year":"2005","unstructured":"Baladi, V., Vall\u00e9e, B.: Euclidean algorithms are Gaussian. Journal of Number Theory\u00a0110, 331\u2013386 (2005)","journal-title":"Journal of Number Theory"},{"key":"62_CR2","doi-asserted-by":"crossref","unstructured":"Baladi, V., Vall\u00e9e, B.: Exponential decay of correlations for surface semi-flows without finite Markov partitions. In: Proc. AMS 133, vol.\u00a03, pp. 865\u2013874 (2005)","DOI":"10.1090\/S0002-9939-04-07671-3"},{"issue":"1\/2","key":"62_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02679623","volume":"29","author":"J. Cl\u00e9ment","year":"2001","unstructured":"Cl\u00e9ment, J., Flajolet, P., Vall\u00e9e, B.: Dynamical sources in information theory: A general analysis of trie structures. Algorithmica\u00a029(1\/2), 307\u2013369 (2001)","journal-title":"Algorithmica"},{"key":"62_CR4","doi-asserted-by":"publisher","first-page":"357","DOI":"10.2307\/121012","volume":"147","author":"D. Dolgopyat","year":"1998","unstructured":"Dolgopyat, D.: On decay of correlations in Anosov flows. Annals of Mathematics\u00a0147, 357\u2013390 (1998)","journal-title":"Annals of Mathematics"},{"key":"62_CR5","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1017\/S0143385798117431","volume":"18","author":"D. Dolgopyat","year":"1998","unstructured":"Dolgopyat, D.: Prevalence of rapid mixing (I). Ergodic Theory and Dynamical Systems\u00a018, 1097\u20131114 (1998)","journal-title":"Ergodic Theory and Dynamical Systems"},{"key":"62_CR6","unstructured":"Delange, H.: G\u00e9n\u00e9ralisation du th\u00e9or\u00e8me de Ikehara. Annales scientifiques de l\u2019\u00c9cole Normale Sup\u00e9rieure S\u00e9r. 3, 71(3), 213\u2013142 (1954)"},{"key":"62_CR7","unstructured":"Fill, J.A., Janson, S.: The number of bit comparisons used by Quicksort: An average-case analysis. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 293\u2013300 (2001)"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Fill, J.A., Nakama, T.: Analysis of the expected number of bit comparisons required by Quickselect. Algorithmica, ArXiv:0706.2437 (to appear), Extended abstract in Proceedings ANALCO, pp. 249\u2013256. SIAM Press (2008)","DOI":"10.1137\/1.9781611972986.9"},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(94)00281-M","volume":"144","author":"P. Flajolet","year":"1995","unstructured":"Flajolet, P., Sedgewick, R.: Mellin transforms and asymptotics: finite differences and Rice\u2019s integrals. Theoretical Comp. Sc.\u00a0144, 101\u2013124 (1995)","journal-title":"Theoretical Comp. Sc."},{"key":"62_CR10","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009); available electronically from the authors\u2019 home pages","DOI":"10.1017\/CBO9780511801655"},{"key":"62_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.2989\/QM.2008.31.4.1.605","volume":"31","author":"P. Grabner","year":"2008","unstructured":"Grabner, P., Prodinger, H.: On a constant arising in the analysis of bit comparisons in Quickselect. Quaestiones Mathematicae\u00a031, 303\u2013306 (2008)","journal-title":"Quaestiones Mathematicae"},{"key":"62_CR12","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., Mart\u00ednez, C.: Analysis of Hoare\u2019s FIND Algorithm. Random Structures & Algorithms\u00a010, 143\u2013156 (1997)","journal-title":"Random Structures & Algorithms"},{"key":"62_CR13","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, 2nd edn. Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"62_CR14","unstructured":"N\u00f6rlund, N.E.: Le\u00e7ons sur les \u00e9quations lin\u00e9aires aux diff\u00e9rences finies. Gauthier-Villars, Paris (1929)"},{"key":"62_CR15","volume-title":"Vorlesungen \u00fcber Differenzenrechnung","author":"N.E. N\u00f6rlund","year":"1954","unstructured":"N\u00f6rlund, N.E.: Vorlesungen \u00fcber Differenzenrechnung. Chelsea Publishing Company, New York (1954)"},{"key":"#cr-split#-62_CR16.1","unstructured":"Sedgewick, R.: Quicksort. Garland Pub. Co., New York (1980);"},{"key":"#cr-split#-62_CR16.2","unstructured":"Reprint of Ph.D. thesis, Stanford University (1975)"},{"key":"62_CR17","first-page":"1","volume-title":"Algorithms in\u00a0C, Parts\u00a01\u20134","author":"R. Sedgewick","year":"1998","unstructured":"Sedgewick, R.: Algorithms in\u00a0C, Parts\u00a01\u20134, 3rd edn., pp. 1\u20134. Addison-Wesley, Reading (1998)","edition":"3"},{"key":"62_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032770","volume-title":"Average-Case Analysis of Algorithms on Sequences","author":"W. Szpankowski","year":"2001","unstructured":"Szpankowski, W.: Average-Case Analysis of Algorithms on Sequences. John Wiley, Chichester (2001)"},{"issue":"1\/2","key":"62_CR19","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/BF02679622","volume":"29","author":"B. Vall\u00e9e","year":"2001","unstructured":"Vall\u00e9e, B.: Dynamical sources in information theory: Fundamental intervals and word prefixes. Algorithmica\u00a029(1\/2), 262\u2013306 (2001)","journal-title":"Algorithmica"},{"issue":"1","key":"62_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.3934\/dcds.2006.15.281","volume":"15","author":"B. Vall\u00e9e","year":"2006","unstructured":"Vall\u00e9e, B.: Euclidean dynamics. Discrete and Continuous Dynamical Systems\u00a015(1), 281\u2013352 (2006)","journal-title":"Discrete and Continuous Dynamical Systems"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02927-1_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T02:54:23Z","timestamp":1558407263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02927-1_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029264","9783642029271"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02927-1_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}