{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:45:54Z","timestamp":1761947154249},"reference-count":18,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":[[2002,12]]},"DOI":"10.1016\/s0020-0190(02)00317-4","type":"journal-article","created":{"date-parts":[[2002,11,4]],"date-time":"2002-11-04T20:06:14Z","timestamp":1036440374000},"page":"295-303","source":"Crossref","is-referenced-by-count":13,"title":["Parallel prefix computation on extended multi-mesh network"],"prefix":"10.1016","volume":"84","author":[{"given":"Prasanta K.","family":"Jana","sequence":"first","affiliation":[]},{"given":"B.","family":"Damodara Naidu","sequence":"additional","affiliation":[]},{"given":"Shailendra","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Monish","family":"Arora","sequence":"additional","affiliation":[]},{"given":"Bhabani P.","family":"Sinha","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00317-4_BIB001","series-title":"The Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"key":"10.1016\/S0020-0190(02)00317-4_BIB002","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/10637199308915441","article-title":"Optimal parallel prefix on mesh architecture","volume":"1","author":"Egecioglu","year":"1993","journal-title":"Parallel Algorithms Appl."},{"key":"10.1016\/S0020-0190(02)00317-4_BIB003","series-title":"An new network topology with multiple meshes, Tech. Rep. No. T\/Rep \/ E-94\/01","author":"De","year":"1994"},{"issue":"5","key":"10.1016\/S0020-0190(02)00317-4_BIB004","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1109\/12.769436","article-title":"A new network topology with multiple meshes","volume":"68","author":"Das","year":"1999","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10.1016\/S0020-0190(02)00317-4_BIB005","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1109\/12.628397","article-title":"An efficient sorting algorithm on multi-mesh network","volume":"46","author":"De","year":"1997","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(02)00317-4_BIB006","first-page":"334","article-title":"Faster optimal parallel prefix sum and list ranking","volume":"4","author":"Cole","year":"1989","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0190(02)00317-4_BIB007","series-title":"Proc. Internat. Conf. Parallel Process.","first-page":"278","article-title":"Parallel prefix on fully connected direct connection machines","author":"Krushkal","year":"1986"},{"key":"10.1016\/S0020-0190(02)00317-4_BIB008","series-title":"Parallel Computing Using the Prefix Problem","author":"Lakshivarahan","year":"1994"},{"key":"10.1016\/S0020-0190(02)00317-4_BIB009","series-title":"Proc. 3rd Int. Conf. on High Performance Computing (HiPC), Trivandrum, India, December 19\u201322, 1996","article-title":"Efficient parallel prefix algorithms on fully connected message passing computers","author":"Lin","year":"1996"},{"key":"10.1016\/S0020-0190(02)00317-4_BIB010","series-title":"Proc. 3rd ACM SIGPLAN Symp. Principles and Practice Parallel Programming","first-page":"1","article-title":"Optimal schedule for parallel prefix computation with bounded resources","author":"Nicolan","year":"1991"},{"key":"10.1016\/S0020-0190(02)00317-4_BIB011","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1147\/rd.182.0138","article-title":"Parallel solution of recurrence problems","author":"Kogge","year":"1974","journal-title":"IBM J. Res. Development"},{"key":"10.1016\/S0020-0190(02)00317-4_BIB012","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Lander","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00317-4_BIB013","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00127876","article-title":"Limited width parallel prefix circuits","volume":"4","author":"Carlson","year":"1990","journal-title":"J. Supercomput."},{"key":"10.1016\/S0020-0190(02)00317-4_BIB014","series-title":"Proc. 15th Symp. Theory of Computing","first-page":"100","article-title":"New bounds for parallel prefix circuits","author":"Fich","year":"1993"},{"key":"10.1016\/S0020-0190(02)00317-4_BIB015","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0196-6774(86)90003-9","article-title":"Depth-size trade-offs for parallel prefix computation","volume":"7","author":"Snir","year":"1986","journal-title":"J. Algorithms"},{"issue":"10","key":"10.1016\/S0020-0190(02)00317-4_BIB016","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","article-title":"The power of parallel prefix","volume":"C-34","author":"Krushkal","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(02)00317-4_BIB017","series-title":"Proc. 2nd Internat. Conf. on Information Technology, Bhubaneshwar, India, December 20\u201322, 1999","first-page":"203","article-title":"Finding polynomial zeros on a multi-mesh of trees (MMT)","author":"Jana","year":"1999"},{"key":"10.1016\/S0020-0190(02)00317-4_BIB018","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/50.933285","article-title":"A new architecture and a new metric for lightwave networks","volume":"19","author":"Sen","year":"2001","journal-title":"IEEE J. Lightwave Technology"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002003174?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002003174?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T02:55:45Z","timestamp":1554778545000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002003174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0020019002003174"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00317-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}