Adaptive intersection and t-Threshold Problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 390-399

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

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES;

BOOLEAN QUERIES; COMPARISON MODELING; LOWER BOUNDS; THRESHOLD PROBLEM;

ALGORITHMS;

EID: 35448944267     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. John L. Bentley, and Andrew C. Yao, An almost Optimal Algorithm for Unbounded Searching. In Information Processing Letters 5 1976, 82-87.
2. Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro, Adaptive set intersections, unions, and differences. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, 743-752.
3. Erik D. Demaine, Alejandro López-Ortiz, and J. Ian 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, 2001, 91-104.
4. Vladimir Estivill-Castro, and Derick Wood, A Survey of Adaptive Sorting Algorithms. ACM Computing Surveys, 1992, 24(4):441-476.
5. Donald E. Knuth, The Art of Computer Programming, Vol 3, Sorting and Searching, Section 5.3. Addison-Wesley, 1973.
6. John von Neumann, and Oskar Morgenstern, Theory of games and economic behavior, 1st ed. Princeton University Press, 1944.
7. Andrew C. Yao, Probabilistic computations: Toward a unified measure of complexity, In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS), 1977, 222-227.