1. Barbay, J.: Analyse fine: bornes inférieures et algorithmes de calculs d’intersection pour moteurs de recherche. PhD thesis, Université Paris-Sud, Laboratoire de Recherche en Informatique (Septembre 2002)
2. Lecture Notes in Computer Science;J. Barbay,2003
3. Barbay, J., Kenyon, C.: Adaptive intersection and t-threshold problems. In: Proceedings of the 13th ACM-SIAM Symposium On Discrete Algorithms (SODA), ACM-SIAM, January 2002, pp. 390–399. ACM Press, New York (2002)
4. Bentley, J.L., Yao, A.C.-C.: An almost optimal algorithm for unbounded searching. Information processing letters 5(3), 82–87 (1976)
5. Cool, C., Kim, D.: Best sorting algorithm for nearly sorted lists. Communication of ACM 23, 620–624 (1980)