S. Moens, E. Aksehirli, and B. Goethals, Frequent Itemset Mining for Big Data, 2013 IEEE International Conference on Big Data, 2013.
DOI : 10.1109/BigData.2013.6691742

A. Gainaru, F. Cappello, S. Trausan-matu, and B. Kramer, Event Log Mining Tool for Large Scale HPC Systems, Proceedings of Euro-Par'11, 2011.
DOI : 10.1007/978-3-540-87481-2_41

W. Xu, L. Huang, A. Fox, D. Patterson, and M. Jordan, Mining console logs for large-scale system problem detection, Proceedings of SysML'08, 2008.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering Frequent Closed Itemsets for Association Rules, Proceedings of ICDT'99, 1999.
DOI : 10.1007/3-540-49257-7_25

URL : https://hal.archives-ouvertes.fr/hal-00467747

K. Chen, L. Zhang, S. Li, and W. Ke, Research on Association Rules Parallel Algorithm Based on FP-Growth, Proceedings of the ICICA'11, 2011.
DOI : 10.1023/B:DAMI.0000005258.31418.83

J. Dean and S. Ghemawat, MapReduce, Communications of the ACM, vol.51, issue.1, 2008.
DOI : 10.1145/1327452.1327492

M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, Spark: Cluster computing with working sets, Proceedings of USENIX, HotCloud'10, 2010.

S. Wang, Y. Yang, Y. Gao, G. Chen, and Y. Zhang, MapReduce-based Closed Frequent Itemset Mining with Efficient Redundancy Filtering, 2012 IEEE 12th International Conference on Data Mining Workshops, 2012.
DOI : 10.1109/ICDMW.2012.24

R. Osmar, M. Za¨?aneza¨?ane, P. El-hajj, and . Lu, Fast parallel association rule mining without candidacy generation, Proceedings of IEEE'01 ICDM, 2001.

E. Li and L. Liu, Optimization of frequent itemset mining on multiple-core processor, Proceedings of VLDB'07, 2007.

H. Li, Y. Wang, D. Zhang, M. Zhang, and E. Y. Chang, Pfp, Proceedings of the 2008 ACM conference on Recommender systems, RecSys '08, 2008.
DOI : 10.1145/1454008.1454027

J. Wang, J. Han, and J. Pei, CLOSET+, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, 2003.
DOI : 10.1145/956750.956779

C. Lucchese, S. Orlando, and R. Perego, Fast and memory efficient mining of frequent closed itemsets, IEEE Transactions on Knowledge and Data Engineering, vol.18, issue.1, 2006.
DOI : 10.1109/TKDE.2006.10

B. Négrevergne, A. Termier, J. Méhaut, and T. Uno, Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses, 2010 International Conference on High Performance Computing & Simulation, pp.521-528, 2010.
DOI : 10.1109/HPCS.2010.5547082

T. Uno, T. Asai, Y. Uchida, and H. Arimura, LCM: an efficient algorithm for enumerating frequent closed item sets, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 2003.

S. Wang and L. Wang, An implementation of fp-growth algorithm based on high level data structures of weka-jung framework, J. JCIT, 2010.

N. Christophe, Efficient binary polynomial multiplication based on optimized karatsuba reconstruction, J. Cryptographic Engineering, 2014.

A. Zanoni, Iterative Toom-Cook methods for very unbalanced long integer multiplication, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, 2010.
DOI : 10.1145/1837934.1837995