{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:06Z","timestamp":1725456246431},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051516X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015936","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:25:05Z","timestamp":1132727105000},"page":"152-160","source":"Crossref","is-referenced-by-count":0,"title":["The convex hull problem on grids computational and combinatorial aspects"],"prefix":"10.1007","author":[{"given":"Kristel","family":"Unger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1109\/TC.1985.5009381","volume":"34","author":"E. Dittert","year":"1985","unstructured":"Dittert, E.; M.J. O'Donnell: Lower bounds for sorting with realistic instruction sets. IEEE Trans.Comp. 34(1985), 311\u2013317.","journal-title":"IEEE Trans.Comp."},{"key":"14_CR2","unstructured":"Karlsson,R.G.; M.H.Overmars: Scanline Algorithms on a Grid. Dep. of Comp. Science and Inf. Science, University of Link\u00f6ping, Link\u00f6ping 1986, Research Report LITH-IDA-86-30."},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(83)90023-3","volume":"28","author":"D. Kirkpatrick","year":"1984","unstructured":"Kirkpatrick, D., Reisch, S.: Upper Bounds for Sorting Integers on Random Access Machines, Theoretical Computer Science 28(1984), 263\u2013276.","journal-title":"Theoretical Computer Science"},{"key":"14_CR4","unstructured":"Overmars,M.H.: Computational geometry on a grid an overview. Dep.of Comp. Sc., University of Utrecht, Utrecht 1987, Technical Report RUU-CS-87-4."},{"key":"14_CR5","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., M.I. Shamos: Computational Geometry, Springer 1985, New York."},{"key":"14_CR6","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.; A.C. Yao: Lower bounds for algebraic decision trees. J. of Algorithms 3(1982), 1\u20138.","journal-title":"J. of Algorithms"},{"key":"14_CR7","volume-title":"The convex hull problem on special planar point sets","author":"K. Unger","year":"1988","unstructured":"Unger, K.: The convex hull problem on special planar point sets. K.-Weierstra\u00df-Institut Berlin, Berlin 1988, Report R-MATH-05\/88."},{"key":"14_CR8","unstructured":"Unger,K.:Another method for proving lower bounds in the model of k-th order decision trees, (in preparation)."}],"container-title":["Lecture Notes in Computer Science","Machines, Languages, and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015936.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:10:09Z","timestamp":1607353809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051516X"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0015936","relation":{},"subject":[]}}