{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:50Z","timestamp":1761611330519},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_6","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"61-72","source":"Crossref","is-referenced-by-count":9,"title":["Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems"],"prefix":"10.1007","author":[{"given":"Tetsuo","family":"Asano","sequence":"first","affiliation":[]},{"given":"David","family":"Kirkpatrick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-03456-5_17","volume-title":"Efficient Algorithms","author":"T. Asano","year":"2009","unstructured":"Asano, T., Bereg, S., Kirkpatrick, D.: Finding Nearest Larger Neighbors: A Case Study in Algorithm Design and Analysis. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol.\u00a05760, pp. 249\u2013260. Springer, Heidelberg (2009)"},{"unstructured":"Asano, T., Buchin, K., Buchin, M., Korman, M., Mulzer, W., Rota, G., Schultz, A.: Memory-constrained algorithms for simple polygons. In: 28th European Workshop on Computational Geometry (EuroCG), Booklet of Abstracts, pp. 49\u201352 (2012)","key":"6_CR2"},{"issue":"1","key":"6_CR3","first-page":"46","volume":"2","author":"T. Asano","year":"2011","unstructured":"Asano, T., Mulzer, W., Rote, G., Wang, Y.: Constant-work-space algorithms for geometric problems. Journal of Computational Geometry\u00a02(1), 46\u201368 (2011)","journal-title":"Journal of Computational Geometry"},{"unstructured":"Barba, L., Korman, M., Langerman, S., Sadakane, K., Silveira, R.I.: Space-time trade-offs for stack-based algorithms. Proc. STACS, pp. 281\u2013292 (2013)","key":"6_CR4"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1142\/S0218195902000906","volume":"12","author":"P. Bose","year":"2002","unstructured":"Bose, P., Morin, P.: An improved algorithm for subdivision traversal without extra storage. International Journal of Computational Geometry & Applications\u00a012(4), 297\u2013308 (2002)","journal-title":"International Journal of Computational Geometry & Applications"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S., Preparata, F.P., Tarjan, R.E.: Triangulating a simple polygon. Information Processing Letters\u00a07(4), 175\u2013179 (1978)","journal-title":"Information Processing Letters"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(95)00225-1","volume":"165","author":"J.I. Munro","year":"1996","unstructured":"Munro, J.I., Raman, V.: Selection from read-only memory and sorting with minimum data movement. Theoretical Computer Science\u00a0165, 311\u2013323 (1996)","journal-title":"Theoretical Computer Science"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"J.I. Munro","year":"1980","unstructured":"Munro, J.I., Paterson, M.S.: Selection and sorting with limited storage. Theoretical Computer Science\u00a012, 315\u2013323 (1980)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:28:10Z","timestamp":1557930490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}