{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:06:01Z","timestamp":1743023161336,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425120"},{"type":"electronic","value":"9783540446910"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-44691-5_10","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T22:32:07Z","timestamp":1180823527000},"page":"111-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Portable List Ranking: An Experimental Study"],"prefix":"10.1007","author":[{"given":"Isabelle","family":"Gu\u00e9rin Lassous","sequence":"first","affiliation":[]},{"given":"Jens","family":"Gustedt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/3-540-63165-8_195","volume-title":"Automata, Languages and Programming","author":"E. Caceres","year":"1997","unstructured":"Caceres, E., Dehne, F., Ferreira, A., Flocchini, P., Rieping, I., Roncato, A., Santoro, N., and Song, S. W. (1997). Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Degano, P., Gorrieri, R., and Marchetti-Spaccamela, A., editors, Automata, Languages and Programming, volume 1256 of Lecture Notes in Comp. Sci., pages 390\u2013400. Springer-Verlag. Proceedings of the 24th International Colloquium ICALP\u201997."},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0890-5401(89)90036-9","volume":"81","author":"R. Cole","year":"1989","unstructured":"Cole, R. and Vishkin, U. (1989). Faster optimal prefix sums and list ranking. Information and Computation, 81(3):128\u2013142.","journal-title":"Information and Computation"},{"issue":"3","key":"10_CR3","first-page":"379","volume":"6","author":"F. Dehne","year":"1996","unstructured":"Dehne, F., Fabri, A., and Rau-Chaplin, A. (1996). Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379\u2013400.","journal-title":"International Journal on Computational Geometry"},{"key":"10_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0027774","volume-title":"Concurrency and Parallelism, Programming, Networking, and Security","author":"F. Dehne","year":"1996","unstructured":"Dehne, F. and Song, S. W. (1996). Randomized parallel list ranking for distributed memory multiprocessors. In Jaffar, J. and Yap, R. H. C., editors, Concurrency and Parallelism, Programming, Networking, and Security, volume 1179 of Lecture Notes in Comp. Sci., pages 1\u201310. Springer-Verlag. Proceedings of the Asian Computer Science Conference (ASIAN\u2019 96)."},{"key":"10_CR5","unstructured":"Gu\u00e9rin Lassous, I., Gustedt, J., and Morvan, M. (2000). Feasibility, portability, predictability and efficiency: Four ambitious goals for the design and implementation of parallel coarse grained graph algorithms. Technical Report 3885, INRIA."},{"key":"10_CR6","unstructured":"Gu\u00e9rin Lassous, I. and Gustedt, J. (1999). List ranking on a coarse grained multiprocessor. Technical Report RR-3640, INRIA."},{"key":"10_CR7","unstructured":"Gu\u00e9rin Lassous, I. and Gustedt, J. (2000). List ranking on pc clusters. Technical Report RR-3869, INRIA Lorraine. \nhttp:\/\/www.inria.fr\/RRRT\/publications-fra.html\n\n."},{"key":"10_CR8","unstructured":"J\u00e1j\u00e1, J. (1992). An Introduction to Parallel Algorithms. Addison Wesley."},{"key":"10_CR9","first-page":"869","volume-title":"Handbook of Theoretical Computer Science, volume A","author":"R. M. Karp","year":"1990","unstructured":"Karp, R. M. and Ramachandran, V. (1990). Parallel Algorithms for Shared-Memory Machines. In van Leeuwen, J., editor, Handbook of Theoretical Computer Science, volume A, Algorithms and Complexity, pages 869\u2013941. Elsevier Science Publishers B.V., Amsterdam."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Reid-Miller, M. (1994). List ranking and list scan on the Cray C-90. In Proc. ACM Symp. on Parallel Algorithms and Architectures, pages 104\u2013113.","DOI":"10.1145\/181014.181049"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1006\/jpdc.1998.1508","volume":"56","author":"J. F. Sibeyn","year":"1999","unstructured":"Sibeyn, J. F., Guillaume, F., and Seidel, T. (1999). Practical Parallel List Ranking. Journal of Parallel and Distributed Computing, 56:156\u2013180.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Sibeyn, J. (1997). Better trade-offs for parallel list ranking. In Proc. of 9th ACM Symposium on Parallel Algorithms and Architectures, pages 221\u2013230.","DOI":"10.1145\/258492.258514"},{"issue":"8","key":"10_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. G. Valiant","year":"1990","unstructured":"Valiant, L. G. (1990). A bridging model for parallel computation. Communications of the ACM, 33(8):103\u2013111.","journal-title":"Communications of the ACM"},{"key":"10_CR14","unstructured":"Wyllie, J. C. (1979). The Complexity of Parallel Computations. PhD thesis, Computer Science Department, Cornell University."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44691-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T13:03:57Z","timestamp":1588165437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44691-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425120","9783540446910"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44691-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"24 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}