Gyula O. H. Katona

According to our database1, Gyula O. H. Katona authored at least 75 papers between 1974 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2021
The domination number of the graph defined by two levels of the n-cube, II.
Eur. J. Comb., 2021

2020
Preface: 2nd Russian-Hungarian Combinatorial Workshop.
Discret. Appl. Math., 2020

2019
The domination number of the graph defined by two levels of the n-cube.
Discret. Appl. Math., 2019

Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets.
CoRR, 2019

2018
Results on the Wiener profile.
AKCE Int. J. Graphs Comb., 2018

2017
Preface.
Electron. Notes Discret. Math., 2017

Around the Complete Intersection Theorem.
Discret. Appl. Math., 2017

Preface: Levon Khachatrian's legacy in extremal combinatorics.
Discret. Appl. Math., 2017

2015
Incomparable Copies of a Poset in the Boolean Lattice.
Order, 2015

Union-Intersecting Set Systems.
Graphs Comb., 2015

2014
A coding problem for pairs of subsets.
Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014

2013
Two-colorings with many monochromatic cliques in both colors.
J. Comb. Theory, Ser. B, 2013

Color the cycles.
Discret. Math., 2013

Sperner type theorems with excluded subposets.
Discret. Appl. Math., 2013

Majority and plurality problems.
Discret. Appl. Math., 2013

Search When the Lie Depends on the Target.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Memories on Shadows and Shadows of Memories.
Proceedings of the Mathematics of Paul Erdős II, 2013

2012
Erdös-Ko-Rado from intersecting shadows.
Discuss. Math. Graph Theory, 2012

Minimum average-case queries of q+1-ary search game with small sets.
Discret. Appl. Math., 2012

Most Probably Intersecting Families of Subsets.
Comb. Probab. Comput., 2012

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

Encoding Databases Satisfying a Given Set of Dependencies.
Proceedings of the Foundations of Information and Knowledge Systems, 2012

Random Databases with Correlated Data.
Proceedings of the Conceptual Modelling and Its Theoretical Foundations, 2012

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

2008
Bounds on Maximal Families of Sets Not Containing Three Sets with <i>A</i> INTERSECTION <i>B</i> SUBSET OF <i>C</i> , <i>A</i> NOT A SUBSET OF <i>B</i>.
Order, 2008

No four subsets forming an N.
J. Comb. Theory, Ser. A, 2008

Functional dependencies distorted by errors.
Discret. Appl. Math., 2008

Random Geometric Identification.
Proceedings of the Foundations of Information and Knowledge Systems, 2008

2007
Largest Families Without an <i>r</i> -Fork.
Order, 2007

2006
Forbidden inclusion patterns in families of subsets.
Electron. Notes Discret. Math., 2006

2-Bases of Quadruples.
Comb. Probab. Comput., 2006

On the security of individual data.
Ann. Math. Artif. Intell., 2006

Some Contributions to the Minimum Representation Problem of Key Systems.
Proceedings of the Foundations of Information and Knowledge Systems, 2006

On the Number of Independent Functional Dependencies.
Proceedings of the Foundations of Information and Knowledge Systems, 2006

2005
Two-Part and <i>k</i>-Sperner Families: New Proofs Using Permutations.
SIAM J. Discret. Math., 2005

Largest family without <i>A</i> union <i>B</i> subset of <i>C</i> intersection <i>D</i>.
J. Comb. Theory, Ser. A, 2005

Preface.
Discret. Math., 2005

Constructions via Hamiltonian Theorems.
Discret. Math., 2005

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

Strong qualitative independence.
Discret. Appl. Math., 2004

2003
A coding problem for pairs of subsets.
Electron. Notes Discret. Math., 2003

2002
On the average size of sets in intersecting Sperner families.
Discret. Math., 2002

Functional Dependencies in Presence of Errors.
Proceedings of the Foundations of Information and Knowledge Systems, 2002

2001
Intersecting Balanced Families of Sets.
J. Comb. Theory, Ser. A, 2001

Pairs of Disjoint q-element Subsets Far from Each Other.
Electron. J. Comb., 2001

Semantics in Databases.
Proceedings of the Semantics in Databases, 2001

2000
Error-Correcting Keys in Relational Databases.
Proceedings of the Foundations of Information and Knowledge Systems, 2000

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

1998
Asymptotic Properties of Keys and Functional Dependencies in Random Databases.
Theor. Comput. Sci., 1998

A Simple Proof of a Theorem of Milner.
J. Comb. Theory, Ser. A, 1998

1997
Extremal problems for finite sets and convex hulls - A survey.
Discret. Math., 1997

1996
Preface.
Discret. Math., 1996

1995
The Average Length of Keys and Functional Dependencies in (Random) Databases.
Proceedings of the Database Theory, 1995

1993
Optimization of the reliability polynomial in presence of mediocre elements.
Networks, 1993

Greedy Construction of Nearly Regular Graphs.
Eur. J. Comb., 1993

The largest component in a random subgraph of the n-cycle.
Discret. Math., 1993

A Survey of Some Combinatorial Results Concerning Functional Dependencies in Database Relations.
Ann. Math. Artif. Intell., 1993

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

Partial Dependencies in Relational Databases and their Realization.
Discret. Appl. Math., 1992

Combinatorial and Algebraic Results for Database Relations.
Proceedings of the Database Theory, 1992

1991
On the Number of Databases and Closure Operations.
Theor. Comput. Sci., 1991

1987
Extremal Combinatorial Problems of Database Models.
Proceedings of the MFDBS 87, 1987

1986
All maximum 2-part Sperner families.
J. Comb. Theory, Ser. A, 1986

Convex hulls of more-part Sperner families.
Graphs Comb., 1986

1985
Polytopes Determined by Hypergraph Classes.
Eur. J. Comb., 1985

Minimum matrix representation of closure operations.
Discret. Appl. Math., 1985

Extremal hypergraph problems and convex hulls.
Comb., 1985

1984
Intersecting Sperner families and their convex hulls.
Comb., 1984

1981
Sums of Vectors and Turán's Problem for 3-graphs.
Eur. J. Comb., 1981

Extremal Combinatorial Problems in Relational Data Base.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
On the number of maximal dependencies in a data base relation of fixed order.
Discret. Math., 1980

1979
Obituary.
J. Comb. Theory, Ser. B, 1979

1977
Contributions to the geometry of hamming spaces.
Discret. Math., 1977

1976
Huffman codes and self-information.
IEEE Trans. Inf. Theory, 1976

1974
Solution of a Problem of A. Ehrenfeucht and J. Mycielski.
J. Comb. Theory, Ser. A, 1974


  Loading...