János Demetrovics

Ákos Gubán

Proceedings of the Local Proceedings of the Fifth Balkan Conference in Informatics, 2012, 2012

2008

Functional dependencies distorted by errors.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2006

On the security of individual data.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2006

On the Number of Independent Functional Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2006

Relationship Design Using Spreadsheet Reasoning for Sets of Functional Dependencies.

[BibT_eX]

[DOI]

András J. Molnár

Bernhard Thalheim

Proceedings of the Advances in Databases and Information Systems, 2006

2004

Graphical Reasoning for Sets of Functional Dependencies.

[BibT_eX]

[DOI]

András J. Molnár

Bernhard Thalheim

Proceedings of the Conceptual Modeling, 2004

2002

Functional Dependencies in Presence of Errors.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2002

2000

Error-Correcting Keys in Relational Databases.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2000

Low Discrepancy Allocation of Two-Dimensional Data.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2000

1999

Describing Candidate Keys by Hypergraphs.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1999

On 1-Representations of Integers.

[BibT_eX]

[DOI]

Attila Pethö

Acta Cybern., 1999

1998

Asymptotic Properties of Keys and Functional Dependencies in Random Databases.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

1996

Some Results About Normal Forms for Functional Dependency in the Relational Datamodel.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Spreadsheet-Based Model Building and Multiple Criteria Group Evaluation Support.

[BibT_eX]

Miklós Biró

Tibor Remzsö

Proceedings of the Proccedings of the Workshop Challenges of Application and Challenges of Design, 1996

1995

Some Observations on the Minimal Armstrong Relations for Normalised Relation Schemes.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1995

Armstrong Relations, Functional Dependencies and Strong Dependencies.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1995

Some Remarks On Generating Armstrong And Inferring Functional Dependencies Relation.

[BibT_eX]

[DOI]

Acta Cybern., 1995

The Average Length of Keys and Functional Dependencies in (Random) Databases.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 1995

1994

Normal Forms and Minimal Keys in the Relational Datamodel.

[BibT_eX]

[DOI]

Acta Cybern., 1994

Enumeration of Function and Bases of Three-Valued Set Logic under compositions with Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE International Symposium on Multiple-Valued Logic, 1994

1993

Some Problems Concerning Keys for Relation Schemes and Relations in the Relational Datamodel.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Functional Dependencies among Boolean Dependencies.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1993

A Survey of Some Combinatorial Results Concerning Functional Dependencies in Database Relations.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1993

Some Problems Concerning Armstrong Relations of Dual Schemes and Relation Schemes in the Relational Datamodel.

[BibT_eX]

[DOI]

Acta Cybern., 1993

1992

Functional Dependencies in Relational Databases: A Lattice Point of View.

[BibT_eX]

[DOI]

Leonid Libkin

Ilya B. Muchnik

Discret. Appl. Math., 1992

The Characterization of Branching Dependencies.

[BibT_eX]

[DOI]

Attila Sali

Discret. Appl. Math., 1992

Partial Dependencies in Relational Databases and their Realization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

A Note on Intersection of Isotone Clones.

[BibT_eX]

[DOI]

Acta Cybern., 1992

Normal Form Relation Schemes: A New Characterization.

[BibT_eX]

[DOI]

Acta Cybern., 1992

On the Interaction Between Closure Operations and Choice Functions with Applications to Relational Database.

[BibT_eX]

[DOI]

Acta Cybern., 1992

On the Composition and Decomposition of Attributes and Tuples.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 1992

1991

On the Number of Databases and Closure Operations.

[BibT_eX]

[DOI]

Alexander A. Sapozhenko

Theor. Comput. Sci., 1991

On Relational Database Schemes Having Unique Minimal Key.

[BibT_eX]

J. Inf. Process. Cybern., 1991

On the Representation of Dependencies by Propositional Logic.

[BibT_eX]

[DOI]

Proceedings of the MFDBS 91, 1991

1990

Intersections of Isotone Clones on a Finite Set.

[BibT_eX]

[DOI]

Proceedings of the 20th International Symposium on Multiple-Valued Logic, 1990

1989

Functional Dependencies and the Semilattice of Closed Classes.

[BibT_eX]

[DOI]

Leonid Libkin

Ilya B. Muchnik

Proceedings of the MFDBS 89, 1989

1988

On Keys in the Relational Data Model.

[BibT_eX]

J. Inf. Process. Cybern., 1988

Relations and minimal keys.

[BibT_eX]

[DOI]

Acta Cybern., 1988

Some results about functional dependencies.

[BibT_eX]

[DOI]

Acta Cybern., 1988

LATOR - a Database Management System for Local Networks.

[BibT_eX]

Proceedings of the Artificial Intelligence III: Methodology, Systems, Applications, 1988

1987

Construction of Large Sets of Clones.

[BibT_eX]

[DOI]

László Hannák

Math. Log. Q., 1987

Translation of Relation Schemes, Balanced Relation Schemes and the Problem of Key Representation.

[BibT_eX]

J. Inf. Process. Cybern., 1987

Extremal Combinatorial Problems of Database Models.

[BibT_eX]

[DOI]

Proceedings of the MFDBS 87, 1987

On Transformation Properties of Conceptual Structures.

[BibT_eX]

Ágnes Hernádi

Proceedings of the Methodologies for Intelligent Systems, 1987

1986

Computer-Aided Specification Techniques

[BibT_eX]

[DOI]

Péter Radó

World Scientific Series in Computer Science 1, World Scientific, ISBN: 978-981-4507-98-1, 1986

Information System Design: Techniques and Software Support - Response.

[BibT_eX]

Ágnes Hernádi

Proceedings of the Information Processing 86, 1986

1985

Minimum matrix representation of closure operations.

[BibT_eX]

[DOI]

Zoltán Füredi

Discret. Appl. Math., 1985

1983

Some generalized type functional dependencies formalized as equality set on matrices.

[BibT_eX]

[DOI]

Gy. Gyepesi

Discret. Appl. Math., 1983

A note on minimal matrix representation of closure operations.

[BibT_eX]

[DOI]

Gy. Gyepesi

Comb., 1983

1982

Specification Meta Systems.

[BibT_eX]

[DOI]

Péter Radó

Computer, 1982

1981

On the functional dependency and some generalizations of it.

[BibT_eX]

[DOI]

Gy. Gyepesi

Acta Cybern., 1981

Extremal Combinatorial Problems in Relational Data Base.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Candidate Keys and Antichains.

[BibT_eX]

[DOI]

SIAM J. Algebraic Discret. Methods, 1980

On the number of maximal dependencies in a data base relation of fixed order.

[BibT_eX]

[DOI]

Discret. Math., 1980

1979

Contribution to the theory of data base relations.

[BibT_eX]

[DOI]

A. Békéssy

Discret. Math., 1979

The cardinality of closed sets in pre-complete classes in k-valued logics.

[BibT_eX]

[DOI]

László Hannák

Acta Cybern., 1979

On the equivalence of candidate keys with Sperner systems.

[BibT_eX]

[DOI]

Acta Cybern., 1979

1978

On the Number of Candidate Keys.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1978

On the main diagonal of sheffer functions.

[BibT_eX]

[DOI]

Discret. Math., 1978

1976

On the comparison of limit-logics by the simulation of finite-valued logic (in Russian).

[BibT_eX]

[DOI]

Acta Cybern., 1976

1972

On cardinal numbers of sets of precomplete classes in limit-logics (in Russian).

[BibT_eX]

[DOI]