Abstract
The ”Intersection of sorted arrays” problem has applications in indexed search engines such as Google. Previous works propose and compare deterministic algorithms for this problem, and offer lower bounds on the randomized complexity in different models (cost model, alternation model).
We refine the alternation model into the redundancy model to prove that randomized algorithms perform better than deterministic ones on the intersection problem. We present a randomized and simplified version of a previous algorithm, optimal in this model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Barbay, J., Kenyon, C.: Randomized lower bound and deterministic algorithms for intersection. t-threshold and opt-threshold (May 2003) (submitted)
Bentley, J.L., Yao, A.C.-C.: An almost optimal algorithm for unbounded searching. Information Processing Letters 5(3), 82–87 (1976)
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)
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)
Mehlhorn, K.: Nearly Optimal Binary Search Tree. In: Data Structures and Algorithms 1: Sorting and Searching, ch. 4.2, pp. 184–185. Springer, Heidelberg (1984)
Von Neumann, J., Morgenstern, O.: Theory of games and economic behavior, 1st edn. Princeton University Press, Princeton (1944)
Sion, M.: On general minimax theorems. Pacic Journal of Mathematics, 171–176 (1958)
Yao, A.C.: Probabilistic computations: Toward a unified measure of complexity. In: Proc. 18th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 222–227 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbay, J. (2003). Optimality of Randomized Algorithms for the Intersection Problem. In: Albrecht, A., Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2003. Lecture Notes in Computer Science, vol 2827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39816-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-39816-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20103-8
Online ISBN: 978-3-540-39816-5
eBook Packages: Springer Book Archive