{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:28:04Z","timestamp":1649147284136},"reference-count":22,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"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":8994,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0885-064x(88)90014-3","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:01:23Z","timestamp":1099764083000},"page":"330-355","source":"Crossref","is-referenced-by-count":2,"title":["VLSI-sorting evaluated under the linear model"],"prefix":"10.1016","volume":"4","author":[{"given":"H","family":"Schr\u00f6der","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(88)90014-3_BIB1","article-title":"The Area-Time Complexity of Sorting","author":"Bilardi","year":"1984"},{"issue":"No. 10","key":"10.1016\/0885-064X(88)90014-3_BIB2","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1109\/TC.1984.1676356","article-title":"External sorting in VLSI","volume":"C-33","author":"Bonuccelli","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0885-064X(88)90014-3_BIB3","series-title":"Proceedings, 13th Symposium on Theory of Computing","first-page":"318","article-title":"A model of computation for VLSI with related complexity results","author":"Chazelle","year":"1981"},{"issue":"No. 6","key":"10.1016\/0885-064X(88)90014-3_BIB4","first-page":"535","article-title":"Tight chip area bounds for sorting","volume":"4","author":"Duris","year":"1985","journal-title":"Comput. Artificial Intelligence (Czechoslovakia)"},{"issue":"No. 4","key":"10.1016\/0885-064X(88)90014-3_BIB5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1109\/TC.1985.5009391","article-title":"Parallel sorting with serial memories","volume":"C-34","author":"Ja'ja","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"No. 2","key":"10.1016\/0885-064X(88)90014-3_BIB6","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/329.332","article-title":"A parallel pipelined relational query processor","volume":"9","author":"Kim","year":"1984","journal-title":"ACM Trans. Database Sys."},{"key":"10.1016\/0885-064X(88)90014-3_BIB7","article-title":"The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/0885-064X(88)90014-3_BIB8","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TC.1983.1676217","article-title":"An efficient implementation of Batcher's oddeven merge algorithm and its application in parallel sorting schemes","volume":"C-32","author":"Kumar","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0885-064X(88)90014-3_BIB9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","article-title":"Why systolic architectures","volume":"15","author":"Kung","year":"1982","journal-title":"Computer Magazine"},{"key":"10.1016\/0885-064X(88)90014-3_BIB10","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TC.1985.1676603","article-title":"Systolic sorting on a mesh-connected network","volume":"C-34","author":"Lang","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0885-064X(88)90014-3_BIB11","series-title":"IEEE International Conference on Computer Design: VLSI in Computers","first-page":"735","article-title":"Impact and limitations of interconnect technology \u2026","author":"Mangir","year":"1983"},{"key":"10.1016\/0885-064X(88)90014-3_BIB12","article-title":"Datastructures and Algorithms. 1. Sorting and Searching","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0885-064X(88)90014-3_BIB13","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1147\/rd.272.0140","article-title":"A zero time VLSI sorter","author":"Miranker","year":"1983","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0885-064X(88)90014-3_BIB14","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TC.1979.1675216","article-title":"Bitonic sort on a mesh-connected parallel computer","volume":"C-28","author":"Nassimi","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"No. 5","key":"10.1016\/0885-064X(88)90014-3_BIB15","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected-cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"CACM"},{"key":"10.1016\/0885-064X(88)90014-3_BIB16","series-title":"IEEE International Conference on Computer Design: VLSI in Computers","article-title":"I\/O overlapped sorting schemes for VLSI","author":"Shin","year":"1983"},{"key":"10.1016\/0885-064X(88)90014-3_BIB17","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/359461.359481","article-title":"Sorting on a mesh-connected parallel computer","volume":"20","author":"Thompson","year":"1977","journal-title":"CACM"},{"key":"10.1016\/0885-064X(88)90014-3_BIB18","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/TC.1983.1676178","article-title":"The VLSI complexity of sorting","volume":"C-32","author":"Thompson","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0885-064X(88)90014-3_BIB19","series-title":"Proceedings, Conference on Advanced Research in VLSI","article-title":"On estimating the performance of VLSI circuits","author":"Thompson","year":"1984"},{"issue":"No. 5","key":"10.1016\/0885-064X(88)90014-3_BIB20","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1147\/rd.225.0509","article-title":"Algorithm and hardware for a merge sort using multiple processors","volume":"22","author":"Todd","year":"1978","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0885-064X(88)90014-3_BIB21","article-title":"Signal Propagation Delay, Wire Length Distribution and Efficiency of VLSI Circuits","author":"Vitanyi","year":"1984"},{"key":"10.1016\/0885-064X(88)90014-3_BIB22","article-title":"Signal Propagation Delay and the Efficiency of VLSI Circuits","author":"Vitanyi","year":"1984"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X88900143?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X88900143?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T09:22:53Z","timestamp":1549099373000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X88900143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0885064X88900143"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(88)90014-3","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}