Alternation and redundancy analysis of the intersection problem

ACM Transactions on Algorithms

Volumn 4, Issue 1, 2008, Pages

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

^a UNIVERSITY OF CHILE   (Chile)

^b BROWN UNIVERSITY   (United States)

^c Brown Univerity   (United States)

Author keywords

Adaptive analysis; Alternation analysis; Intersection; Intersection of sorted arrays; Randomized algorithm; Redundancy analysis

Indexed keywords

ADAPTIVE ANALYSIS; ALTERNATION ANALYSIS; INTERSECTION OF SORTED ARRAYS; RANDOMIZED ALGORITHMS; REDUNDANCY ANALYSIS;

ADAPTIVE SYSTEMS; ALGORITHMS; ENCODING (SYMBOLS); PROBLEM SOLVING; RANDOM PROCESSES;

SEARCH ENGINES;

EID: 42149189456     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1328911.1328915     Document Type: Article

References (23)

1. BAEZA-YATES, R. A. 2004. A fast set intersection algorithm for sorted sequences. In Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM), S. C. Sahinalp et al., Eds. Lecture Notes in Computer Science, vol. 3109. Springer, 400-408.
2. BARBAY, J. 2004. Index-Trees for descendant tree queries in the comparison model. Tech. Rep. TR-2004-11, University of British Columbia. July.
3. BARBAY, J. 2003. Optimality of randomized algorithms for the intersection problem. In Proceedings of the 2nd International Symposium on Stochastic Algorithms, Foundations and Applications (SAGA), A. Albrecht, Ed. Lecture Notes in Computer Science, vol. 2827. Springer, Heidelberg, 26-38. 3-540-20103-3.
4. BARBAY, J., AND KENYON, C 2003. Deterministic algorithm, for the t-threshold set problem. In Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC), H. O. Toshihide Ibaraki, Noki Katoh, Eds. Lecture Notes in Computer Science. Springer, 575-584.
5. BARBAY, J., AND KENYON, C 2002. Adaptive intersection and t-threshold problems. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, 390-399.
6. BEAME, P., AND FICH, F. E. 2002. Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci. 65, 1, 38-72.
7. BENDER, M. A., COLE, R., AND RAMAN, R. 2002. Exponential structures for efficient cache-oblivious algorithms. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP). Springer, 195-207.
8. BENTLEY, J. L., AND YAO, A. C.-C. 1976. An almost optimal algorithm for unbounded searching. Inf. Proc. Lett. 5, 3, 82-87.
9. CHAUDHURI, S. 1998. An overview of query optimization in relational systems. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 34-43.
10. CHRISTEN, C 1978. Improving the bound on optimal merging. In Proceedings of 19th Annual Symposium on Foundations of Computer Science (FOCS). 259-266.
11. DE LA VEGA, W. F., FRIEZE, A. M., AND SANTHA, M. 1998. Average-Case analysis of the merging algorithm of Hwang and Lin. Algorithmica 22, 4, 483-489.
12. DE LA VEGA, W. F., KANNAN, S., AND SANTHA, M. 1993. Two probabilistic results on merging. SIAM J. Comput. 22, 2, 261-271.
13. DEMAINE, E. D., LÓPEZ-ORTIZ, A., AND MUNRO, J. I. 2001. 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. Springer, 5-6.
14. DEMAINE, E. D., LÓPEZ-ORTIZ, A., AND MUNRO, J. I. 2000. Adaptive set intersections, unions, and differences. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), 743-752.
15. FRIGO, M., LEISERSON, C. E., PROKOP, H., AND RAMACHANDRAN, S. 1999. Cache-Oblivious algorithms. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 285.
16. HWANG, F. K., AND LIN, S. 1972. A simple algorithm for merging two disjoint linearly ordered sets. SIAM J. Comput. 1, 1, 31-39.
17. HWANG, F. K., AND LIN, S. 1971. Optimal merging of 2 elements with n elements. Acta Inf. 145-158.
18. MANACHER, G. K. 1979. Significant improvements to the Hwang-Ling merging algorithm. J. ACM 26, 3, 434-440.
19. NEUMANN, J. V., AND MORGENSTERN, O. 1944. Theory of Games and Economic Behavior, 1st ed. Princeton University Press.
20. RAMAN, R., RAMAN, V., AND RAO, S. S. 2002. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the 13th Annual ACM-SlAM Symposium on Discrete Algorithms (SODA), 233-242.
21. SION, M. 1958. On general minimax theorems. Pacific J. Math. 171-176.
22. WITTEN, I. H., MOFFAT, A., AND BELL, T. C. 1994. Managing Gigabytes. VanNostrand Reinhold, New York.
23. YAO, A. C. 1977. Probabilistic computations: Toward a unified measure of complexity. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS), 222-227.