{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:19:44Z","timestamp":1725517184263},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852377"},{"type":"electronic","value":"9783540852384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85238-4_38","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T15:34:36Z","timestamp":1219073676000},"page":"467-478","source":"Crossref","is-referenced-by-count":3,"title":["Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise"],"prefix":"10.1007","author":[{"given":"Bodo","family":"Manthey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Till","family":"Tantau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","first-page":"198","volume-title":"Mathematical Foundations of Computer Science 2003","author":"K. Mehlhorn","year":"2003","unstructured":"Mehlhorn, K., Banderier, C., Beier, R.: 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)"},{"issue":"1","key":"38_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1998.0988","volume":"31","author":"J. Basch","year":"1999","unstructured":"Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J. Algorithms\u00a031(1), 1\u201328 (1999)","journal-title":"J. Algorithms"},{"key":"38_CR3","unstructured":"Damerow, V.: Average and Smoothed Complexity of Geometric Structures. PhD thesis, Universit\u00e4t Paderborn (2006)"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., auf der Heide, F.M., 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)"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/978-3-540-30140-0_25","volume-title":"Algorithms \u2013 ESA 2004","author":"V. Damerow","year":"2004","unstructured":"Damerow, V., Sohler, C.: Extreme Points Under Random Noise. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 264\u2013274. Springer, Heidelberg (2004)"},{"issue":"3","key":"38_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/765568.765572","volume":"50","author":"M. Drmota","year":"2003","unstructured":"Drmota, M.: An analytic approach to the height of binary search trees II. J.ACM\u00a050(3), 333\u2013374 (2003)","journal-title":"J.ACM"},{"issue":"2","key":"38_CR7","first-page":"117","volume":"3","author":"M. Drmota","year":"2004","unstructured":"Drmota, M.: Profile and height of random binary search trees. J. Iranian Statistical Society\u00a03(2), 117\u2013138 (2004)","journal-title":"J. Iranian Statistical Society"},{"issue":"1","key":"38_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/S0196-6774(02)00216-X","volume":"44","author":"J.A. Fill","year":"2002","unstructured":"Fill, J.A., Janson, S.: Quicksort asymptotics. J. Algorithms\u00a044(1), 4\u201328 (2002)","journal-title":"J. Algorithms"},{"key":"38_CR9","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":"38_CR10","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":"38_CR11","unstructured":"Manthey, B., Tantau, T.: Smoothed analysis of binary search trees and quicksort under additive noise. Report 07-039, Electronic Colloquium on Computational Complexity (ECCC) (2007)"},{"issue":"3","key":"38_CR12","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1145\/765568.765571","volume":"50","author":"B. Reed","year":"2003","unstructured":"Reed, B.: The height of a random binary search tree. J.ACM\u00a050(3), 306\u2013332 (2003)","journal-title":"J.ACM"},{"issue":"4","key":"38_CR13","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":"3","key":"38_CR14","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":"38_CR15","doi-asserted-by":"crossref","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","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:31:29Z","timestamp":1619523089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852377","9783540852384"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}