Papers:

• Introduction to suffix trees and suffix arrays

• The LCA problem revisted , M. A. Bender, M. Farach-Colton, LATIN 2000, 88-94
  Presentation by Erez Sayer

• On the sorting-complexity of suffix tree construction , Farach, Ferragina, and Muthukrishnan, JACM 47:6, 2000, 987 - 1011
  Presentation by Roman Manevich

• Suffix arrays: a new method for on-line string searches, U. Manber and G. Myers, SIAM Journal on Computing 22:3, 1993, 935-948
  Presentation by Yael Eisenthal

• Data compression with finite windows , Fiala and Greene, Communications of the ACM, 32:4, 1989, 490-505
  Presentation by giora Alexandron

• Linear Algorithm for Data Compression via String Matching , Rodeh, Pratt, Even, Journal of the ACM (JACM), 28:1, 1981, 16 - 24
  Presentation by Rinat Ben Abraham

• The Burrows-Wheeler Transform: Theory and Practice , Manzini, Proc. 24th Int. Symposium on Mathematical Foundations of Computer Science (MFCS '99), 1999. Springer Verlag LNCS n. 1672, 34-47.
  Presentation by Eran Vered

• Succint representation of balanced parentheses, static trees and planar graphs, J. I. Munro and V. Raman, Proc 38th Symposium on Foundations of Computer (FOCS), 1997, 118--126.
  Presentation by Svetlana Olonetsky

• Space Efficient Suffix Trees , J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao, J. of Algorithms, 39:2, 2001, 205-222.
  Presentation by Alexander Freidin

• Randomized search trees , Seidel, Aragon, Algorithmica 16:2 ,1996, 464-497
  Presentation by Ohad Barzilay

• On Data Structures and Asymmetric Communication Complexity , Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson, JCSS 57:1,1998, 37-49
  Presentation by Elad Verbin