{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:42Z","timestamp":1725663642872},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540194880"},{"type":"electronic","value":"9783540392910"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19488-6_112","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:12:36Z","timestamp":1330200756000},"page":"133-146","source":"Crossref","is-referenced-by-count":2,"title":["Optimal slope selection"],"prefix":"10.1007","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Salowe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. L.","family":"Steiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Endre","family":"Szemer\u00e9di","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M., Koml\u00f3s, J., and Szemer\u00e9di, E. \"Sorting in cLogn Parallel Steps\". Combinatorica 3 (1983), 1\u201319.","journal-title":"Combinatorica"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L. and Ottmann, Th. \"Algorithms for Reporting and Counting Geometric Intersections\". IEEE Trans. on Computers C 28 (1979), 643\u2013647.","journal-title":"IEEE Trans. on Computers C"},{"key":"10_CR3","first-page":"448","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., and Tarjan, R.E. \"Time Bounds for Selection\". JCSS 7 (1973), 448\u2013461.","journal-title":"JCSS"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Chazelle, B. \"New Techniques for Computing Order Statistics in Euclidean Space\". Proc. ACM Symposium on Comp. Geom. (1985), 125\u2013134.","DOI":"10.1145\/323233.323251"},{"key":"10_CR5","first-page":"200","volume":"31","author":"R. Cole","year":"1984","unstructured":"Cole, R. \"Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms\". JACM 31 (1984), 200\u2013208.","journal-title":"JACM"},{"key":"10_CR6","volume-title":"The Art of Computer Programming. Volume 3:Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, Donald E.. The Art of Computer Programming. Volume 3:Sorting and Searching. Addison-Wesley, Reading, Mass., 1973."},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N. \"Applying Parallel Computational Algorithms in the Design of Serial Algorithms\". JACM 30 (1983), 852\u2013865.","journal-title":"JACM"},{"key":"10_CR8","volume-title":"Selection Problems in Computational Geometry","author":"J. Salowe","year":"1987","unstructured":"Salowe, Jeffrey. Selection Problems in Computational Geometry. Ph.D. Th., Department of Computer Science, Rutgers University, New Brunswick, NJ, 1987."},{"key":"10_CR9","first-page":"251","volume-title":"Geometry and Statistics: Problems at the Interface","author":"M.I. Shamos","year":"1976","unstructured":"Shamos, M.I. \"Algorithms and Complexity: New Directions and Recent Results\". Geometry and Statistics: Problems at the Interface (1976), 251\u2013280. Academic Press, New York."},{"key":"10_CR10","first-page":"386","volume":"53","author":"H. Theil","year":"1950","unstructured":"Theil, H. \"A Rank-Invariant Method of Linear and Polynomial Regression Analysis I\". Proc. Kon. Ned. Akad. v. Wetensch. A. 53 (1950), 386\u2013392.","journal-title":"Proc. Kon. Ned. Akad. v. Wetensch. A."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19488-6_112.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:17:24Z","timestamp":1605644244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19488-6_112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540194880","9783540392910"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-19488-6_112","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}