# György Turán

According to our database1, György Turán authored at least 96 papers between 1981 and 2022.

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

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2022
Nearest neighbor representations of Boolean functions.
Inf. Comput., 2022

Interpreting Deep-Learned Error-Correcting Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Evaluating interpretations of deep-learned error-correcting codes.
Proceedings of the 58th Annual Allerton Conference on Communication, 2022

2021
Preface.
Ann. Math. Artif. Intell., 2021

2020
Explanation from Specification.
CoRR, 2020

Approximating bounded tree-width Bayesian network classifiers with OBDD.
Proceedings of the International Conference on Probabilistic Graphical Models, 2020

Interpretability of Bayesian Network Classifiers: OBDD Approximation and Polynomial Threshold Functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

Understanding the Semantic Content of Sparse Word Embeddings Using a Commonsense Knowledge Base.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2017
Hydras: Directed hypergraphs and Horn formulas.
Theor. Comput. Sci., 2017

Foreword.
Theor. Comput. Sci., 2017

Measuring an artificial intelligence system's performance on a Verbal IQ test for young children.
J. Exp. Theor. Artif. Intell., 2017

Betweenness centrality profiles in trees.
J. Complex Networks, 2017

Foreword.
Ann. Math. Artif. Intell., 2017

2016
Characterizability in Horn Belief Revision.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

2015
On the Computational Complexity of MapReduce.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Cognitive Programming.
Proceedings of the 3rd International Workshop on Artificial Intelligence and Cognition, 2015

Characterizability in Belief Revision.
Proceedings of the 2015 AAAI Spring Symposia, 2015

2014
Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201).
Dagstuhl Reports, 2014

Non-characterizability of belief revision: an application of finite model theory.
CoRR, 2014

Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal.
CoRR, 2014

Among-site rate variation: adaptation of genetic algorithm mutation rates at each single site.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Biclique Coverings, Rectifier Networks and the Cost of ε-Removal.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

Balancing the exploration and exploitation in an adaptive diversity guided genetic algorithm.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

2013
Verbal IQ of a Four-Year Old Achieved by an AI System.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012
On multiple-instance learning of halfspaces.
Inf. Process. Lett., 2012

Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs.
Discret. Math. Theor. Comput. Sci., 2012

Hydra formulas and directed hypergraphs: A preliminary report.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

An Approach to Evaluate AI Commonsense Reasoning Systems.
Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference, 2012

2011
Horn Belief Contraction: Remainders, Envelopes and Complexity.
Proceedings of the Logical Formalizations of Commonsense Reasoning, 2011

2010
Guest editors' foreword.
Theor. Comput. Sci., 2010

Horn Upper Bounds and Renaming.
J. Satisf. Boolean Model. Comput., 2010

Finding bipartite subgraphs efficiently.
Inf. Process. Lett., 2010

On Approximate Horn Formula Minimization.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Optimizing genetic operator rates using a markov chain model of genetic algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Learning Boolean Functions with Queries.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

2009
On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

Combinatorial Problems for Horn Clauses.
Proceedings of the Graph Theory, 2009

2008
On k-Term DNF with the Largest Number of Prime Implicants.
SIAM J. Discret. Math., 2008

Projective DNF formulae and their revision.
Discret. Appl. Math., 2008

Horn Complements: Towards Horn-to-Horn Belief Revision.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Revising threshold functions.
Theor. Comput. Sci., 2007

The inverse protein folding problem on 2D and 3D lattices.
Discret. Appl. Math., 2007

Kalmár Workshop on Logic and Computer Science - Preface.
Acta Cybern., 2007

2006
The DNF exception problem.
Theor. Comput. Sci., 2006

On set systems with a threshold property.
Discret. Math., 2006

Horn Upper Bounds of Random 3-CNF: A Computational Study.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2006

On Learning and Logic.
Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2004
Learnability and Definability in Trees and Similar Structures.
Theory Comput. Syst., 2004

Theory revision with queries: Horn, read-once, and parity formulas.
Artif. Intell., 2004

The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

New Revision Algorithms.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2002
Theory Revision with Queries: DNF Formulas.
Mach. Learn., 2002

2001
Learning logic programs with structured background knowledge.
Artif. Intell., 2001

2000
Remarks on computational learning theory.
Ann. Math. Artif. Intell., 2000

Improved Algorithms for Theory Revision with Queries.
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999
On Theory Revision with Queries.
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998
On Frequent Sets of Boolean Matrices.
Ann. Math. Artif. Intell., 1998

Learning Atomic Formulas with Prescribed Properties.
Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

1997
Malicious Omissions and Errors in Answers to Membership Queries.
Mach. Learn., 1997

On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In.
J. Comput. Syst. Sci., 1997

Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

Learning Logic Programs by Using the Product Homomorphism Method.
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

1996
A Size-Depth Trade-Off for the Analog Computation of Boolean Functions.
Inf. Process. Lett., 1996

Learning Logic Programs with Random Classification Noise.
Proceedings of the Inductive Logic Programming, 6th International Workshop, 1996

1995
On the Complexity of Planar Boolean Circuits.
Comput. Complex., 1995

1994
Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts.
Mach. Learn., 1994

On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract)
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Learning with Queries but Incomplete Information (Extended Abstract).
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993
Threshold Circuits of Bounded Depth.
J. Comput. Syst. Sci., 1993

A Liniear lower bound for the size of threshold circuits.
Bull. EATCS, 1993

Two Tapes Versus One for Off-Line Turing Machines.
Comput. Complex., 1993

Lower Bounds for PAC Learning with Queries.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992
Lower Bound Methods and Separation Results for On-Line Learning Models.
Mach. Learn., 1992

The Communication Complexity of Interval Orders.
Discret. Appl. Math., 1992

1991
On Linear Decision Trees Computing Boolean Functions.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

A Survey of Some Aspects of Computational Learning Theory (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
On the Complexity of Learning from Counterexamples and Membership Queries
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

On the Complexity of Learning from Counterexamples and Membership Queries (abstract).
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989
Lower Bounds for Synchronous Circuits and Planar Circuits.
Inf. Process. Lett., 1989

On the performance of on-line algorithms for partition problems.
Acta Cybern., 1989

On the Complexity of Learning From Counterexamples (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

On Restricted Boolean Circuits.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
Resolution Proofs of Generalized Pigeonhole Principles.
Theor. Comput. Sci., 1988

Sorting and Recognition Problems for Ordered Sets.
SIAM J. Comput., 1988

On the Communication Complexity of Graph Properties
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987
The Complexity of Defining a Relation on a Finite Graph.
Math. Log. Q., 1987

A Lower Bound for Read-Once-Only Branching Programs.
J. Comput. Syst. Sci., 1987

On the complexity of interval orders and semiorders.
Discret. Math., 1987

On the complexity of cutting-plane proofs.
Discret. Appl. Math., 1987

1986
Searching in Trees, Series-Parallel and Interval Orders.
SIAM J. Comput., 1986

Two lower bounds for branching programs
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1984
The Critical Complexity of Graph Properties.
Inf. Process. Lett., 1984

On the definability of properties of finite graphs.
Discret. Math., 1984

On the succinct representation of graphs.
Discret. Appl. Math., 1984

1983
On the complexity of graph grammars.
Acta Cybern., 1983

1981
On Cellular Graph-Automata and Second-Order Definable Graph-Properties.
Proceedings of the Fundamentals of Computation Theory, 1981