1. Are bitvectors optimal?;Buhrman,2000
2. Storing a sparse table with O(1) worst case access time;Fredman;J. ACM,1984
3. Opportunistic data structures with applications;Ferragina,2000
4. P. Ferragina, G. Manzini, On compressing and indexing data, Technical Report TR-02-01, Dipartimento di Informatica, Università di Pisa, 2002
5. From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction;Giegerich;Algorithmica,1997