{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:25:48Z","timestamp":1725575148631},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240136"},{"type":"electronic","value":"9783540305019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30501-9_53","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T02:42:17Z","timestamp":1294972937000},"page":"243-247","source":"Crossref","is-referenced-by-count":0,"title":["Constant Time Algorithms for the 3-D All Nearest Neighbor Problem on the LARPBS"],"prefix":"10.1007","author":[{"given":"Yuh-Rau","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Jinn","family":"Horng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"53_CR1","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1109\/71.532112","volume":"7","author":"T.H. Lai","year":"1996","unstructured":"Lai, T.H., Sheng, M.J.: Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes. IEEE Trans. Parallel and Distributed Systems.\u00a07(8), 806\u2013817 (1996)","journal-title":"IEEE Trans. Parallel and Distributed Systems."},{"issue":"4","key":"53_CR2","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/TC.1985.5009385","volume":"34","author":"T. Leighton","year":"1985","unstructured":"Leighton, T.: Tight bounds on the complexity of parallel sorting. IEEE Trans. Computers.\u00a034(4), 344\u2013354 (1985)","journal-title":"IEEE Trans. Computers."},{"doi-asserted-by":"crossref","unstructured":"Pan, Y., Li, K.: Linear Array with a Reconfigurable Pipelined Bus System - Concepts and Applications. Journal of Information Sciences, 237\u2013258 (1998)","key":"53_CR3","DOI":"10.1016\/S0020-0255(97)10013-5"},{"key":"53_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/01495739808947358","volume":"13","author":"Y. Pan","year":"1998","unstructured":"Pan, Y., Li, K., Zheng, S.-Q.: Fast Nearest Neighbor Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System. Parallel Algorithms and Applications\u00a013, 1\u201325 (1998)","journal-title":"Parallel Algorithms and Applications"},{"issue":"10","key":"53_CR5","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1109\/TPDS.2003.1239866","volume":"14","author":"Y.R. Wang","year":"2003","unstructured":"Wang, Y.R., Horng, S.J.: An O(1) Time Parallel Algorithm for the 3-D Euclidean Distance Transform on the CRCW PRAM Model. IEEE Trans. on Parallel and Distributed Systems\u00a014(10), 973\u2013982 (2003)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing: Applications and Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30501-9_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:42Z","timestamp":1605761862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30501-9_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240136","9783540305019"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30501-9_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}