Attila Sali

Orcid: 0000-0002-4837-6360

According to our database1, Attila Sali authored at least 63 papers between 1983 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Approximate Keys and Functional Dependencies in Incomplete Databases With Limited Domains-Algorithmic Perspective.
CoRR, 2024

Approximate Integrity Constraints in Incomplete Databases With Limited Domains.
CoRR, 2024

Minimal Armstrong Databases for Cardinality Constraints.
Proceedings of the Foundations of Information and Knowledge Systems, 2024

2023
Multivalued matrices and forbidden configurations.
Discret. Math., September, 2023

Refined Fuzzy Profile Matching.
Acta Cybern., September, 2023

2022
Turán number of special four cycles in triple systems.
Discret. Math., 2022

Approximate Keys and Functional Dependencies in Incomplete Databases with Limited Domains.
Proceedings of the Foundations of Information and Knowledge Systems, 2022

2021
Toward an Axiomatization of Strongly Possible Functional Dependencies.
Vietnam. J. Comput. Sci., 2021

Partitioning Transitive Tournaments into Isomorphic Digraphs.
Order, 2021

Exponential multivalued forbidden configurations.
Discret. Math. Theor. Comput. Sci., 2021

2020
Strongly Possible Keys for SQL.
J. Data Semant., 2020

Multi-symbol forbidden configurations.
Discret. Appl. Math., 2020

Functional Dependencies in Incomplete Databases with Limited Domains.
Proceedings of the Foundations of Information and Knowledge Systems, 2020

New lower and upper bounds on Armstrong codes.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019
Keys in Relational Databases with Nulls and Bounded Domains.
Proceedings of the Advances in Databases and Information Systems, 2019

2018
Accurate and efficient profile matching in knowledge bases.
Data Knowl. Eng., 2018

Refining Semantic Matching for Job Recruitment: An Application of Formal Concept Analysis.
Proceedings of the Foundations of Information and Knowledge Systems, 2018

Recent Developments in Armstrong Codes.
Proceedings of the Models: Concepts, Theory, Logic, Reasoning and Semantics, 2018

2017
Forbidden Families of Minimal Quadratic and Cubic Configurations.
Electron. J. Comb., 2017

2016
Maintenance of Profile Matchings in Knowledge Bases.
Proceedings of the Model and Data Engineering - 6th International Conference, 2016

Semantic Matching Strategies for Job Recruitment: A Comparison of New and Known Approaches.
Proceedings of the Foundations of Information and Knowledge Systems, 2016

2015
Preface.
Ann. Math. Artif. Intell., 2015

2014
Forbidden Configurations and Product Constructions.
Graphs Comb., 2014

Note on the size of binary Armstrong codes.
Des. Codes Cryptogr., 2014

2013
Preface.
Electron. Notes Discret. Math., 2013

2012
Optimal Multivalued Shattering.
SIAM J. Discret. Math., 2012

Some new bounds on partition critical hypergraphs.
Eur. J. Comb., 2012

Evidence for a forbidden configuration conjecture: One more case solved.
Discret. Math., 2012

On the distance of databases.
Ann. Math. Artif. Intell., 2012

2011
Preface.
Electron. Notes Discret. Math., 2011

Forbidden Configurations: Boundary Cases.
Electron. Notes Discret. Math., 2011

Weak Functional Dependencies on Trees with Restructuring.
Acta Cybern., 2011

2010
Coding Theory Motivated by Relational Databases.
Proceedings of the Semantics in Data and Knowledge Bases - 4th International Workshops, 2010

On the Distance of Databases.
Proceedings of the Foundations of Information and Knowledge Systems, 2010

2009
A Characterisation of Coincidence Ideals for Complex Values.
J. Univers. Comput. Sci., 2009

Partition Critical Hypergraphs.
Electron. Notes Discret. Math., 2009

2008
Guest Editors' Foreword.
Discret. Math., 2008

Keys and Armstrong Databases in Trees with Restructuring.
Acta Cybern., 2008

On the Existence of Armstrong Instances with Bounded Domains.
Proceedings of the Foundations of Information and Knowledge Systems, 2008

2007
SPT(q, k, n)-Codes.
Electron. Notes Discret. Math., 2007

Latin squares and low discrepancy allocation of two-dimensional data.
Eur. J. Comb., 2007

2006
Counter-Free Keys and Functional Dependencies in Higher-Order Datamodels.
Fundam. Informaticae, 2006

2005
Small Forbidden Configurations IV: The 3 Rowed Case.
Comb., 2005

2004
New type of coding problem motivated by database theory.
Discret. Appl. Math., 2004

Minimal Keys in Higher-Order Datamodels.
Proceedings of the Foundations of Information and Knowledge Systems, 2004

2002
Shattering News.
Graphs Comb., 2002

2001
Small Forbidden Configurations II.
Electron. J. Comb., 2001

2000
Low Discrepancy Allocation of Two-Dimensional Data.
Proceedings of the Foundations of Information and Knowledge Systems, 2000

1999
Orientations of Self-complementary Graphs and the Relation of Sperner and Shannon Capacities.
Eur. J. Comb., 1999

1998
Intersecting set systems and graphic matroids<sup>, </sup>.
Discret. Math., 1998

Generalized Dependencies in Relational Databases.
Acta Cybern., 1998

1997
Small Forbidden Configurations.
Graphs Comb., 1997

Sperner families of bounded VC-dimension.
Discret. Math., 1997

Recovering Set Systems and Graph Entropy.
Comb. Probab. Comput., 1997

Oriented list colouring of undirected graphs.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996
On the Problem of Dimension Versus Size for Lattices.
Eur. J. Comb., 1996

Preface.
Discret. Math., 1996

1994
On the Rigidity of Spherical t-Designs that Are Orbits of Finite Reflection Groups.
Des. Codes Cryptogr., 1994

1992
The Characterization of Branching Dependencies.
Discret. Appl. Math., 1992

Some intersection theorems.
Comb., 1992

1988
A note on convex hulls of more-part sperner families.
J. Comb. Theory A, 1988

Constructions of ranked posets.
Discret. Math., 1988

1983
Stronger Form of an M-Part Sperner Theorem.
Eur. J. Comb., 1983


  Loading...