1. Barbay, J., Kenyon, C.: Adaptive intersection and t-threshold problems. In: Proceedings of the 13th ACM-SIAM Symposium On Discrete Algorithms (SODA), January 2002, pp. 390–399. ACM-SIAM, ACM (2002)
2. Barbay, J., Kenyon, C.: Randomized lower bound and deterministic algorithms for intersection. t-threshold and opt-threshold (May 2003) (submitted)
3. Bentley, J.L., Yao, A.C.-C.: An almost optimal algorithm for unbounded searching. Information Processing Letters 5(3), 82–87 (1976)
4. Demaine, E.D., López-Ortiz, A., Munro, J.I: Adaptive set intersections, unions, and differences. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 743–752 (2000)
5. Demaine, E.D., Löpez-Ortiz, A., Munro, J.I.: Experiments on adaptive set intersections for text retrieval systems. In: Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments, Washington DC, January 2001. LNCS, pp. 5–6 (2001)