F. Distel and B. Sertkaya, On the complexity of enumerating pseudo-intents, Discrete Applied Mathematics, vol.159, issue.6, pp.450-466, 2011.
DOI : 10.1016/j.dam.2010.12.004

S. O. Kuznetsov, On the Intractability of Computing the Duquenne-Guigues Base, J. UCS, vol.10, issue.8, pp.927-933, 2004.

J. David, L. Lhote, A. Mary, and F. Rioult, An average study of hypergraphs and their minimal transversals, Theoretical Computer Science, vol.596, pp.124-141, 2015.
DOI : 10.1016/j.tcs.2015.06.052
URL : https://hal.archives-ouvertes.fr/hal-01086638

B. Ganter and R. Wille, Formal Concept Analysis -Mathematical Foundations, 1999.

V. Duquenne and J. L. Guigues, Familles Minimales d'Implications Informatives Résultant d'un Tableau de Données Binaires, Mathématiques et Sciences Humaines, vol.95, pp.5-18, 1986.

K. Bertet and B. Monjardet, The multiple facets of the canonical direct unit implicational basis, Theoretical Computer Science, vol.411, issue.22-24, pp.22-242155, 2010.
DOI : 10.1016/j.tcs.2009.12.021
URL : https://hal.archives-ouvertes.fr/halshs-00308798

U. Ryssel, F. Distel, and D. Borchmann, Fast algorithms for implication bases and attribute exploration using proper premises, Annals of Mathematics and Artificial Intelligence, vol.21, issue.4, pp.25-53, 2014.
DOI : 10.1137/060653032

P. Erdos and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci, vol.5, issue.1, pp.17-60, 1960.

O. Sergei, S. A. Kuznetsov, and . Obiedkov, Comparing performance of algorithms for generating concept lattices, J. Exp. Theor. Artif. Intell, vol.14, issue.2-3, pp.189-216, 2002.

D. Borchmann and T. Hanika, Some experimental results on randomly generating formal contexts, Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, pp.57-69, 2016.

D. Borchmann, Decomposing finite closure operators by attribute exploration, ICFCA 2011, Supplementary Proceedings, 2011.

B. Ganter, Random extents and random closure systems, Proceedings of The Eighth International Conference on Concept Lattices and Their Applications, pp.309-318, 2011.

A. Rimsa, M. A. Song, and L. E. Zárate, SCGaz - A Synthetic Formal Context Generator with Density Control for Test and Evaluation of FCA Algorithms, 2013 IEEE International Conference on Systems, Man, and Cybernetics, pp.3464-3470, 2013.
DOI : 10.1109/SMC.2013.591

L. Lhote, F. Rioult, and A. Soulet, Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases, Fifth IEEE International Conference on Data Mining (ICDM'05), pp.713-716, 2005.
DOI : 10.1109/ICDM.2005.31
URL : https://hal.archives-ouvertes.fr/hal-00324691

R. Emilion and G. Lévy, Size of random Galois lattices and number of closed frequent itemsets, Discrete Applied Mathematics, vol.157, issue.13, pp.2945-2957, 2009.
DOI : 10.1016/j.dam.2009.02.025

F. Lehmann and R. Wille, A triadic approach to formal concept analysis, Conceptual Structures: Applications, Implementation and Theory, Third International Conference on Conceptual Structures, ICCS '95 Proceedings, pp.32-43, 1995.
DOI : 10.1007/3-540-60161-9_27
URL : http://xa.yimg.com/kq/groups/19999070/433120059/name/Ali-1.pdf