Author:
Franceschini Gianni,Grossi Roberto
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Andersson, A., Hagerup, T., Håstad, J., Petersson, O.: Tight bounds for searching a sorted array of strings. SIAM Journal on Computing 30(5), 1552–1578 (2001)
2. Arge, L., Ferragina, P., Grossi, R., Vitter, J.S.: On sorting strings in external memory. In: ACM STOC 1997, pp. 540–548 (1997)
3. Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious B-trees. In: IEEE FOCS 2000, pp. 399–409 (2000)
4. Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: ACM-SIAM SODA 1997, pp. 360–369 (1997)
5. Brodal, G.S., Fagerberg, R., Jacob, R.: Cache oblivious search trees via binary trees of small height. In: ACM-SIAM SODA 2002, pp. 39–48 (2002)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. String Sorting;Encyclopedia of Algorithms;2016
2. String Sorting;Encyclopedia of Algorithms;2015