{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:28:01Z","timestamp":1742387281864},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_15","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"169-180","source":"Crossref","is-referenced-by-count":14,"title":["Parallel String Sample Sort"],"prefix":"10.1007","author":[{"given":"Timo","family":"Bingmann","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Akiba, T.: Parallel string radix sort in C++ (2011), \n                  \n                    http:\/\/github.com\/iwiwi\/parallel-string-radix-sort\n                  \n                  \n                 (git repository accessed November 2012)"},{"key":"15_CR2","unstructured":"Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: ACM 8th Symposium on Discrete Algorithms, pp. 360\u2013369 (1997)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bingmann, T., Sanders, P.: Parallel string sample sort. Tech. rep. (May 2013), see ArXiv e-print arXiv:1305.1157","DOI":"10.1007\/978-3-642-40450-4_15"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Leiserson, C.E., Maggs, B.M., Plaxton, C.G., Smith, S.J., Zagha, M.: A comparison of sorting algorithms for the connection machine CM-2. In: 3rd Symposium on Parallel Algorithms and Architectures. pp. 3\u201316 (1991)","DOI":"10.1145\/113379.113380"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/195058.195202","volume-title":"Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, STOC 1994","author":"T. Hagerup","year":"1994","unstructured":"Hagerup, T.: Optimal parallel string algorithms: sorting, merging and computing the minimum. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 382\u2013391. ACM, New York (1994)"},{"key":"15_CR6","unstructured":"Kn\u00f6pfle, S.D.: String samplesort, bachelor Thesis, Karlsruhe Institute of Technology (November 2012) (in German)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-89097-3_3","volume-title":"String Processing and Information Retrieval","author":"J. K\u00e4rkk\u00e4inen","year":"2008","unstructured":"K\u00e4rkk\u00e4inen, J., Rantala, T.: Engineering radix sort for strings. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 3\u201314. Springer, Heidelberg (2008)"},{"issue":"1","key":"15_CR8","first-page":"5","volume":"6","author":"P.M. McIlroy","year":"1993","unstructured":"McIlroy, P.M., Bostic, K., McIlroy, M.D.: Engineering radix sort. Computing Systems\u00a06(1), 5\u201327 (1993)","journal-title":"Computing Systems"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00453-002-0993-2","volume":"35","author":"K. Mehlhorn","year":"2003","unstructured":"Mehlhorn, K., Sanders, P.: Scanning multiple sequences via cache memory. Algorithmica\u00a035(1), 75\u201393 (2003)","journal-title":"Algorithmica"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Ng, W., Kakehi, K.: Cache efficient radix sort for string sorting. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E90-A(2), 457\u2013466 (2007)","DOI":"10.1093\/ietfec\/e90-a.2.457"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.2197\/ipsjdc.4.69","volume":"4","author":"W. Ng","year":"2008","unstructured":"Ng, W., Kakehi, K.: Merging string sequences by longest common prefixes. IPSJ Digital Courier\u00a04, 69\u201378 (2008)","journal-title":"IPSJ Digital Courier"},{"key":"15_CR12","unstructured":"Rantala, T.: Library of string sorting algorithms in C++ (2007), \n                  \n                    http:\/\/github.com\/rantala\/string-sorting\n                  \n                  \n                 (git repository accessed November 2012)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/978-3-540-30140-0_69","volume-title":"Algorithms \u2013 ESA 2004","author":"P. Sanders","year":"2004","unstructured":"Sanders, P., Winkel, S.: Super scalar sample sort. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 784\u2013796. Springer, Heidelberg (2004)"},{"key":"15_CR14","unstructured":"Shamsundar, N.: A fast, stable implementation of mergesort for sorting text files (May 2009), \n                  \n                    http:\/\/code.google.com\/p\/lcp-merge-string-sort\n                  \n                  \n                 (source downloaded November 2012)"},{"issue":"2.5","key":"15_CR15","first-page":"1","volume":"15","author":"R. Sinha","year":"2010","unstructured":"Sinha, R., Wirth, A.: Engineering Burstsort: Toward fast in-place string sorting. J. Exp. Algorithmics\u00a015(2.5), 1\u201324 (2010)","journal-title":"J. Exp. Algorithmics"},{"issue":"1.5","key":"15_CR16","first-page":"1","volume":"9","author":"R. Sinha","year":"2004","unstructured":"Sinha, R., Zobel, J.: Cache-conscious sorting of large sets of strings with dynamic tries. J. Exp. Algorithmics\u00a09(1.5), 1\u201331 (2004)","journal-title":"J. Exp. Algorithmics"},{"issue":"1.2","key":"15_CR17","first-page":"1","volume":"11","author":"R. Sinha","year":"2007","unstructured":"Sinha, R., Zobel, J., Ring, D.: Cache-efficient string sorting using copying. J. Exp. Algorithmics\u00a011(1.2), 1\u201332 (2007)","journal-title":"J. Exp. Algorithmics"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Tsigas, P., Zhang, Y.: A simple, fast parallel implementation of quicksort and its performance evaluation on SUN enterprise 10000. In: PDP, pp. 372\u2013381. IEEE Computer Society (2003)","DOI":"10.1109\/EMPDP.2003.1183613"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-23397-5_16","volume-title":"Euro-Par 2011 Parallel Processing","author":"J. Wassenberg","year":"2011","unstructured":"Wassenberg, J., Sanders, P.: Engineering a multi-core radix sort. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011, Part II. LNCS, vol.\u00a06853, pp. 160\u2013169. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:16:40Z","timestamp":1558012600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}