{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:06:32Z","timestamp":1648915592661},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1016\/s0020-0190(01)00252-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:47:08Z","timestamp":1027601228000},"page":"311-316","source":"Crossref","is-referenced-by-count":0,"title":["A parallel algorithm for approximate regularity"],"prefix":"10.1016","volume":"80","author":[{"given":"Laurence","family":"Boxer","sequence":"first","affiliation":[]},{"given":"Russ","family":"Miller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00252-6_BIB001","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0167-8655(93)90128-Z","article-title":"Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices","volume":"14","author":"Boxer","year":"1993","journal-title":"Pattern Recognition Lett."},{"issue":"4","key":"10.1016\/S0020-0190(01)00252-6_BIB002","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."},{"key":"10.1016\/S0020-0190(01)00252-6_BIB003","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/0167-8655(91)90073-U","article-title":"Optimal algorithms for extracting spatial regularity in images","volume":"12","author":"Kahng","year":"1991","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0020-0190(01)00252-6_BIB004","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00252-6_BIB005","series-title":"Algorithms Sequential and Parallel","author":"Miller","year":"2000"},{"key":"10.1016\/S0020-0190(01)00252-6_BIB006","series-title":"Parallel Algorithms for Regular Architectures: Meshes and Pyramids","author":"Miller","year":"1996"},{"key":"10.1016\/S0020-0190(01)00252-6_BIB007","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0020-0190(99)00013-7","article-title":"On detecting spatial regularity in noisy images","volume":"69","author":"Robins","year":"1999","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002526?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002526?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T12:57:00Z","timestamp":1556197020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["S0020019001002526"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00252-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}