Alternation and redundancy analysis of the intersection problem

@article{Barbay2008AlternationAR,
  title={Alternation and redundancy analysis of the intersection problem},
  author={J{\'e}r{\'e}my Barbay and Claire Mathieu},
  journal={ACM Trans. Algorithms},
  year={2008},
  volume={4},
  pages={4:1-4:18}
}
The intersection of sorted arrays problem has applications in search engines such as Google. Previous work has proposed and compared deterministic algorithms for this problem, in an adaptive analysis based on the encoding size of a certificate of the result (cost analysis). We define the alternation analysis, based on the nondeterministic complexity of an instance. In this analysis we prove that there is a deterministic algorithm asymptotically performing as well as any randomized algorithm in… CONTINUE READING