{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:25:12Z","timestamp":1776288312152,"version":"3.50.1"},"publisher-location":"Boston, MA","reference-count":16,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_408","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:30:58Z","timestamp":1214505058000},"page":"907-910","source":"Crossref","is-referenced-by-count":1,"title":["String Sorting"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Fagerberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"408_CR1_408","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31, 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"408_CR2_408","doi-asserted-by":"crossref","unstructured":"Andersson, A., Nilsson, S.: A\u00a0new efficient radix sort. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS '94), IEEE Comput. Soc. Press, pp. 714\u2013721 (1994)","DOI":"10.1109\/SFCS.1994.365721"},{"key":"408_CR3_408","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/297096.297136","volume":"3","author":"A. Andersson","year":"1998","unstructured":"Andersson, A., Nilsson, S.: Implementing radixsort. ACM J.\u00a0Exp. Algorithmics 3, 7 (1998)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"408_CR4_408","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1145\/258533.258647","volume-title":"Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC '97), ACM, ed.","author":"L. Arge","year":"1997","unstructured":"Arge, L., Ferragina, P., Grossi, R., Vitter, J.S.: On sorting strings in external memory (extended abstract). In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC '97), ACM, ed., pp. 540\u2013548. ACM Press, El Paso (1997),"},{"key":"408_CR5_408","first-page":"133","volume":"23","author":"J. Bentley","year":"1998","unstructured":"Bentley, J., Sedgewick, R.: Algorithm alley: Sorting strings with three-way radix quicksort. Dr. Dobb's J.\u00a0Softw. Tools 23, 133\u2013134, 136\u2013138 (1998)","journal-title":"Dr. Dobb's J. Softw. Tools"},{"key":"408_CR6_408","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1002\/spe.4380231105","volume":"23","author":"J.L. Bentley","year":"1993","unstructured":"Bentley, J.L., McIlroy, M.D.: Engineering a\u00a0sort function. Softw. Pract. Exp. 23, 1249\u20131265 (1993)","journal-title":"Softw. Pract. Exp."},{"key":"408_CR7_408","first-page":"68","volume-title":"Proceedings of STACS '06. LNCS, vol. 3884","author":"R. Fagerberg","year":"2006","unstructured":"Fagerberg, R., Pagh, A., Pagh, R.: External string sorting: Faster and cache-oblivious. In: Proceedings of STACS '06. LNCS, vol.\u00a03884, pp. 68\u201379. Springer, Marseille (2006)"},{"key":"408_CR8_408","first-page":"606","volume-title":"Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP '04). LNCS, vol. 3142","author":"G. Franceschini","year":"2004","unstructured":"Franceschini, G., Grossi, R.: A\u00a0general technique for managing strings in comparison-driven data structures. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP '04). LNCS, vol.\u00a03142, pp. 606\u2013617. Springer, Turku (2004)"},{"key":"408_CR9_408","first-page":"90","volume-title":"Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP '05). LNCS, vol. 3580","author":"G. Franceschini","year":"2005","unstructured":"Franceschini, G., Grossi, R.: Optimal in-place sorting of vectors and records. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP '05). LNCS, vol.\u00a03580, pp. 90\u2013102. Springer, Lisbon (2005)"},{"key":"408_CR10_408","first-page":"372","volume-title":"Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP '99). LNCS, vol. 1644","author":"R. Grossi","year":"1999","unstructured":"Grossi, R., Italiano, G.F.: Efficient techniques for maintaining multidimensional keys in linked data structures. In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP '99). LNCS, vol.\u00a01644, pp. 372\u2013381. Springer, Prague (1999)"},{"key":"408_CR11_408","first-page":"135","volume-title":"Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS '02)","author":"Y. Han","year":"2002","unstructured":"Han, Y., Thorup, M.: Integer sorting in $$ { {O}(n\\sqrt{\\log\\log n}) } $$ expected time and linear space. In: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS '02), pp. 135\u2013144. IEEE Computer Society Press, Vancouver (2002)"},{"key":"408_CR12_408","first-page":"5","volume":"6","author":"P.M. McIlroy","year":"1993","unstructured":"McIlroy, P.M., Bostic, K., McIlroy, M.D.: Engineering radix sort. Comput. Syst. 6, 5\u201327 (1993)","journal-title":"Comput. Syst."},{"issue":"2","key":"408_CR13_408","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/0208014","volume":"8","author":"K. Mehlhorn","year":"1979","unstructured":"Mehlhorn, K.: Dynamic binary search. SIAM J.\u00a0Comput. 8, 175\u2013198 (1979)","journal-title":"SIAM J. Comput."},{"key":"408_CR14_408","unstructured":"Sedgewick, R.: Algorithms in Java, Parts 1\u20134, 3rd edn. Addison-Wesley, (2003)"},{"key":"408_CR15_408","first-page":"360","volume-title":"Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '97), ACM, ed.","author":"R. Sedgewick","year":"1997","unstructured":"Sedgewick, R., Bentley, J.: Fast algorithms for sorting and searching strings. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '97), ACM, ed., pp. 360\u2013369. ACM Press, New Orleans (1997)"},{"key":"408_CR16_408","doi-asserted-by":"crossref","unstructured":"Sinha, R., Zobel, J., Ring, D.: Cache-efficient string sorting using copying. ACM J.\u00a0Exp. Algorithmics. 11 (2006)","DOI":"10.1145\/1187436.1187439"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:12Z","timestamp":1738272732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_408"}},"subtitle":["1997; Bentley, Sedgewick"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_408","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}