{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:44:47Z","timestamp":1725806687463},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319127354"},{"type":"electronic","value":"9783319127361"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12736-1_9","type":"book-chapter","created":{"date-parts":[[2014,10,13]],"date-time":"2014-10-13T14:53:24Z","timestamp":1413212004000},"page":"159-175","source":"Crossref","is-referenced-by-count":0,"title":["Functional Pearl: Nearest Shelters in Manhattan"],"prefix":"10.1007","author":[{"given":"Shin-Cheng","family":"Mu","sequence":"first","affiliation":[]},{"given":"Ting-Wei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional divide-and-conquer. Communications of the ACM\u00a023(4), 214\u2013229 (1980)","journal-title":"Communications of the ACM"},{"key":"9_CR2","unstructured":"Bird, R.S., de Moor, O.: Algebra of Programming. International Series in Computer Science. Prentice Hall (1997)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-45821-2_9","volume-title":"Generative Programming and Component Engineering","author":"W.-N. Chin","year":"2002","unstructured":"Chin, W.-N., Hu, Z.: Towards a modular program derivation via fusion and tupling. In: Batory, D., Blum, A., Taha, W. (eds.) GPCE 2002. LNCS, vol.\u00a02487, pp. 140\u2013155. Springer, Heidelberg (2002)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Fast algorithms for the all nearest neighbors problem. In: Synder, L. (ed.) Foundations of Computer Science, pp. 226\u2013232. IEEE Computer Society Press (1983)","DOI":"10.1109\/SFCS.1983.16"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Programming Languages: Implementations, Logics and Programs","author":"O. Moor de","year":"1995","unstructured":"de Moor, O.: A generic program for sequential decision processes. In: Hermenegildo, M., Swierstra, S.D. (eds.) PLILP 1995. LNCS, vol.\u00a0982, pp. 1\u201323. Springer, Heidelberg (1995)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: DeMillo, R.A. (ed.) Theory of Computing, pp. 135\u2013143. ACM Press (1984)","DOI":"10.1145\/800057.808675"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1017\/S0956796800001908","volume":"6","author":"J. Gibbons","year":"1996","unstructured":"Gibbons, J.: The third homomorphism theorem. Journal of Functional Programming\u00a06(4), 657\u2013665 (1996)","journal-title":"Journal of Functional Programming"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Gries, D., Schneider, F.B.: A Logical Approach to Discrete Math. Springer (October 22, 1993)","DOI":"10.1007\/978-1-4757-3837-7"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-61550-4_166","volume-title":"Mathematical Foundations of Computer Science 1996","author":"Z. Hu","year":"1996","unstructured":"Hu, Z., Iwasaki, H., Takeichi, M.: Construction of list homomorphisms via tupling and fusion. In: Penczek, W., Sza\u0142as, A. (eds.) MFCS 1996. LNCS, vol.\u00a01113, pp. 407\u2013418. Springer, Heidelberg (1996)"},{"issue":"5","key":"9_CR10","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0956796897002864","volume":"7","author":"G. Huet","year":"1997","unstructured":"Huet, G.: The zipper. Journal of Functional Programming\u00a07(5), 549\u2013554 (1997)","journal-title":"Journal of Functional Programming"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-319-07151-0_12","volume-title":"Functional and Logic Programming","author":"A. Morihata","year":"2014","unstructured":"Morihata, A., Koishi, M., Ohori, A.: Dynamic programming via thinning and incrementalization. In: Codish, M., Sumii, E. (eds.) FLOPS 2014. LNCS, vol.\u00a08475, pp. 186\u2013202. Springer, Heidelberg (2014)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Mu, S.-C., Lyu, Y.-H., Morihata, A.: Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning. In: Oliveira, B.C.d.S., Zalewski, M. (eds.) Workshop on Generic Programming, pp. 97\u2013108. ACM Press (2010)","DOI":"10.1145\/1863495.1863508"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Sasano, I., Hu, Z., Takeichi, M., Ogawa, M.: Make it practical: A generic linear-time algorithm for solving maximum-weightsum problems. In: Odersky, M., Wadler, P. (eds.) International Conference on Functional Programming, pp. 137\u2013149. ACM Press (2000)","DOI":"10.1145\/357766.351254"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods\u00a06(2), 306\u2013318 (1985)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"P.M. Vaidya","year":"1989","unstructured":"Vaidya, P.M.: An O(n logn) algorithm for the all-nearest-neighbors problem. Discrete and Computational Geometry\u00a04(2), 101\u2013115 (1989)","journal-title":"Discrete and Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12736-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T03:54:17Z","timestamp":1559015657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12736-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319127354","9783319127361"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12736-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}