1. A fast set intersection algorithm for sorted sequences;Baeza-Yates,2004
2. J. Barbay, C. Kenyon, Alternation and redundancy analysis of the intersection problem, ACM Transactions on Algorithms 4 (1) (2008) 18 pp. (in press)
3. Faster adaptive set intersections for text searching;Barbay,2006
4. Representing trees of higher degree;Benoit;Algorithmica,2005
5. D.R. Clark, J.I. Munro, Efficient suffix trees on secondary storage, in: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 383–391