Deterministic algorithm for the t-threshold set problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2906, Issue , 2003, Pages 575-584

  Barbay, Jérémy ^a   Kenyon, Claire ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Adaptive algorithm; Opt threshold set; t threshold set

Indexed keywords

ADAPTIVE ALGORITHMS; SEARCH ENGINES;

DETERMINISTIC ALGORITHMS; THRESHOLD PROBLEM; THRESHOLD SETS;

ALGORITHMS;

EID: 35248837909     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_59     Document Type: Article

References (11)

1. J. Barbay. 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. J. Barbay. Optimally of randomized algorithms for the intersection problem. In 2nd Symposium on Stochastic Algorithms, Foundations and applications. LNCS, Springer-Verlag, 2003.
3. th ACM-SIAM Symposium On Discrete Algorithms (SODA), pages 390-399. ACM-SIAM, ACM, January 2002.
4. J. L. Bentley and A. C.-C. Yao. An almost optimal algorithm for unbounded searching. Information processing letters, 5(3):82-87, 1976.
5. C. Cool and D. Kim. Best sorting algorithm for nearly sorted lists. Communication of ACM, 23:620-624, 1980.
6. th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 743-752, 2000.
7. E. D. Demaine, A. Lopez-Ortiz, and J. I. Munro. Experiments on adaptive set intersections for text retrieval systems. In Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments, Lecture Notes in Computer Science, pages 5-6, Washington DC, January 2001.
8. V. Estivill-Castro and D. Wood. A survey of adaptive sorting algorithms. ACM Computing Surveys, 1992. 24(4):441-476.
9. D. G. Kirkpatrick and R. Seidel. The ultimate planar convex hull algorithm? SIAM J. Comput., 1986. 15(1):287-299.
10. K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching, chapter 4.2 Nearly Optimal Binary Search Tree, pages 184-185. Springer-Verlag, 1984.
11. O. Petersson and A. Moffat. A framework for adaptive sorting. Discrete Applied Mathematics, 59:153-179, 1995.