{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:06:58Z","timestamp":1760368018228},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0020-0190(89)90166-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"9-14","source":"Crossref","is-referenced-by-count":16,"title":["L-infinity interdistance selection by parametric search"],"prefix":"10.1016","volume":"30","author":[{"given":"Jeffrey S.","family":"Salowe","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90166-X_BIB1","author":"Aggarwal","year":"1987","journal-title":"The 1986\/87 Computational Geometry at Courant \u2014 Problems and Solutions"},{"key":"10.1016\/0020-0190(89)90166-X_BIB2","first-page":"1","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983","journal-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(89)90166-X_BIB3","first-page":"220","article-title":"Divide-and-conquer in multidimensional space","author":"Bentley","year":"1976","journal-title":"Proc. 8th Ann. ACM Symp. on Theory of Computing"},{"issue":"4","key":"10.1016\/0020-0190(89)90166-X_BIB4","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(89)90166-X_BIB5","first-page":"338","article-title":"Routing, merging and sorting on parallel models of computatation","author":"Borodin","year":"1982","journal-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(89)90166-X_BIB6","first-page":"125","article-title":"New techniques for computing order statistics in Eucledian space","author":"Chazelle","year":"1985","journal-title":"Proc. 1st Ann. Symp. on Computational Geometry"},{"issue":"1","key":"10.1016\/0020-0190(89)90166-X_BIB7","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/7531.7537","article-title":"Slowing down sorting networks to obtain faster sorting algorithms","volume":"34","author":"Cole","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90166-X_BIB8","first-page":"133","article-title":"Optimal slope selection","author":"Cole","year":"1988","journal-title":"Proc. 15th Internat. Coll. on Automata, Languages and Programming"},{"key":"10.1016\/0020-0190(89)90166-X_BIB9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","article-title":"The complexity of selection and ranking in X + Yand matrices with sorted columns","volume":"24","author":"Frederickson","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(89)90166-X_BIB10","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/322108.322114","article-title":"A fast selection algorithm and the problem of optimum distribution of effort","volume":"26","author":"Galil","year":"1979","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/0020-0190(89)90166-X_BIB11","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","article-title":"Combinatorial optimization with rational objective functions","volume":"4","author":"Megiddo","year":"1979","journal-title":"Math. Oper. Res."},{"issue":"4","key":"10.1016\/0020-0190(89)90166-X_BIB12","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithms in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90166-X_BIB13","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0020-0190(89)90166-X_BIB14","series-title":"Ph.D. Thesis","article-title":"Selection Problems in Computational Geometry","author":"Salowe","year":"1987"},{"key":"10.1016\/0020-0190(89)90166-X_BIB15","series-title":"Tech. Rep. 8801","article-title":"Selecting the kth largest-area convex polygon","author":"Salowe","year":"1988"},{"key":"10.1016\/0020-0190(89)90166-X_BIB16","series-title":"Algorithms and Complexity: New Directions and Recent Results","first-page":"251","article-title":"Geometry and statistics: Problems at the interface","author":"Shamos","year":"1976"},{"issue":"3","key":"10.1016\/0020-0190(89)90166-X_BIB17","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90166-X_BIB18","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/0214019","article-title":"New data structures for orthogonal range queries","volume":"14","author":"Willard","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908990166X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908990166X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:55:19Z","timestamp":1555088119000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908990166X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["002001908990166X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90166-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}