{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:51Z","timestamp":1725664971954},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631385"},{"type":"electronic","value":"9783540691570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63138-0_3","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:07:46Z","timestamp":1330297666000},"page":"25-36","source":"Crossref","is-referenced-by-count":6,"title":["Practical parallel list ranking"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]},{"given":"Frank","family":"Guillaume","sequence":"additional","affiliation":[]},{"given":"Tillmann","family":"Seidel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/BF01759076","volume":"6","author":"R.J. Anderson","year":"1991","unstructured":"Anderson, R.J., G.L. Miller, \u2018Deterministic Par. List Ranking,\u2019 Algorithmica, 6, pp. 859\u2013868, 1991.","journal-title":"Algorithmica"},{"key":"3_CR2","doi-asserted-by":"crossref","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":"3_CR3","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":"3_CR4","doi-asserted-by":"crossref","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 IPL, 32, pp. 305\u2013311, 1989.","journal-title":"IPL"},{"key":"3_CR5","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 Chemoff Bounds,\u2019 IPL, 33, 305\u2013308, 1990.","journal-title":"IPL"},{"key":"3_CR6","unstructured":"J\u00e1J\u00e1, J., An Introduction to Parallel Algorithms, Addison-Wesley Publishing Company. Inc., 1992."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Juurlink, B., P.S. Rao, J.F. Sibeyn, \u2018Gossiping on Meshes and Tori,\u2019 Proc. 2nd Euro-Par Conference, LNCS 1123, pp. 361\u2013369, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61626-8_47"},{"key":"3_CR8","unstructured":"McCalpin, J.D., \u2018Memory Bandwidth and Machine Balance in Current High Performance Computers,\u2019 IEEE Technical Committee on Computer Architecture Newsletter, pp. 19\u201325, 12-1995."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Reid-Miller, M., \u2018List Ranking and List Scan on the Cray C-90,\u2019 Proc. 6th Symposium on Parallel Algorithms and Architectures, pp. 104\u2013113, ACM, 1994.","DOI":"10.1145\/181014.181049"},{"key":"3_CR10","unstructured":"Reid-Miller, M., G.L. Miller, F. Modugno, \u2018List-Ranking and Parallel Tree Contraction,\u2019 in Synthesis of Parallel Algorithms, J. Reif (ed), pp. 115\u2013194, Morgan Kaufmann, 1993."},{"issue":"No.1","key":"3_CR11","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 Trans. on Parallel and Distributed Systems, Vol. 1, No. 1, pp. 83\u201390, 1990.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F., \u2018List Ranking on Interconnection Networks,\u2019 Proc. 2nd Euro-Par Conference, LNCS 1123, pp. 799\u2013808, Springer-Verlag, 1996. Full version in Technical Report 11\/1995, SFB 124-D6, Universit\u00e4t Saarbr\u00fccken, Saarbr\u00fccken, Germany, 1995.","DOI":"10.1007\/3-540-61626-8_104"}],"container-title":["Lecture Notes in Computer Science","Solving Irregularly Structured Problems in Parallel"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63138-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:53Z","timestamp":1605647753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63138-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631385","9783540691570"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-63138-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}