{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:54:54Z","timestamp":1725573294450},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_6","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"30-41","source":"Crossref","is-referenced-by-count":0,"title":["In-Place Randomized Slope Selection"],"prefix":"10.1007","author":[{"given":"Henrik","family":"Blunck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Vahrenhold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Bose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Vahrenhold, J.: Space-efficient geometric divide-and-conquer algorithms. Computational Geometry: Theory & Applications (2006), To appear, accepted November 2004","DOI":"10.1016\/j.comgeo.2006.03.006"},{"key":"6_CR2","unstructured":"Br\u00f6nnimann, H., Chan, T.M.-Y.: Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Computational Geometry: Theory & Applications (in press, 2006)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Br\u00f6nnimann, H., Chan, T.M.-Y., Chen, E.Y.: Towards in-place geometric algorithms. In: Proc. 20th Symp. Computational Geometry, pp. 239\u2013246 (2004)","DOI":"10.1145\/997817.997854"},{"issue":"1","key":"6_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0925-7721(97)00025-4","volume":"10","author":"H. Br\u00f6nnimann","year":"1998","unstructured":"Br\u00f6nnimann, H., Chazelle, B.M.: Optimal slope selection via cuttings. Computational Geometry: Theory and Applications\u00a010(1), 23\u201329 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2003.05.004","volume":"321","author":"H. Br\u00f6nnimann","year":"2004","unstructured":"Br\u00f6nnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., Toussaint, G.T.: Space-efficient planar convex hull algorithms. Theoretical Computer Science\u00a0321(1), 25\u201340 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/0218055","volume":"18","author":"R. Cole","year":"1989","unstructured":"Cole, R., Salowe, J.S., Steiger, W.L., Szemer\u00e9di, E.: An optimal-time algorithm for slope selection. SIAM J. Computing\u00a018(4), 792\u2013810 (1989)","journal-title":"SIAM J. Computing"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195992000020","volume":"2","author":"M.B. Dillencourt","year":"1992","unstructured":"Dillencourt, M.B., Mount, D.M., Nethanyahu, N.S.: A randomized algorithm for slope selection. Intl. J. Computational Geometry and Applications\u00a02(1), 1\u201327 (1992)","journal-title":"Intl. J. Computational Geometry and Applications"},{"key":"6_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Berlin (1987)"},{"issue":"1\u20132","key":"6_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(98)00162-5","volume":"237","author":"V. Geffert","year":"2000","unstructured":"Geffert, V., Katajainen, J., Pasanen, T.: Asymptotically efficient in-place merging. Theoretical Computer Science\u00a0237(1\u20132), 159\u2013181 (2000)","journal-title":"Theoretical Computer Science"},{"key":"6_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/0471725250","volume-title":"Robust Statistics","author":"P. Huber","year":"1981","unstructured":"Huber, P.: Robust Statistics. Wiley, New York (1981)"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(93)90234-Z","volume":"47","author":"M.J. Katz","year":"1993","unstructured":"Katz, M.J., Sharir, M.: Optimal slope selection via expanders. Information Processing Letters\u00a047(3), 115\u2013122 (1993)","journal-title":"Information Processing Letters"},{"key":"6_CR12","volume-title":"Algorithm Design","author":"J. Kleinberg","year":"2006","unstructured":"Kleinberg, J., Tardos, \u00c9.: Algorithm Design. Addison-Wesley, Boston (2006)"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(91)90177-J","volume":"39","author":"J. Matou\u0161ek","year":"1991","unstructured":"Matou\u0161ek, J.: Randomized optimal algorithm for slope selection. Information Processing Letters\u00a039(4), 183\u2013187 (1991)","journal-title":"Information Processing Letters"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/PL00009190","volume":"20","author":"J. Matou\u0161ek","year":"1998","unstructured":"Matou\u0161ek, J., Mount, D.M., Nethanyahu, N.S.: Efficient randomized algorithms for the repeated median line estimator. Algorithmica\u00a020(2), 136\u2013150 (1998)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM\u00a030(4), 852\u2013865 (1983)","journal-title":"J. ACM"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J.I. Munro","year":"1986","unstructured":"Munro, J.I.: An implicit data structure supporting insertion, deletion, and search in O(log2 n) time. J. Computer and System Sciences\u00a033(1), 66\u201374 (1986)","journal-title":"J. Computer and System Sciences"},{"key":"6_CR17","unstructured":"Shafer, L., Steiger, W.L.: Randomizing optimal geometric algorithms. In: Proc. 5th Canadian Conference on Computational Geometry, pp. 133\u2013138 (1993)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11534273_14","volume-title":"Algorithms and Data Structures","author":"J. Vahrenhold","year":"2005","unstructured":"Vahrenhold, J.: Line-segment intersection made in-place. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 146\u2013157. Springer, Heidelberg (2005)"},{"issue":"6","key":"6_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232: Heapsort. Comm. ACM\u00a07(6), 347\u2013348 (1964)","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T16:12:07Z","timestamp":1683475927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11758471_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}