{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T15:19:00Z","timestamp":1774883940265,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0167-8191(92)90046-a","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"807-810","source":"Crossref","is-referenced-by-count":5,"title":["Finding congruent regions in parallel"],"prefix":"10.1016","volume":"18","author":[{"given":"Laurence","family":"Boxer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(92)90046-A_BIB1","series-title":"Computer Vision","author":"Ballard","year":"1982"},{"key":"10.1016\/0167-8191(92)90046-A_BIB2","series-title":"Proc. 7th Israeli Conf. on Artificial Intelligence and Computer Vision","first-page":"325","article-title":"An improved parallel algorithm for finding congruent polygons","author":"Boxer","year":"1990"},{"issue":"4","key":"10.1016\/0167-8191(92)90046-A_BIB3","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0167-8191(92)90046-A_BIB4","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/TC.1977.1674832","article-title":"Pattern matching under affine transformation","volume":"26","author":"Dirilten","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(92)90046-A_BIB5","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1109\/12.88483","article-title":"Time-space optimal parallel merging and sorting","volume":"40","author":"Guan","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(92)90046-A_BIB6","series-title":"Proc. 1985 Internat. Conf. on Parallel Processing","first-page":"180","article-title":"The power of parallel prefix","author":"Kruskal","year":"1985"},{"key":"10.1016\/0167-8191(92)90046-A_BIB7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0167-8191(90)90142-V","article-title":"A parallel algorithm for finding congruent regions","volume":"13","author":"Shih","year":"1990","journal-title":"Parallel Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919290046A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919290046A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:27:04Z","timestamp":1551068824000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919290046A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":7,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["016781919290046A"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(92)90046-a","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}