{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:03:58Z","timestamp":1743055438952,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030576745"},{"type":"electronic","value":"9783030576752"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57675-2_21","type":"book-chapter","created":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T23:12:33Z","timestamp":1597705953000},"page":"329-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["LCP-Aware Parallel String Sorting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3305-6185","authenticated-orcid":false,"given":"Jonas","family":"Ellert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nodari","family":"Sitchinava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"key":"21_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms, 1st edn. Addison-Wesley, Boston (1974)","edition":"1"},{"key":"21_CR2","unstructured":"Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Proceedings of the 8th Annual Symposium on Discrete Algorithms, SODA 1997, New Orleans, LA, USA, January 1997, pp. 360\u2013369 (1997)"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0890-5401(91)90031-V","volume":"94","author":"P Bhatt","year":"1991","unstructured":"Bhatt, P., Diks, K., Hagerup, T., Prasad, V., Radzik, T., Saxena, S.: Improved deterministic parallel integer sorting. Inf. Comput. 94(1), 29\u201347 (1991). https:\/\/doi.org\/10.1016\/0890-5401(91)90031-V","journal-title":"Inf. Comput."},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00453-015-0071-1","volume":"77","author":"T Bingmann","year":"2015","unstructured":"Bingmann, T., Eberle, A., Sanders, P.: Engineering parallel string sorting. Algorithmica 77(1), 235\u2013286 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0071-1","journal-title":"Algorithmica"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Bingmann, T., Sanders, P.: Parallel string sample sort. In: Proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, Sophia Antipolis, France, September 2013, pp. 169\u2013180 (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_15","DOI":"10.1007\/978-3-642-40450-4_15"},{"key":"21_CR6","doi-asserted-by":"publisher","unstructured":"Bingmann, T., Sanders, P., Schimek, M.: Communication-efficient string sorting. In: Proceedings of the 34th International Parallel and Distributed Processing Symposium (IPDPS 2020), New Orleans, LA, USA, May 2020, pp. 137\u2013147 (2020). https:\/\/doi.org\/10.1109\/IPDPS47924.2020.00024","DOI":"10.1109\/IPDPS47924.2020.00024"},{"key":"21_CR7","unstructured":"Blelloch, G.E.: Prefix sums and their applications. In: Reif, J.H. (ed.) Synthesis of Parallel Algorithms, 1st edn. Chapter 1, pp. 35\u201360. Morgan Kaufmann Publishers Inc. (1993)"},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R Cole","year":"1988","unstructured":"Cole, R.: Parallel merge sort. SIAM J. Comput. 17(4), 770\u2013785 (1988). https:\/\/doi.org\/10.1137\/0217049","journal-title":"SIAM J. Comput."},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","volume":"81","author":"R Cole","year":"1989","unstructured":"Cole, R., Vishkin, U.: Faster optimal parallel prefix sums and list ranking. Inf. Comput. 81(3), 334\u2013352 (1989). https:\/\/doi.org\/10.1016\/0890-5401(89)90036-9","journal-title":"Inf. Comput."},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Gu, Y., Shun, J., Sun, Y., Blelloch, G.E.: A top-down parallel semisort. In: Proceedings of the 27th Symposium on Parallelism in Algorithms and Architectures, pp. 24\u201334. SPAA 2015, Portland, OR, USA, June 2015 (2015). https:\/\/doi.org\/10.1145\/2755573.2755597","DOI":"10.1145\/2755573.2755597"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Hagerup, T.: Optimal parallel string algorithms: sorting, merging and computing the minimum. In: Proceedings of the 26th Annual Symposium on Theory of Computing, STOC 1994, Montr\u00e9al, Canada, May 1994, pp. 382\u2013391 (1994). https:\/\/doi.org\/10.1145\/195058.195202","DOI":"10.1145\/195058.195202"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Hagerup, T., Raman, R.: Fast deterministic approximate and exact parallel sorting. In: Proceedings of the 5th Annual Symposium on Parallel Algorithms and Architectures, SPAA 1993, Velen, Germany, June 1993, pp. 346\u2013355 (1993). https:\/\/doi.org\/10.1145\/165231.157380","DOI":"10.1145\/165231.157380"},{"issue":"6","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1137\/S0097539799352449","volume":"31","author":"Y Han","year":"2002","unstructured":"Han, Y., Shen, X.: Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs. SIAM J. Comput. 31(6), 1852\u20131878 (2002). https:\/\/doi.org\/10.1137\/S0097539799352449","journal-title":"SIAM J. Comput."},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(94)00263-0","volume":"154","author":"J J\u00e1J\u00e1","year":"1996","unstructured":"J\u00e1J\u00e1, J., Ryu, K.W., Vishkin, U.: Sorting strings and constructing digital search trees in parallel. Theor. Comput. Sci. 154(2), 225\u2013245 (1996). https:\/\/doi.org\/10.1016\/0304-3975(94)00263-0","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987). https:\/\/doi.org\/10.1147\/rd.312.0249","journal-title":"IBM J. Res. Dev."},{"issue":"6","key":"21_CR16","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987). https:\/\/doi.org\/10.1137\/0216062","journal-title":"SIAM J. Comput."},{"key":"21_CR17","unstructured":"Vaidyanathan, R., Hartmann, C.R., Varshney, P.: Optimal parallel lexicographic sorting using a fine-grained decomposition. Technical report. 127, Electrical Engineering and Computer Science, Syracuse University, NY, USA (1991). https:\/\/surface.syr.edu\/eecs_techreports\/127"},{"key":"21_CR18","unstructured":"Vishkin, U.: Thinking in parallel: some basic data-parallel algorithms and techniques. Lecture notes at the University of Maryland Institute for Advanced Computer Studies (UMIACS), October 2010. http:\/\/users.umiacs.umd.edu\/~vishkin\/PUBLICATIONS\/classnotes.pdf"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2020: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57675-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,18]],"date-time":"2024-08-18T00:04:03Z","timestamp":1723939443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57675-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030576745","9783030576752"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57675-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2020.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"158","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the coronavirus pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}