{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:36:22Z","timestamp":1725489382506},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734369"},{"type":"electronic","value":"9783540734376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73437-6_5","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T17:36:44Z","timestamp":1187026604000},"page":"16-27","source":"Crossref","is-referenced-by-count":0,"title":["On Demand String Sorting over Unbounded Alphabets"],"prefix":"10.1007","author":[{"given":"Carmel","family":"Kent","sequence":"first","affiliation":[]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[]},{"given":"Dafna","family":"Sheinwald","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA (1974)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Amir, A., Kopelowitz, T., Lewenstein, M., Lewenstein, N.: Towards Real-Time Suffix Tree Construction. In: Proc. of Symp. on String Processing and Information Retrieval (SPIRE), pp. 67\u201378 (2005)","DOI":"10.1007\/11575832_9"},{"key":"5_CR3","unstructured":"Iyer, B.R.: Hardware assisted sorting in IBM\u2019s DB2 DBMS. In: International Conference on Management of Data, COMAD 2005b, Hyderabad, India (December 20-22, 2005)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Arge, L., Ferragina, P., Grossi, R., Vitter, J.S.: On sorting strings in external memory. In: Symposium of Theory of Computing (STOC), pp. 540\u2013548 (1997)","DOI":"10.1145\/258533.258647"},{"key":"5_CR5","volume-title":"Handbook of Algorithms and Data Structures","author":"G.H. Gonnet","year":"1991","unstructured":"Gonnet, G.H., Baeza-Yates, R.: Handbook of Algorithms and Data Structures. Addison-Wesley, Reading (1991)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/32.24711","volume":"15","author":"J.-L. Baer","year":"1989","unstructured":"Baer, J.-L., Lin, Y.-B.: Improving Quicksort Performance with a Codeword Data Structure. IEEE Transactions on Software Engineering\u00a015, 622\u2013631 (1989)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"5_CR7","unstructured":"Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Proc. of Symposium on Discrete Algorithms (SODA), pp. 360\u2013369 (1997)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proc. 38th IEEE Symposium on Foundations of Computer Science, pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M. Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. J. of the ACM\u00a047(6), 987\u20131011 (2000)","journal-title":"J. of the ACM"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-48523-6_34","volume-title":"Automata, Languages and Programming","author":"R. Grossi","year":"1999","unstructured":"Grossi, R., Italiano, G.F.: Efficient techniques for maintaining multidimensional keys in linked data structures. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 372\u2013381. Springer, Heidelberg (1999)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Hagerup, T.: Optimal parallel string algorithms: sorting, merging and computing the minimum. In: Proc. of Symposium on Theory of Computing (STOC), pp. 382\u2013391 (1994)","DOI":"10.1145\/195058.195202"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Hagerup, T., Petersson, O.: Merging and Sorting Strings in Parallel. Mathematical Foundations of Computer Science (MFCS), pp. 298\u2013306 (1992)","DOI":"10.1007\/3-540-55808-X_28"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(94)00263-0","volume":"154","author":"J.F. JaJa","year":"1996","unstructured":"JaJa, J.F., Ryu, K.W., Vishkin, U.: Sorting strings and constructing difital search tries in parallel. Theoretical Computer Science\u00a0154(2), 225\u2013245 (1996)","journal-title":"Theoretical Computer Science"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"Automata, Languages and Programming","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 943\u2013955. Springer, Heidelberg (2003)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","volume-title":"Combinatorial Pattern Matching","author":"D.K. Kim","year":"2003","unstructured":"Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Baeza-Yates, R.A., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 186\u2013199. Springer, Heidelberg (2003)"},{"key":"5_CR16","series-title":"Sorting and Searching","volume-title":"the Art of Computer Programming","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: the Art of Computer Programming. Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading, MA (1973)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R.A., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 200\u2013210. Springer, Heidelberg (2003)"},{"issue":"5","key":"5_CR18","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. on Computing"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. of the ACM\u00a023, 262\u2013272 (1976)","journal-title":"J. of the ACM"},{"issue":"2","key":"5_CR20","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. Comput.\u00a08(2), 175\u2013198 (1979)","journal-title":"SIAM J. Comput."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Raman, V.: Sorting multisets and vectors inplace. In: Proc. of Workshop on Algorithms and Data Structures (WADS), pp. 473\u2013479 (1991)","DOI":"10.1007\/BFb0028285"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1145\/1187436.1187439","volume":"11","author":"R. Sinha","year":"2006","unstructured":"Sinha, R., Zobel, J., Ring, D.: Cache-efficient string sorting using copying. J. Exp. Algorithmics\u00a011, 1084\u20136654 (2006)","journal-title":"J. Exp. Algorithmics"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014, 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"5_CR24","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-1-4615-0005-6_10","volume-title":"Handbook of massive data sets","author":"J. Scott Vitter","year":"2002","unstructured":"Scott Vitter, J.: External memory algorithms. In: Handbook of massive data sets, pp. 359\u2013416. Kluwer Academic Publishers, Norwell, MA, USA (2002)"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithm. In: Proc. 14th IEEE Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"5_CR26","unstructured":"IBM OmniFind Enterprise Edition: Programming Guide and API Reference for Enterprise Search. Sorting by relevance, date, numeric fields, or text fields, p. 30. http:\/\/publibfp.boulder.ibm.com\/epubs\/pdf\/c1892843.pdf"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73437-6_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:14Z","timestamp":1619518334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73437-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734369","9783540734376"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73437-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}