{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:03:55Z","timestamp":1648760635031},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":[[1990,1]]},"DOI":"10.1016\/0020-0190(90)90190-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"233-238","source":"Crossref","is-referenced-by-count":1,"title":["Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays"],"prefix":"10.1016","volume":"33","author":[{"given":"Yijie","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshihide","family":"Igarashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90190-9_BIB1","series-title":"Proc. 3rd Agean Workshop on Computing","first-page":"434","article-title":"Time lower bounds for sorting on a mesh-connected processor array","volume":"319","author":"Han","year":"1988"},{"key":"10.1016\/0020-0190(90)90190-9_BIB2","series-title":"Techn. Report TR 107-88","article-title":"Time lower bonds for parallel sorting on multi-dimensional mesh-connected processor arrays","author":"Han","year":"1988"},{"key":"10.1016\/0020-0190(90)90190-9_BIB3","series-title":"Techn. Report TR 114-88","article-title":"Indexing functions and time lower bounds for sorting on a mesh-connected computer","author":"Han","year":"1988"},{"key":"10.1016\/0020-0190(90)90190-9_BIB4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF00264359","article-title":"Lower bounds for sorting on mesh-connected architectures","volume":"24","author":"Kunde","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(90)90190-9_BIB5","series-title":"Proc. 4th Symp. on Theoretical Aspects on Comput. Sci.","first-page":"408","article-title":"Optimal sorting on multi-dimensionally mesh-connected computers","volume":"247","author":"Kunde","year":"1987"},{"key":"10.1016\/0020-0190(90)90190-9_BIB6","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TC.1985.1676603","article-title":"Systolic sorting on a mesh-connected network","volume":"34","author":"Lang","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(90)90190-9_BIB7","first-page":"255","article-title":"The distance bound for sorting on mesh-connected processor arrays is tight","author":"Ma","year":"1986","journal-title":"Proc. 27th IEEE Symp. on Foundations of Comput. Sci."},{"key":"10.1016\/0020-0190(90)90190-9_BIB8","series-title":"Applied Combinatorics","author":"Roberts","year":"1984"},{"key":"10.1016\/0020-0190(90)90190-9_BIB9","first-page":"41","article-title":"A divide-and-conquer method of the parallel sort","author":"Sado","year":"1985","journal-title":"IECE of Japan, Techn. Commit. of Automata and Languages AL84-68"},{"key":"10.1016\/0020-0190(90)90190-9_BIB10","first-page":"255","article-title":"An optimal sorting algorithm for mesh-connected computers","author":"Schnorr","year":"1986","journal-title":"Proc. 18th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(90)90190-9_BIB11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/359461.359481","article-title":"Sorting on a mesh-connected parallel computer","volume":"20","author":"Thompson","year":"1977","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090901909?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090901909?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:58:14Z","timestamp":1555073894000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019090901909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["0020019090901909"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90190-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}