Algorithms for Subset Testing and Finding Maximal Sets

@inproceedings{Yellin1992AlgorithmsFS,
  title={Algorithms for Subset Testing and Finding Maximal Sets},
  author={Daniel M. Yellin},
  booktitle={SODA},
  year={1992}
}
In this paper we consider two related problems: subset testing and finding maximal sets. First, consider a sequence of <italic>n</italic> operations, where each operation either creates a set, inserts (deletes) an element into (from) a set, queries whether a particular element is in a set, queries whether or not one set is a subset of another, or queries whether or not the intersection of two sets is empty. We show that for any integer <italic>k</italic>, one can implement subset and… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS