{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T13:50:17Z","timestamp":1649166617059},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,2,12]],"date-time":"2013-02-12T00:00:00Z","timestamp":1360627200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s00287-013-0683-2","type":"journal-article","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T03:49:50Z","timestamp":1360554590000},"page":"174-179","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmenbibliotheken"],"prefix":"10.1007","volume":"36","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,12]]},"reference":[{"issue":"8","key":"683_CR1","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/j.comgeo.2010.04.008","volume":"43","author":"VHF Batista","year":"2010","unstructured":"Batista VHF, Millman DL, Pion S, Singler J (2010) Parallel geometric algorithms for multi-core computers. Comput Geom 43(8):663\u2013677","journal-title":"Comput Geom"},{"key":"683_CR2","doi-asserted-by":"crossref","unstructured":"Beckmann A, Dementiev R, Singler J (2009) Building a parallel pipelined external memory algorithm library. In: 23rd IEEE International Symposium on Parallel and Distributed Processing, Rom, 25.\u201329.5.2009, pp 1\u201310","DOI":"10.1109\/IPDPS.2009.5161001"},{"key":"683_CR3","unstructured":"Dementiev R (2006) Algorithm engineering for large data sets. Doktorarbeit, Universit\u00e4t des Saarlandes"},{"key":"683_CR4","doi-asserted-by":"crossref","unstructured":"Dementiev R, K\u00e4rkk\u00e4inen J, Mehnert J, Sanders P (2008) Better external memory suffix array construction. ACM J Exper Algorithm 12. Special issue on Alenex 2005, online article","DOI":"10.1145\/1227161.1402296"},{"key":"683_CR5","doi-asserted-by":"crossref","unstructured":"Dementiev R, Kettner L, Sanders P (2008) STXXL: Standard Template Library for XXL data sets. Software Pract Exper 38(6):589\u2013637","DOI":"10.1002\/spe.844"},{"key":"683_CR6","doi-asserted-by":"crossref","unstructured":"Dementiev R, Sanders P, Schultes D, Sibeyn J (2004) Engineering an external memory minimum spanning tree algorithm. In: IFIP TCS, Toulouse, pp 195\u2013208","DOI":"10.1007\/1-4020-8141-3_17"},{"key":"683_CR7","doi-asserted-by":"crossref","unstructured":"Dementiev R, Singler J (2010) Libraries. In: M\u00fcller-Hannemann M, Schirra S (eds) Algorithm Engineering, LNCS, vol 5971, Springer, pp 290\u2013324","DOI":"10.1007\/978-3-642-14866-8_7"},{"key":"683_CR8","unstructured":"Frias L, Singler J (2007) Parallelization of bulk operations for STL dictionaries. In: Euro-Par Workshops, LNCS, vol. 4854, Springer, pp 49\u201358"},{"key":"683_CR9","unstructured":"Mehlhorn K, N\u00e4her S (1999) The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press"},{"key":"683_CR10","doi-asserted-by":"crossref","unstructured":"Osipov V, Sanders P, Schulz C (2012) Engineering graph partitioning algorithms. In: 11th International Symposium on Experimental Algorithms (SEA), LNCS, vol. 7276, Springer, pp 18\u201326","DOI":"10.1007\/978-3-642-30850-5_3"},{"key":"683_CR11","doi-asserted-by":"crossref","unstructured":"Osipov V, Sanders P, Singler J (2009) The filter-Kruskal minimum spanning tree algorithm. In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX), New York, 3.1.2009, pp 52\u201361","DOI":"10.1137\/1.9781611972894.5"},{"issue":"12","key":"683_CR12","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.parco.2009.09.001","volume":"35","author":"P Sanders","year":"2009","unstructured":"Sanders P, Speck J, Tr\u00e4ff JL (2009) Two-tree algorithms for full bandwidth broadcast, reduction and scan. Parallel Comput 35(12):581\u2013594","journal-title":"Parallel Comput"},{"key":"683_CR13","unstructured":"Sanders P, Tr\u00e4ff JL (2002) The factor algorithm for regular all-to-all communication on clusters of SMP nodes. In: 8th Euro-Par, LNCS, vol 2400, Springer, pp 799\u2013803"},{"key":"683_CR14","doi-asserted-by":"crossref","unstructured":"Sanders P, Tr\u00e4ff JL (2006) Parallel prefix (scan) algorithms for MPI. In: Recent Advances in Parallel Virtual Machine and Message Passing Interface. 13th European PVM\/MPI Users\u2019 Group Meeting, LNCS, vol 4192, Springer, pp 49\u201357","DOI":"10.1007\/11846802_15"},{"key":"683_CR15","unstructured":"Singler J (2010) Algorithm libraries for multi-core processors. Doktorarbeit, Universit\u00e4t Karlsruhe"},{"key":"683_CR16","doi-asserted-by":"crossref","unstructured":"Singler J, Kosnik B (2008) The libstdc++ parallel mode: software engineering considerations. In: International Workshop on Multicore Software Engineering (IWMSE), Leipzig, 11.5.2008","DOI":"10.1145\/1370082.1370089"},{"key":"683_CR17","doi-asserted-by":"crossref","unstructured":"Singler J, Sanders P, Putze F (2007) MCSTL: The multi-core standard template library. In: 13th International Euro-Par Conference, LNCS, vol 4641, Springer, pp 682\u2013694","DOI":"10.1007\/978-3-540-74466-5_72"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0683-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-013-0683-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0683-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T11:04:37Z","timestamp":1562670277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-013-0683-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,12]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["683"],"URL":"https:\/\/doi.org\/10.1007\/s00287-013-0683-2","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"value":"0170-6012","type":"print"},{"value":"1432-122X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,12]]}}}