Highly Influenced

@inproceedings{Barbay2002AdaptiveIA, title={Adaptive intersection and t-threshold problems}, author={J{\'e}r{\'e}my Barbay and Claire Mathieu}, booktitle={SODA}, year={2002} }

- Published 2002 in SODA

Consider the problem of computing the intersection of k sorted sets. In the comparison model, we prove a new lower bound which depends on the non-deterministic complexity of the instance, and implies that the algorithm of Demaine, López-Ortiz and Munro [2] is usually optimal in this "adaptive" sense. We extend the lower bound and the algorithm to the t-Threshold Problem, which consists in finding the elements which are in at least t of the k sets. These problems are motivated by boolean queries… CONTINUE READING

Highly Cited

This paper has 81 citations. REVIEW CITATIONS

Citations per Year

Semantic Scholar estimates that this publication has **81** citations based on the available data.

See our **FAQ** for additional information.