{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:09:02Z","timestamp":1649095742508},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"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":[[1993,4]]},"DOI":"10.1016\/0020-0190(93)90193-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"31-36","source":"Crossref","is-referenced-by-count":1,"title":["Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors"],"prefix":"10.1016","volume":"46","author":[{"given":"Ramachandran","family":"Vaidyanathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos R.P.","family":"Hartmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pramod K.","family":"Varshney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90193-D_BIB1","first-page":"65","article-title":"The structure of parallel algorithms","volume":"19","author":"Kung","year":"1980"},{"key":"10.1016\/0020-0190(93)90193-D_BIB2","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":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90193-D_BIB3_1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1109\/12.21149","article-title":"The De Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI","volume":"38","author":"Samantham","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(93)90193-D_BIB3_2","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/12.67330","article-title":"The De Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI","volume":"40","author":"Samantham","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(93)90193-D_BIB4","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/TC.1983.1676178","article-title":"The VLSI complexity of sorting","volume":"32","author":"Thompson","year":"1983","journal-title":"IEEE Trans. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390193D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390193D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:26:57Z","timestamp":1555144017000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390193D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["002001909390193D"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90193-d","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}