{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T03:58:04Z","timestamp":1759118284791},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1007\/bf01189991","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T16:02:25Z","timestamp":1108656145000},"page":"501-524","source":"Crossref","is-referenced-by-count":14,"title":["A provably fast linear-expected-time maxima-finding algorithm"],"prefix":"10.1007","volume":"11","author":[{"given":"M. J.","family":"Golin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Bentley, J. L., K. L. Clarkson, and D. B. Levine. Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls,Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 179?187."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1145\/322092.322095","volume":"25","author":"J. L. Bentley","year":"1978","unstructured":"Bentley, J. L., H. T. Kung, M. Schkolnick, and C. D. Thompson. On the Average Number of Maxima in a Set of Vectors and Applications,Journal of the Association for Computing Machinery, vol. 25, October 1978, pp. 536?543.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(89)90156-7","volume":"33","author":"C. Buchta","year":"1989","unstructured":"Buchta, C. On the Average Number of maxima in a Set of Vectors,Information Processing Letters, vol. 33, November 1989, pp. 63?65.","journal-title":"Information Processing Letters"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02915448","volume":"26","author":"L. Devroye","year":"1988","unstructured":"Devroye, L. Applications of the Theory of Records in the Study of Random Trees,Acta Informatica, vol. 26, 1988, pp. 123?130.","journal-title":"Acta Informatica"},{"key":"CR5","unstructured":"Devroye, L.Lecture Notes on Bucket Algorithms, Birkh\u00e4user-Verlag, Boston."},{"issue":"No. 2","key":"CR6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/379172.379188","volume":"21","author":"R. Dwyer","year":"1990","unstructured":"Dwyer, R. Kindler, Gentler, Average-Case Analysis for Convex Hulls and Random Vectors,SIGACT News, vol. 21, No. 2, Spring 1990, pp. 64?71.","journal-title":"SIGACT News"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1989\/90","unstructured":"Hagerup, T. and C. R\u00fcb. A Guided Tour of Chernoff Bounds,Information Processing Letters, vol. 33, 1989\/90, pp. 305?308.","journal-title":"Information Processing Letters"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H. T. Kung","year":"1975","unstructured":"Kung, H. T., F. Luccio, and F. P. Preparata. On Finding the Maxima of a Set of Vectors,Journal of the Association for Computing Machinery, vol. 22, October 1975, pp. 469?474.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"Preparata, F. P. and M. I. Shamos.Computational Geometry, Springer-Verlag, New York, 1985."},{"issue":"No. 2","key":"CR10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"Tarjan, R. E. Amortized Computational Complexity,SIAM Journal of Algebraic and Discrete Methods, vol. 6, No. 2, April 1985, pp. 28?40.","journal-title":"SIAM Journal of Algebraic and Discrete Methods"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189991.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01189991\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T09:08:06Z","timestamp":1556615286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01189991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["BF01189991"],"URL":"https:\/\/doi.org\/10.1007\/bf01189991","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}