{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T20:31:20Z","timestamp":1675715480711},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"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":[[1989,6]]},"DOI":"10.1007\/bf01553901","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T18:07:35Z","timestamp":1114020455000},"page":"447-459","source":"Crossref","is-referenced-by-count":9,"title":["Lower bounds for maximal and convex layers problems"],"prefix":"10.1007","volume":"4","author":[{"given":"Sanjiv","family":"Kapoor","sequence":"first","affiliation":[]},{"given":"Prakash","family":"Ramanan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01553901_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. E., and Ullman, J. D.,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974."},{"key":"BF01553901_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Lower Bounds for Algebraic Computation Trees,Proc. 15th ACM Symp. on Theory of Computing, Boston, Massachusetts, 1983, pp. 80\u201386.","DOI":"10.1145\/800061.808735"},{"key":"BF01553901_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TIT.1985.1057060","volume":"31","author":"B. M. Chazelle","year":"1985","unstructured":"Chazelle, B. M., Optimal Algorithms for Computing Depths and Layers,IEEE Trans. Inform. Theory,31 (1985), pp. 509\u2013517.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF01553901_CR4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(80)90064-2","volume":"10","author":"P. V. Emde Boas","year":"1980","unstructured":"Emde Boas, P. V., On the \u03a9(n lgn) Lower Bound for Convex Hull and Maximal Vector Determination,Inform. Process. Lett.,10 (1980), pp. 132\u2013136.","journal-title":"Inform. Process. Lett."},{"key":"BF01553901_CR5","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R. L. Graham","year":"1972","unstructured":"Graham, R. L., An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set,Inform. Process. Lett.,1 (1972), pp. 132\u2013133.","journal-title":"Inform. Process. Lett."},{"key":"BF01553901_CR6","volume-title":"Ph.D. Thesis","author":"S. Kapoor","year":"1984","unstructured":"Kapoor, S., and Ramanan, P., Unpublished manuscript. Also see the later's Ph.D. Thesis, Topics in Combinatorial Algorithms, Department of Computer Science, University of Illinois, Urbana, Illinois, 1984."},{"key":"BF01553901_CR7","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D. G., and Seidel, R., Output Size Sensitive Algorithms for Finding Maximal Vectors,Proc. 1st Ann. ACM Symp. on Computational Geometry, Baltimore, Maryland, 1985, pp. 89\u201396.","DOI":"10.1145\/323233.323246"},{"key":"BF01553901_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0215021","volume":"15","author":"D. G. Kirkpatrick","year":"1986","unstructured":"Kirkpatrick, D. G., and Seidel, R., The Ultimate Planar Convex Hull Algorithm?,SIAM J. Comput.,15 (1986), pp. 287\u2013299.","journal-title":"SIAM J. Comput."},{"key":"BF01553901_CR9","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H. T. Kung","year":"1975","unstructured":"Kung, H. T., Luccio, F., and Preparata, F. P., On Finding the Maxima of a Set of Vectors,J. Assoc. Comput. Mach.,22 (1975), pp. 469\u2013476.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01553901_CR10","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/359131.359132","volume":"22","author":"F. P. Preparata","year":"1979","unstructured":"Preparata, F. P., An Optimal Real Time Algorithm for Planar Convex Hull,Comm. ACM,22 (1979), pp. 402\u2013405.","journal-title":"Comm. ACM"},{"key":"BF01553901_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"F. P. Preparata","year":"1977","unstructured":"Preparata, F. P., and Hong, S. J., Convex Hulls of Finite Sets of Points in Two and Three Dimensions,Comm. ACM,20 (1977), pp. 87\u201393.","journal-title":"Comm. ACM"},{"key":"BF01553901_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(87)90141-4","volume":"24","author":"P. Ramanan","year":"1987","unstructured":"Ramanan, P., Obtaining Lower Bounds Using Artificial Components,Inform. Process. Lett.,24 (1987), pp. 243\u2013246.","journal-title":"Inform. Process. Lett."},{"key":"BF01553901_CR13","volume-title":"Ph.D. Thesis","author":"M. I. Shamos","year":"1978","unstructured":"Shamos, M. I., Computational Geometry, Ph.D. Thesis, Yale University, New Haven, Connecticut, 1978."},{"key":"BF01553901_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(82)90002-5","volume":"3","author":"J. M. Steele","year":"1982","unstructured":"Steele, J. M., and Yao, A. C., Lower Bounds for Algebraic Decision Trees,J. Algorithms,3 (1982), pp. 1\u20138.","journal-title":"J. Algorithms"},{"key":"BF01553901_CR15","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1145\/322276.322289","volume":"28","author":"A. C. Yao","year":"1981","unstructured":"Yao, A. C., A Lower Bound to Finding Convex Hulls,J. Assoc. Comput. Mach.,28 (1981), pp. 780\u2013789.","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553901.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01553901\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:21:13Z","timestamp":1556878873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01553901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":15,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01553901"],"URL":"https:\/\/doi.org\/10.1007\/bf01553901","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}