{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:21:02Z","timestamp":1649172062895},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7777,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0166-218x(92)90228-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"141-152","source":"Crossref","is-referenced-by-count":2,"title":["Indexing functions and time lower bounds for sorting on a mesh-connected computer"],"prefix":"10.1016","volume":"36","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"}]},{"given":"Miroslaw","family":"Truszczynski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90228-3_BIB1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/BF00288975","article-title":"Time lower bounds for sorting on a mesh-connected processor array","volume":"26","author":"Han","year":"1989","journal-title":"Acta Inform."},{"key":"10.1016\/0166-218X(92)90228-3_BIB2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0020-0190(90)90190-9","article-title":"Time lower bounds for parallel sorting on multidimensional mesh-connected processor arrays","volume":"33","author":"Han","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(92)90228-3_BIB3","series-title":"Tech. Rept. 163-190","article-title":"A new limit for the power of the Chain Theorem","author":"Han","year":"1990"},{"key":"10.1016\/0166-218X(92)90228-3_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\/0166-218X(92)90228-3_BIB5","series-title":"Proceedings 4th Symposium on Theoretical Aspects of Computer Science","first-page":"408","article-title":"Optimal sorting on multi-dimensionally mesh-connected computers","volume":"247","author":"Kunde","year":"1987"},{"key":"10.1016\/0166-218X(92)90228-3_BIB6","series-title":"Proceedings 4th Symposium on Theoretical Aspects of Computer Science","first-page":"298","article-title":"Bounds for 1-selection and related problems on grids of processors","volume":"342","author":"Kunde","year":"1988"},{"key":"10.1016\/0166-218X(92)90228-3_BIB7","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\/0166-218X(92)90228-3_BIB8","series-title":"Proceedings 27th Symposium on Foundations of Computer Science","first-page":"255","article-title":"The distance bound for sorting on mesh-connected processor arrays is tight","author":"Ma","year":"1986"},{"key":"10.1016\/0166-218X(92)90228-3_BIB9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TC.1979.1675216","article-title":"Bitonic sort on a mesh-connected parallel computer","volume":"27","author":"Nassimi","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90228-3_BIB10","first-page":"41","article-title":"A divide-and-conquer method of the parallel sort","author":"Sado","year":"1984","journal-title":"Tech. Commit. of Automata and Languages"},{"key":"10.1016\/0166-218X(92)90228-3_BIB11","first-page":"21","article-title":"A fast pseudo-merge sorting algorithm","author":"Sado","year":"1985","journal-title":"Tech. Commit. of Automata and Languages"},{"key":"10.1016\/0166-218X(92)90228-3_BIB12","series-title":"Proceedings of Japan-U.S. Joint Seminar","first-page":"161","article-title":"Fast parallel sorting on a mesh-connected processor array","author":"Sado","year":"1986"},{"key":"10.1016\/0166-218X(92)90228-3_BIB13","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0743-7315(86)90023-7","article-title":"Some parallel sorts on a mesh-connected processor array","volume":"3","author":"Sado","year":"1986","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0166-218X(92)90228-3_BIB14","first-page":"903","article-title":"Shear sort: A true two-dimensional sorting technique for VLSI networks","author":"Scherson","year":"1986","journal-title":"Proceedings 1986 International Conference on Parallel Processing"},{"key":"10.1016\/0166-218X(92)90228-3_BIB15","first-page":"255","article-title":"An optimal sorting algorithm for mesh-connected computers","author":"Schnorr","year":"1986","journal-title":"Proceedings 18th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(92)90228-3_BIB16","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":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92902283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92902283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:58Z","timestamp":1555136578000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92902283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["0166218X92902283"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90228-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}