{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:52:24Z","timestamp":1743083544915,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":11,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_592","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:20Z","timestamp":1461269000000},"page":"1117-1121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["List Ranking"],"prefix":"10.1007","author":[{"given":"Riko","family":"Jacob","sequence":"first","affiliation":[]},{"given":"Ulrich","family":"Meyer","sequence":"additional","affiliation":[]},{"given":"Laura","family":"Toma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"691_CR12246","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-02094-0_1","volume-title":"Algorithmics of large and complex networks","author":"D Ajwani","year":"2009","unstructured":"Ajwani D, Meyer U (2009) Design and engineering of external memory traversal algorithms for general graphs. In: Lerner J, Wagner D, Zweig KA (eds) Algorithmics of large and complex networks. Springer, Berlin\/Heidelberg, pp\u00a01\u201333"},{"key":"691_CR12247","doi-asserted-by":"crossref","unstructured":"Arge L, Goodrich M, Nelson M, Sitchinava N (2008) Fundamental parallel algorithms for private-cache chip multiprocessors. In: SPAA 2008, pp\u00a0197\u2013206","DOI":"10.1145\/1378533.1378573"},{"key":"691_CR12248","doi-asserted-by":"crossref","unstructured":"Arge L, Goodrich M, Sitchinava N (2010) Parallel external memory graph algorithms. In: IPDPS. IEEE, pp\u00a01\u201311. \n http:\/\/dx.doi.org\/10.1109\/IPDPS.2010.5470440","DOI":"10.1109\/IPDPS.2010.5470440"},{"key":"691_CR12249","unstructured":"Chiang Y, Goodrich M, Grove E, Tamassia R, Vengroff D, Vitter J (1995) External memory graph algorithms. In: Proceedings of the 6th annual symposium on discrete algorithms (SODA), San Francisco, pp\u00a0139\u2013149"},{"issue":"1","key":"691_CR12250","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R Cole","year":"1986","unstructured":"Cole R, Vishkin U (1986) Deterministic coin tossing with applications to optimal parallel list ranking. Inf Control 70(1):32\u201353","journal-title":"Inf Control"},{"issue":"6","key":"691_CR12251","first-page":"589","volume":"38","author":"R Dementiev","year":"2008","unstructured":"Dementiev R, Kettner L, Sanders P (2008) STXXL: standard template library for XXL data sets. Software: Pract Exp 38(6):589\u2013637","journal-title":"Software: Pract Exp"},{"key":"691_CR12252","unstructured":"Greiner G (2012) Sparse matrix computations and their I\/O complexity. Dissertation, Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen. \n http:\/\/nbn-resolving.de\/urn\/resolver.pl?urn:nbn:de:bvb:91-diss-20121123-1113167-0-6"},{"key":"691_CR12253","doi-asserted-by":"crossref","unstructured":"Jacob R, Lieber T, Sitchinava N (2014) On the complexity of list ranking in the parallel external memory model. In: Proceedings 39th international symposium on mathematical foundations of computer science (MFCS\u201914), Budapest. LNCS, vol\u00a08635. Springer, pp\u00a0384\u2013395","DOI":"10.1007\/978-3-662-44465-8_33"},{"key":"691_CR12254","volume-title":"An introduction to parallel algorithms","author":"J J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1 J (1992) An introduction to parallel algorithms. Addison-Wesley, Reading"},{"key":"691_CR12255","doi-asserted-by":"crossref","unstructured":"Sibeyn J (2004) External connected components. In: Proceedings of the 9th Scandinavian workshop on algorithm theory (SWAT), Lecture Notes in Computer Science, vol\u00a03111. Humlebaek, pp 468\u2013479. \n http:\/\/link.springer.com\/chapter\/10.1007\/978-3-540-27810-8_40","DOI":"10.1007\/978-3-540-27810-8_40"},{"key":"691_CR12256","unstructured":"Zeh N (2002) I\/O-efficient algorithms for shortest path related problems. Phd thesis, School of Computer Science, Carleton University"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:25:50Z","timestamp":1553095550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_592","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}