On the number of databases and closure operations

Authors:
G. Burosch;J. Demetrovics;G. O. H. Katona;D. J. Kleitman;A. A. Sapozhenko
Affiliations:
Wilhelm Pieck Univ., Rostock, Germany;Hungarian Academy of Sciences, Budapest, Hungary;Hungarian Academy of Sciences, Budapest, Hungary;Massachusetts Institute of Technology, Cambridge;Moskow State Univ., Moscow, USSR
Venue:
Theoretical Computer Science
Year:
1991

Kleitman and combinatorics

Discrete Mathematics - Kleitman and combinatorics: a celebration
The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey

Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Counting of moore families for n=7

ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Relationship design using spreadsheet reasoning for sets of functional dependencies

ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Recursive decomposition and bounds of the lattice of Moore co-families

Annals of Mathematics and Artificial Intelligence

Hi-index	5.23