György Turán

131 papers A* 20A 6B 17Misc 4Journal 67Unranked 15
YearRankTypeTitle / Venue / Authors
2026 B conf
A Game for Counting Logic Formula Size and an Application to Linear Orders.
CSL
Gregoire Fournier, György Turán
2025 J jnl
A Game for Counting Logic Formula Size and an Application to Linear Orders.
CoRR
Gregoire Fournier, György Turán
2025 B conf
Interpreting KO Codes.
ISIT
Raj Shekhar, Natasha Devroye, György Turán, Milos Zefran
2025 B conf
On Non-Linearities of Simple Learned AWGN Feedback Codes.
ISIT
Yingyao Zhou, Natasha Devroye, György Turán, Milos Zefran
2025 J jnl
On the Brittleness of LLMs: A Journey around Set Membership.
CoRR
Lea Hergert, Gábor Berend, Mario Szegedy, György Turán, Márk Jelasity
2025 J jnl
Polynomial Threshold Functions of Bounded Tree-Width: Some Explainability and Complexity Aspects.
CoRR
Karine Chubarian, Johnny Joyce, György Turán
2024 — conf
Higher-order Interpretations of Deepcode, a Learned Feedback Code.
Allerton
Yingyao Zhou, Natasha Devroye, György Turán, Milos Zefran
2024 J jnl
Higher-order Interpretations of Deepcode, a Learned Feedback Code.
CoRR
Yingyao Zhou, Natasha Devroye, György Turán, Milos Zefran
2024 B conf
Interpreting Deepcode, a Learned Feedback Code.
ISIT
Yingyao Zhou, Natasha Devroye, György Turán, Milos Zefran
2024 J jnl
Interpreting Deepcode, a learned feedback code.
CoRR
Yingyao Zhou, Natasha Devroye, György Turán, Milos Zefran
2024 J jnl
Iterative Graph Neural Network Enhancement via Frequent Subgraph Mining of Explanations.
CoRR
Harish Naik, Jan Polster, Raj Shekhar, Tamás Horváth, György Turán
2023 — conf
Decomposing the Training of Deep Learned Turbo codes via a Feasible MAP Decoder.
ISTC
Abhijeet Mulgund, Natasha Devroye, György Turán, Milos Zefran
2023 B conf
Interpreting Training Aspects of Deep-Learned Error-Correcting Codes.
ISIT
Natasha Devroye, Abhijeet Mulgund, Raj Shekhar, György Turán, Milos Zefran, Yingyao Zhou
2023 J jnl
Interpreting Training Aspects of Deep-Learned Error-Correcting Codes.
CoRR
Natasha Devroye, Abhijeet Mulgund, Raj Shekhar, György Turán, Milos Zefran, Yingyao Zhou
2022 — conf
Evaluating interpretations of deep-learned error-correcting codes.
Allerton
Abhijeet Mulgund, Raj Shekhar, Natasha Devroye, György Turán, Milos Zefran
2022 B conf
Interpreting Deep-Learned Error-Correcting Codes.
ISIT
Natasha Devroye, Neshat Mohammadi, Abhijeet Mulgund, Harish Naik, Raj Shekhar, György Turán, Yeqi Wei, Milos Zefran
2022 J jnl
Nearest neighbor representations of Boolean functions.
Inf. Comput.
Péter Hajnal, Zhihao Liu, György Turán
2021 J jnl
Preface.
Ann. Math. Artif. Intell.
Andrew S. Gordon, Rob Miller, Leora Morgenstern, György Turán
2020 — conf
Approximating bounded tree-width Bayesian network classifiers with OBDD.
PGM
Karine Chubarian, György Turán
2020 J jnl
Explanation from Specification.
CoRR
Harish Naik, György Turán
2020 Misc conf
Interpretability of Bayesian Network Classifiers: OBDD Approximation and Polynomial Threshold Functions.
ISAIM
Karine Chubarian, György Turán
2020 J jnl
Nearest neighbor representations of Boolean functions.
CoRR
Péter Hajnal, Zhihao Liu, György Turán
2020 A* conf
Understanding the Semantic Content of Sparse Word Embeddings Using a Commonsense Knowledge Base.
AAAI
Vanda Balogh, Gábor Berend, Dimitrios I. Diochnos, György Turán
2018 — ed.
Proceedings of the Thirteenth International Symposium on Commonsense Reasoning, COMMONSENSE 2017, London, UK, November 6-8, 2017.
COMMONSENSE
Andrew S. Gordon, Rob Miller, György Turán
2017 J jnl
Betweenness centrality profiles in trees.
J. Complex Networks
Benjamin Fish, Rahul Kushwaha, György Turán
2017 J jnl
Foreword.
Ann. Math. Artif. Intell.
Lisa Hellerstein, Lev Reyzin, György Turán
2017 J jnl
Foreword.
Theor. Comput. Sci.
Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán
2017 J jnl
Hydras: Directed hypergraphs and Horn formulas.
Theor. Comput. Sci.
Robert H. Sloan, Despina Stasi, György Turán
2017 J jnl
Measuring an artificial intelligence system's performance on a Verbal IQ test for young children.
J. Exp. Theor. Artif. Intell.
Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky
2016 J jnl
Betweenness centrality profiles in trees.
CoRR
Benjamin Fish, Rahul Kushwaha, György Turán
2016 B conf
Characterizability in Horn Belief Revision.
JELIA
Jon Yaggie, György Turán
2015 — conf
Characterizability in Belief Revision.
AAAI Spring Symposia
György Turán, Jon Yaggie
2015 A* conf
Characterizability in Belief Revision.
IJCAI
György Turán, Jon Yaggie
2015 — conf
Cognitive Programming.
AIC
Loizos Michael, Antonis C. Kakas, Rob Miller, György Turán
2015 J jnl
Hydras: Directed Hypergraphs and Horn Formulas.
CoRR
Robert H. Sloan, Despina Stasi, György Turán
2015 J jnl
Measuring an Artificial Intelligence System's Performance on a Verbal IQ Test For Young Children.
CoRR
Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky
2015 A conf
On the Computational Complexity of MapReduce.
DISC
Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán
2014 A conf
Among-site rate variation: adaptation of genetic algorithm mutation rates at each single site.
GECCO
Fatemeh Vafaee, György Turán, Peter C. Nelson, Tanya Y. Berger-Wolf
2014 B conf
Balancing the exploration and exploitation in an adaptive diversity guided genetic algorithm.
IEEE Congress on Evolutionary Computation
Fatemeh Vafaee, György Turán, Peter C. Nelson, Tanya Y. Berger-Wolf
2014 — conf
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal.
DCFS
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán
2014 J jnl
Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal.
CoRR
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán
2014 J jnl
Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201).
Dagstuhl Reports
Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán
2014 J jnl
Non-characterizability of belief revision: an application of finite model theory.
CoRR
György Turán, Jon Yaggie
2014 J jnl
On the Computational Complexity of MapReduce.
CoRR
Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán
2013 — conf
Verbal IQ of a Four-Year Old Achieved by an AI System.
AAAI (Late-Breaking Developments)
Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky
2012 Misc conf
An Approach to Evaluate AI Commonsense Reasoning Systems.
FLAIRS
Stellan Ohlsson, Robert H. Sloan, György Turán, Daniel Uber, Aaron Urasky
2012 A* conf
Horn Belief Contraction: Remainders, Envelopes and Complexity.
KR
Kira V. Adaricheva, Robert H. Sloan, Balázs Szörényi, György Turán
2012 Misc conf
Hydra formulas and directed hypergraphs: A preliminary report.
ISAIM
Despina Stasi, Robert H. Sloan, György Turán
2012 B conf
Hydras: Directed Hypergraphs and Horn Formulas.
WG
Robert H. Sloan, Despina Stasi, György Turán
2012 J jnl
On multiple-instance learning of halfspaces.
Inf. Process. Lett.
Dimitrios I. Diochnos, Robert H. Sloan, György Turán
2012 J jnl
Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs.
Discret. Math. Theor. Comput. Sci.
Robert H. Sloan, Despina Stasi, György Turán
2012 B ed.
SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 21-27, 2012. Proceedings
SOFSEM
Mária Bieliková, Gerhard Friedrich, Georg Gottlob, Stefan Katzenbeisser, György Turán
2011 — conf
Horn Belief Contraction: Remainders, Envelopes and Complexity.
AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning
Kira V. Adaricheva, Robert H. Sloan, Balázs Szörényi, György Turán
2010 J jnl
Finding bipartite subgraphs efficiently.
Inf. Process. Lett.
Dhruv Mubayi, György Turán
2010 J jnl
Guest editors' foreword.
Theor. Comput. Sci.
László Györfi, György Turán, Thomas Zeugmann
2010 J jnl
Horn Upper Bounds and Renaming.
J. Satisf. Boolean Model. Comput.
Marina Langlois, Robert H. Sloan, György Turán
2010 — ch.
Learning Boolean Functions with Queries.
Boolean Models and Methods
Robert H. Sloan, Balázs Szörényi, György Turán, Yves Crama, Peter L. Hammer
2010 — conf
On Approximate Horn Formula Minimization.
ICALP (1)
Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán
2010 A conf
Optimizing genetic operator rates using a markov chain model of genetic algorithms.
GECCO
Fatemeh Vafaee, György Turán, Peter C. Nelson
2009 — conf
Combinatorial Problems for Horn Clauses.
Graph Theory, Computational Intelligence and Thought
Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán
2009 — conf
On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance.
SAGA
Dimitrios I. Diochnos, György Turán
2008 B ed.
Algorithmic Learning Theory, 19th International Conference, ALT 2008, Budapest, Hungary, October 13-16, 2008. Proceedings
ALT
Yoav Freund, László Györfi, György Turán, Thomas Zeugmann
2008 Misc conf
Combinatorial problems for Horn clauses.
ISAIM
Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán
2008 A* conf
Horn Complements: Towards Horn-to-Horn Belief Revision.
AAAI
Marina Langlois, Robert H. Sloan, Balázs Szörényi, György Turán
2008 J jnl
On k-Term DNF with the Largest Number of Prime Implicants.
SIAM J. Discret. Math.
Robert H. Sloan, Balázs Szörényi, György Turán
2008 J jnl
Projective DNF formulae and their revision.
Discret. Appl. Math.
Robert H. Sloan, Balázs Szörényi, György Turán
2007 A conf
Horn Upper Bounds and Renaming.
SAT
Marina Langlois, Robert H. Sloan, György Turán
2007 J jnl
Kalmár Workshop on Logic and Computer Science - Preface.
Acta Cybern.
Ferenc Gécseg, György Turán
2007 J jnl
Revising threshold functions.
Theor. Comput. Sci.
Robert H. Sloan, Balázs Szörényi, György Turán
2007 J jnl
The inverse protein folding problem on 2D and 3D lattices.
Discret. Appl. Math.
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang
2006 — conf
Horn Upper Bounds of Random 3-CNF: A Computational Study.
AI&M
Marina Langlois, Robert H. Sloan, György Turán
2006 — conf
Nearest Neighbor Representations of Boolean Functions.
AI&M
Péter Hajnal, Zhihao Liu, György Turán
2006 A* conf
On Learning and Logic.
COLT
György Turán
2006 J jnl
On set systems with a threshold property.
Discret. Math.
Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán
2006 J jnl
The DNF exception problem.
Theor. Comput. Sci.
Dhruv Mubayi, György Turán, Yi Zhao
2005 J jnl
On k-term DNF with largest number of prime implicants
Electron. Colloquium Comput. Complex.
Robert H. Sloan, Balázs Szörényi, György Turán
2004 J jnl
Learnability and Definability in Trees and Similar Structures.
Theory Comput. Syst.
Martin Grohe, György Turán
2004 B conf
New Revision Algorithms.
ALT
Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
2004 B conf
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.
CPM
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang
2004 J jnl
Theory revision with queries: Horn, read-once, and parity formulas.
Artif. Intell.
Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
2003 A* conf
Projective DNF Formulae and Their Revision.
COLT
Robert H. Sloan, Balázs Szörényi, György Turán
2003 J jnl
Theory Revision with Queries: Horn, Read-once, and Parity Formulas
Electron. Colloquium Comput. Complex.
Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
2002 A conf
Learnability and Definability in Trees and Similar Structures.
STACS
Martin Grohe, György Turán
2002 J jnl
Theory Revision with Queries: DNF Formulas.
Mach. Learn.
Judy Goldsmith, Robert H. Sloan, György Turán
2001 J jnl
Learning logic programs with structured background knowledge.
Artif. Intell.
Tamás Horváth, György Turán
2000 A* conf
Improved Algorithms for Theory Revision with Queries.
COLT
Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
2000 J jnl
Remarks on computational learning theory.
Ann. Math. Artif. Intell.
György Turán
1999 A* conf
On Theory Revision with Queries.
COLT
Robert H. Sloan, György Turán
1998 A* conf
Learning Atomic Formulas with Prescribed Properties.
COLT
Irene Tsapara, György Turán
1998 J jnl
On Frequent Sets of Boolean Matrices.
Ann. Math. Artif. Intell.
Robert H. Sloan, Ken Takata, György Turán
1998 J jnl
On frequent sets of Boolean matrices
Electron. Colloquium Comput. Complex.
Robert H. Sloan, Ken Takata, György Turán
1997 A* conf
Learning Logic Programs by Using the Product Homomorphism Method.
COLT
Tamás Horváth, Robert H. Sloan, György Turán
1997 — conf
Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs.
EuroCOLT
Robert H. Sloan, György Turán
1997 J jnl
Malicious Omissions and Errors in Answers to Membership Queries.
Mach. Learn.
Dana Angluin, Martins Krikis, Robert H. Sloan, György Turán
1997 J jnl
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In.
J. Comput. Syst. Sci.
György Turán, Farrokh Vatan
1996 J jnl
A Size-Depth Trade-Off for the Analog Computation of Boolean Functions.
Inf. Process. Lett.
György Turán, Farrokh Vatan
1996 B conf
Learning Logic Programs with Random Classification Noise.
Inductive Logic Programming Workshop
Tamás Horváth, Robert H. Sloan, György Turán
1995 J jnl
On the Complexity of Planar Boolean Circuits.
Comput. Complex.
György Turán
1994 J jnl
Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts.
Mach. Learn.
Wolfgang Maass, György Turán
1994 A* conf
Learning with Queries but Incomplete Information (Extended Abstract).
COLT
Robert H. Sloan, György Turán
1994 A* conf
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract)
FOCS
György Turán, Farrokh Vatan
1993 J jnl
A Liniear lower bound for the size of threshold circuits.
Bull. EATCS
Hans Dietmar Gröger, György Turán
1993 A* conf
Lower Bounds for PAC Learning with Queries.
COLT
György Turán
1993 J jnl
Threshold Circuits of Bounded Depth.
J. Comput. Syst. Sci.
András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
1993 J jnl
Two Tapes Versus One for Off-Line Turing Machines.
Comput. Complex.
Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán
1992 J jnl
Lower Bound Methods and Separation Results for On-Line Learning Models.
Mach. Learn.
Wolfgang Maass, György Turán
1992 J jnl
The Communication Complexity of Interval Orders.
Discret. Appl. Math.
Ulrich Faigle, Rainer Schrader, György Turán
1991 B conf
A Survey of Some Aspects of Computational Learning Theory (Extended Abstract).
FCT
György Turán
1991 A* conf
On Linear Decision Trees Computing Boolean Functions.
ICALP
Hans Dietmar Gröger, György Turán
1990 A* conf
On the Complexity of Learning from Counterexamples and Membership Queries
FOCS
Wolfgang Maass, György Turán
1990 A* conf
On the Complexity of Learning from Counterexamples and Membership Queries (abstract).
COLT
Wolfgang Maass, György Turán
1989 J jnl
Lower Bounds for Synchronous Circuits and Planar Circuits.
Inf. Process. Lett.
György Turán
1989 B conf
On Restricted Boolean Circuits.
FCT
György Turán
1989 A* conf
On the Complexity of Learning From Counterexamples (Extended Abstract)
FOCS
Wolfgang Maass, György Turán
1989 J jnl
On the performance of on-line algorithms for partition problems.
Acta Cybern.
Ulrich Faigle, Walter Kern, György Turán
1988 A* conf
On the Communication Complexity of Graph Properties
STOC
András Hajnal, Wolfgang Maass, György Turán
1988 J jnl
Resolution Proofs of Generalized Pigeonhole Principles.
Theor. Comput. Sci.
Samuel R. Buss, György Turán
1988 J jnl
Sorting and Recognition Problems for Ordered Sets.
SIAM J. Comput.
Ulrich Faigle, György Turán
1987 J jnl
A Lower Bound for Read-Once-Only Branching Programs.
J. Comput. Syst. Sci.
László Babai, Péter Hajnal, Endre Szemerédi, György Turán
1987 J jnl
On the complexity of cutting-plane proofs.
Discret. Appl. Math.
William J. Cook, Collette R. Coullard, György Turán
1987 J jnl
On the complexity of interval orders and semiorders.
Discret. Math.
Ulrich Faigle, György Turán
1987 J jnl
The Complexity of Defining a Relation on a Finite Graph.
Math. Log. Q.
László Babai, György Turán
1987 A* conf
Threshold circuits of bounded depth
FOCS
András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
1986 J jnl
Searching in Trees, Series-Parallel and Interval Orders.
SIAM J. Comput.
Ulrich Faigle, László Lovász, Rainer Schrader, György Turán
1986 A* conf
Two lower bounds for branching programs
STOC
Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán
1985 A conf
Sorting and Recognition Problems for Ordered Sets.
STACS
Ulrich Faigle, György Turán
1984 J jnl
On the definability of properties of finite graphs.
Discret. Math.
György Turán
1984 J jnl
On the succinct representation of graphs.
Discret. Appl. Math.
György Turán
1984 J jnl
The Critical Complexity of Graph Properties.
Inf. Process. Lett.
György Turán
1983 J jnl
On the complexity of graph grammars.
Acta Cybern.
György Turán
1981 B conf
On Cellular Graph-Automata and Second-Order Definable Graph-Properties.
FCT
György Turán