{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:34Z","timestamp":1725664534613},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616269"},{"type":"electronic","value":"9783540706335"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61626-8_104","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:04:06Z","timestamp":1330275846000},"page":"799-808","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["List ranking on interconnection networks"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"104_CR1","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/BF01759076","volume":"6","author":"R.J. Anderson","year":"1991","unstructured":"Anderson, R.J., G.L. Miller, \u2018Deterministic Parallel List Ranking,\u2019 Algorithmica 6 pp. 859\u2013868, 1991.","journal-title":"Algorithmica"},{"key":"104_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/S0019-9958(86)80046-8","volume":"69","author":"M.J. Atallah","year":"1986","unstructured":"Atallah, M.J., S.E. Hambrusch, \u2018Solving Tree Problems on a Mesh-Connected Processor Array,\u2019 Information and Control, 69, pp. 168\u2013187, 1986.","journal-title":"Information and Control"},{"key":"104_CR3","doi-asserted-by":"crossref","unstructured":"Chang, Y., J. Simon, \u2018Continuous Routing and Batch Routing on the Hypercube,\u2019 Proc. 18th Symp. on Theory of Computing, pp. 272\u2013281, ACM, 1986.","DOI":"10.1145\/10590.10614"},{"key":"104_CR4","doi-asserted-by":"crossref","unstructured":"Cole, R., U. Vishkin, \u2018Deterministic Coin Tossing and Accelerated Cascades: Micro and Macro Techniques for Designing Parallel Algorithms,\u2019 Proc. 18th Symp. on Theory of Computing, pp. 206\u2013219, ACM, 1986.","DOI":"10.1145\/12130.12151"},{"key":"104_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(89)90023-9","volume":"32","author":"A.M. Gibbons","year":"1989","unstructured":"Gibbons, A.M., Y. N. Srikant, \u2018A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation,\u2019 Information Processing Letters, 32, pp. 305\u2013311, 1989.","journal-title":"Information Processing Letters"},{"key":"104_CR6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1990","unstructured":"Hagerup, T., C. R\u00fcb, \u2018A Guided Tour of Chernoff Bounds,\u2019 Information Processing Letters, 33, 305\u2013308, 1990.","journal-title":"Information Processing Letters"},{"key":"104_CR7","unstructured":"Hwang, K., Advanced Computer Architecture; Parallelism, Scalability, Programmability, McGraw-Hill, Inc., 1993."},{"key":"104_CR8","unstructured":"J\u00e1J\u00e1, J., An Introduction to Parallel Algorithms, Addison-Wesley Publishing Company, Inc., 1992."},{"key":"104_CR9","unstructured":"Kaufmann, M., J.F. Sibeyn, T. Suel, \u2018Derandomizing Routing and Sorting Algorithms for Meshes,\u2019 Proc. 5th Symp. on Discrete Algorithms, pp. 669\u2013679, ACM-SIAM, 1994."},{"key":"104_CR10","doi-asserted-by":"crossref","unstructured":"Kunde, M., \u2018Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound,\u2019 Proc. European Symp. on Algorithms, LNCS 726, pp. 272\u2013283, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57273-2_62"},{"key":"104_CR11","doi-asserted-by":"crossref","unstructured":"McDiarmid, C., \u2018On the Method of Bounded Differences,\u2019 in Surveys in Combinatorics, J. Siemons, editor, 1989 London Mathematical Society Lecture Note Series 141, pp. 148\u2013188, Cambridge University Press, 1989.","DOI":"10.1017\/CBO9781107359949.008"},{"key":"104_CR12","doi-asserted-by":"crossref","unstructured":"Reid-Miller, M., \u2018List Ranking and List Scan on the Cray C-90,\u2019 Proc. 6th Symp. on Parallel Algorithms and Architectures, pp. 104\u2013113, ACM, 1994.","DOI":"10.1145\/181014.181049"},{"issue":"1","key":"104_CR13","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/7531.7532","volume":"34","author":"J. Reif","year":"1987","unstructured":"Reif, J., L.G. Valiant, \u2018A logarithmic time sort for linear size networks,\u2019 Journal of the ACM, 34(1), pp. 68\u201376, 1987.","journal-title":"Journal of the ACM"},{"key":"104_CR14","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1137\/0214030","volume":"14","author":"R. Reischuk","year":"1985","unstructured":"Reischuk, R., \u2018Probabilistic Parallel Algorithms for Sorting and Selection,\u2019 SIAM Journal of Computing, 14, pp. 396\u2013411, 1985.","journal-title":"SIAM Journal of Computing"},{"issue":"No.1","key":"104_CR15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/71.80127","volume":"1","author":"K.W. Ryu","year":"1990","unstructured":"Ryu, K.W., J. J\u00e1J\u00e1, \u2018Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube,\u2019 IEEE Transactions on Parallel and Distributed Systems,Vol. 1, No. 1, pp. 83\u201390, 1990.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"104_CR16","volume-title":"Techn. Rep. 11\/1995, SFB 124-D6","author":"J.F. Sibeyn","year":"1995","unstructured":"Sibeyn, J.F., \u2018List Ranking on Interconnection Networks,\u2019 Techn. Rep. 11\/1995, SFB 124-D6, Universit\u00e4t Saarbr\u00fccken, Saarbr\u00fccken, Germany, 1995. Preliminary version in Proc. Computing Science in the Netherlands, pp. 271\u2013280, SION, Amsterdam, 1994. Submitted to Acta Informatica."},{"issue":"8","key":"104_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"Valiant, L.G., \u2018A Bridging Model for Parallel Computation,\u2019 Communications of the ACM, 33(8), pp. 103\u2013111, 1990.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61626-8_104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:21:46Z","timestamp":1587327706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61626-8_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616269","9783540706335"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61626-8_104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}