{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:04:59Z","timestamp":1648710299262},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0890-5401(02)00029-9","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T10:38:35Z","timestamp":1046774315000},"page":"75-87","source":"Crossref","is-referenced-by-count":1,"title":["List-ranking on interconnection networks"],"prefix":"10.1016","volume":"181","author":[{"given":"Jop F","family":"Sibeyn","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(02)00029-9_BIB1","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/BF01759076","article-title":"Deterministic parallel list ranking","volume":"6","author":"Anderson","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB2","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/S0019-9958(86)80046-8","article-title":"Solving tree problems on a mesh-connected processor array","volume":"69","author":"Atallah","year":"1986","journal-title":"Information and Control"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB3","series-title":"Proceedings 18th Symposium on Principles of Distributed Computing","first-page":"272","article-title":"Continuous routing and batch routing on the hypercube","author":"Chang","year":"1986"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB4","series-title":"Proceedings 18th Symposium on Theory of Computing","first-page":"206","article-title":"Deterministic coin tossing and accelerated cascades: micro and macro techniques for designing parallel algorithms","author":"Cole","year":"1986"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB5","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(89)90023-9","article-title":"A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation","volume":"32","author":"Gibbons","year":"1989","journal-title":"Information Processing Letters"},{"issue":"2","key":"10.1016\/S0890-5401(02)00029-9_BIB7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(96)00034-5","article-title":"Efficient massively parallel implementation of some combinatorial algorithms","volume":"162","author":"Hsu","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB8","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB9","series-title":"Proceedings 5th Symposium on Discrete Algorithms","first-page":"669","article-title":"Derandomizing routing and sorting algorithms for meshes","author":"Kaufmann","year":"1994"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB10","series-title":"Proceedings European Symposium on Algorithms","first-page":"272","article-title":"Block gossiping on grids and tori: deterministic sorting and routing match the bisection bound","volume":"726","author":"Kunde","year":"1993"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB11","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB12","series-title":"Surveys in combinatorics","first-page":"148","article-title":"On the method of bounded differences","volume":"141","author":"McDiarmid","year":"1989"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB13","series-title":"Proceedings of 5th High Performance Computing","article-title":"A Simple Optimal List Ranking Algorithm","author":"Ranade","year":"1998"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01758834","article-title":"Optimal routing algorithms for mesh-connected processor arrays","volume":"8","author":"Rajasekaran","year":"1992","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/S0890-5401(02)00029-9_BIB15","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1006\/jcss.1996.0074","article-title":"List ranking and list scan on the Cray C-90","volume":"53","author":"Reid-Miller","year":"1996","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"10.1016\/S0890-5401(02)00029-9_BIB16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/71.80127","article-title":"Efficient algorithms for list ranking and for solving graph problems on the hypercube","volume":"1","author":"Ryu","year":"1990","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB17","unstructured":"T. Seidel, Paralleles list ranking, Masters thesis (in German), Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 1997"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB18","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s002360050131","article-title":"List ranking on meshes","volume":"35","author":"Sibeyn","year":"1998","journal-title":"Acta Informatica"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB19","series-title":"Proceedings 6th Conference on High Performance Computing","first-page":"197","article-title":"Ultimate parallel list ranking?","volume":"1745","author":"Sibeyn","year":"1999"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB20","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1006\/jpdc.1998.1508","article-title":"Practical parallel list ranking","volume":"56","author":"Sibeyn","year":"1999","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"8","key":"10.1016\/S0890-5401(02)00029-9_BIB21","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","article-title":"A bridging model for parallel computation","volume":"33","author":"Valiant","year":"1990","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0890-5401(02)00029-9_BIB22","series-title":"Proceedings 13th Symposium on Theory of Computing","first-page":"263","article-title":"Universal schemes for parallel communication","author":"Valiant","year":"1981"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000299?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000299?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T08:56:05Z","timestamp":1553763365000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540102000299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0890540102000299"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(02)00029-9","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}