@article{devadze68,
  author = {Devadze, H. M.},
  interhash = {ceae40797dbc8d58aea5d23f9a58af03},
  intrahash = {059e8c6458166d878c19dda553f2c6bc},
  journal = {Doklady Akademii Nauk BSSR},
  note = {(russisch)},
  number = 9,
  pages = {765-768},
  title = {Erzeugende {M}engen der {H}albgruppe aller binären {R}elationen auf einer endlichen {M}enge},
  volume = 12,
  year = 1968
}

@article{devadze68-2,
  author = {Devadze, H. M.},
  interhash = {0b7e4d5d50bceba261c1143ee27c2b8f},
  intrahash = {ca97abe7105f15d09ab9983c54986538},
  journal = {Ucenye zapiski / Leningradskij Gosudarstvennyj Pedagogiceskij Institut Imeni A. I. Gercena},
  note = {(russisch)},
  pages = {92-100},
  title = {Erzeugende {M}engen bestimmter Unterhalbgruppen der {H}albgruppe aller binären {R}elationen auf einer endlichen {M}enge},
  volume = 387,
  year = 1968
}

@inproceedings{orlando02efficient,
  abstract = {Due to the huge increase in the number and dimension of available databases, efficient solutions for counting frequent sets
are nowadays very important within the Data Mining community. Several sequential and parallel algorithms were proposed, whichin many cases exhibit excellent scalability. In this paper we present ParDCI, a distributed and multithreaded algorithm forcounting the occurrences of frequent sets within transactional databases. ParDCI is a parallel version of DCI (Direct Count& Intersect), a multi-strategy algorithm which is able to adapt its behavior not only to the features of the specific computingplatform (e.g. available memory), but also to the features of the dataset being processed (e.g. sparse or dense datasets).ParDCI enhances previous proposals by exploiting the highly optimized counting and intersection techniques of DCI, and byrelying on a multi-level parallelization approachwh ichex plicitly targets clusters of SMPs, an emerging computing platform.We focused our work on the efficient exploitation of the underlying architecture. Intra-Node multithreading effectively exploitsthe memory hierarchies of each SMP node, while Inter-Node parallelism exploits smart partitioning techniques aimed at reducingcommunication overheads. In depth experimental evaluations demonstrate that ParDCI reaches nearly optimal performances undera variety of conditions.},
  author = {Orlando, Salvatore and Palmerini, Paolo and Perego, Raffaele and Silvestri, Fabrizio},
  booktitle = {High Performance Computing for Computational Science — VECPAR 2002},
  interhash = {50c17d100341c01892f7dd8fbd7deb69},
  intrahash = {522c68b8bb5e28f1bf9f1e11e612f542},
  pages = {3--29},
  title = {An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets},
  url = {http://dx.doi.org/10.1007/3-540-36569-9_28},
  year = 2003
}

@article{konieczny05,
  author = {Konieczny, Janusz},
  interhash = {b45742ab9ef8aa1421d9fd02db40dfa7},
  intrahash = {4092862e96f165222ba8beef4a6d461f},
  note = {to be published},
  title = {A Proof of {D}evadze's Theorem on Generators of the Semigroup of Boolean Matrices},
  year = 2005
}

@inproceedings{conf/cpm/Baeza-Yates04,
  abstract = {This paper introduces a simple intersection algorithm for two sorted sequences that is fast on average. It is related to the multiple searching problem and to merging. We present the worst and average case analysis, showing that in the former, the complexity nicely adapts to the smallest list size. In the later case, it performs less comparisons than the total number of elements on both inputs when n = agr m (agr > 1). Finally, we show its application to fast query processing in Web search engines, where large intersections, or differences, must be performed fast.},
  author = {Baeza-Yates, Ricardo A.},
  booktitle = {Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, CPM 2004},
  editor = {Sahinalp, Suleyman Cenk and Muthukrishnan, S. and Dogrusoz, Ugur},
  interhash = {a71b1a4a88d4228da47271d744a1a97b},
  intrahash = {ac1a8233f1ea5edb39d834f943390cfc},
  pages = {400-408},
  title = {A Fast Set Intersection Algorithm for Sorted Sequences.},
  url = {http://www.springerlink.com/index/YTH9H90Y94N10L7E.pdf},
  year = 2004
}