Fast set intersection and two-patterns matching

Hagai Cohen, Ely Porat

Research output: Contribution to journalArticlepeer-review

49 Scopus citations


In this paper we present a new problem, the fast set intersection problem, which is to preprocess a collection of sets in order to efficiently report the intersection of any two sets in the collection. In addition we suggest new solutions for the two-dimensional substring indexing problem and the document listing problem for two patterns by reduction to the fast set intersection problem.

Original languageEnglish
Pages (from-to)3795-3800
Number of pages6
JournalTheoretical Computer Science
Issue number40-42
StatePublished - 6 Sep 2010


  • Set intersection
  • Two patterns


Dive into the research topics of 'Fast set intersection and two-patterns matching'. Together they form a unique fingerprint.

Cite this