György Turán

Publication Activity (10 Years)

Years Active: 1981-2024
Publications (10 Years): 21

Top Venues

CoRR

ISIT

Ann. Math. Artif. Intell.

Theor. Comput. Sci.

Publications

Yingyao Zhou, Natasha Devroye, György Turán, Milos Zefran
Interpreting Deepcode, a learned feedback code. CoRR (2024)
Harish Naik, Jan Polster, Raj Shekhar, Tamás Horváth, György Turán
Iterative Graph Neural Network Enhancement via Frequent Subgraph Mining of Explanations. CoRR (2024)
Abhijeet Mulgund, Natasha Devroye, György Turán, Milos Zefran
Decomposing the Training of Deep Learned Turbo codes via a Feasible MAP Decoder. ISTC (2023)
Natasha Devroye, Abhijeet Mulgund, Raj Shekhar, György Turán, Milos Zefran, Yingyao Zhou
Interpreting Training Aspects of Deep-Learned Error-Correcting Codes. ISIT (2023)
Natasha Devroye, Abhijeet Mulgund, R. Shekhar, György Turán, Milos Zefran, Y. Zhou
Interpreting Training Aspects of Deep-Learned Error-Correcting Codes. CoRR (2023)
A. Mulgund, R. Shekhar, Natasha Devroye, György Turán, M. Zefran
Evaluating interpretations of deep-learned error-correcting codes. Allerton (2022)
Péter Hajnal, Zhihao Liu, György Turán
Nearest neighbor representations of Boolean functions. Inf. Comput. 285 (Part) (2022)
Natasha Devroye, N. Mohammadi, A. Mulgund, Harish Naik, R. Shekhar, György Turán, Y. Wei, M. Zefran
Interpreting Deep-Learned Error-Correcting Codes. ISIT (2022)
Andrew S. Gordon, Rob Miller, Leora Morgenstern, György Turán
Preface. Ann. Math. Artif. Intell. 89 (1-2) (2021)
Karine Chubarian, György Turán
Interpretability of Bayesian Network Classifiers: OBDD Approximation and Polynomial Threshold Functions. ISAIM (2020)
Péter Hajnal, Zhihao Liu, György Turán
Nearest neighbor representations of Boolean functions. CoRR (2020)
Karine Chubarian, György Turán
Approximating bounded tree-width Bayesian network classifiers with OBDD. PGM (2020)
Vanda Balogh, Gábor Berend, Dimitrios I. Diochnos, György Turán
Understanding the Semantic Content of Sparse Word Embeddings Using a Commonsense Knowledge Base. AAAI (2020)
Harish Naik, György Turán
Explanation from Specification. CoRR (2020)
Lisa Hellerstein, Lev Reyzin, György Turán
Foreword. Ann. Math. Artif. Intell. 79 (1-3) (2017)
Robert H. Sloan, Despina Stasi, György Turán
Hydras: Directed hypergraphs and Horn formulas. Theor. Comput. Sci. 658 (2017)
Benjamin Fish, Rahul Kushwaha, György Turán
Betweenness centrality profiles in trees. J. Complex Networks 5 (5) (2017)
Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky
Measuring an artificial intelligence system's performance on a Verbal IQ test for young children. J. Exp. Theor. Artif. Intell. 29 (4) (2017)
Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán
Foreword. Theor. Comput. Sci. 658 (2017)
Jon Yaggie, György Turán
Characterizability in Horn Belief Revision. JELIA (2016)
Benjamin Fish, Rahul Kushwaha, György Turán
Betweenness centrality profiles in trees. CoRR (2016)
Robert H. Sloan, Despina Stasi, György Turán
Hydras: Directed Hypergraphs and Horn Formulas. CoRR (2015)
Loizos Michael, Antonis C. Kakas, Rob Miller, György Turán
Cognitive Programming. AIC (2015)
György Turán, Jon Yaggie
Characterizability in Belief Revision. IJCAI (2015)
György Turán, Jon Yaggie
Characterizability in Belief Revision. AAAI Spring Symposia (2015)
Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán
On the Computational Complexity of MapReduce. DISC (2015)
Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky
Measuring an Artificial Intelligence System's Performance on a Verbal IQ Test For Young Children. CoRR (2015)
Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán
On the Computational Complexity of MapReduce. CoRR (2014)
Fatemeh Vafaee, György Turán, Peter C. Nelson, Tanya Y. Berger-Wolf
Balancing the exploration and exploitation in an adaptive diversity guided genetic algorithm. IEEE Congress on Evolutionary Computation (2014)
Fatemeh Vafaee, György Turán, Peter C. Nelson, Tanya Y. Berger-Wolf
Among-site rate variation: adaptation of genetic algorithm mutation rates at each single site. GECCO (2014)
György Turán, Jon Yaggie
Non-characterizability of belief revision: an application of finite model theory. CoRR (2014)
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal. DCFS (2014)
Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán
Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201). Dagstuhl Reports 4 (5) (2014)
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán
Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal. CoRR (2014)
Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky
Verbal IQ of a Four-Year Old Achieved by an AI System. AAAI (Late-Breaking Developments) (2013)
Robert H. Sloan, Despina Stasi, György Turán
Hydras: Directed Hypergraphs and Horn Formulas. WG (2012)
Stellan Ohlsson, Robert H. Sloan, György Turán, Daniel Uber, Aaron Urasky
An Approach to Evaluate AI Commonsense Reasoning Systems. FLAIRS Conference (2012)
Dimitrios I. Diochnos, Robert H. Sloan, György Turán
On multiple-instance learning of halfspaces. Inf. Process. Lett. 112 (23) (2012)
Kira V. Adaricheva, Robert H. Sloan, Balázs Szörényi, György Turán
Horn Belief Contraction: Remainders, Envelopes and Complexity. KR (2012)
Despina Stasi, Robert H. Sloan, György Turán
Hydra formulas and directed hypergraphs: A preliminary report. ISAIM (2012)
Robert H. Sloan, Despina Stasi, György Turán
Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs. Discret. Math. Theor. Comput. Sci. 14 (2) (2012)
Kira V. Adaricheva, Robert H. Sloan, Balázs Szörényi, György Turán
Horn Belief Contraction: Remainders, Envelopes and Complexity. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning (2011)
Marina Langlois, Robert H. Sloan, György Turán
Horn Upper Bounds and Renaming. J. Satisf. Boolean Model. Comput. 7 (1) (2010)
László Györfi, György Turán, Thomas Zeugmann
Guest editors' foreword. Theor. Comput. Sci. 411 (29-30) (2010)
Dhruv Mubayi, György Turán
Finding bipartite subgraphs efficiently. Inf. Process. Lett. 110 (5) (2010)
Fatemeh Vafaee, György Turán, Peter C. Nelson
Optimizing genetic operator rates using a markov chain model of genetic algorithms. GECCO (2010)
Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán
On Approximate Horn Formula Minimization. ICALP (1) (2010)
Dimitrios I. Diochnos, György Turán
On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance. SAGA (2009)
Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán
Combinatorial Problems for Horn Clauses. Graph Theory, Computational Intelligence and Thought (2009)
Robert H. Sloan, Balázs Szörényi, György Turán
Projective DNF formulae and their revision. Discret. Appl. Math. 156 (4) (2008)
Robert H. Sloan, Balázs Szörényi, György Turán
On k-Term DNF with the Largest Number of Prime Implicants. SIAM J. Discret. Math. 21 (4) (2008)
Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán
Combinatorial problems for Horn clauses. ISAIM (2008)
Marina Langlois, Robert H. Sloan, Balázs Szörényi, György Turán
Horn Complements: Towards Horn-to-Horn Belief Revision. AAAI (2008)
Marina Langlois, Robert H. Sloan, György Turán
Horn Upper Bounds and Renaming. SAT (2007)
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang
The inverse protein folding problem on 2D and 3D lattices. Discret. Appl. Math. 155 (6-7) (2007)
Robert H. Sloan, Balázs Szörényi, György Turán
Revising threshold functions. Theor. Comput. Sci. 382 (3) (2007)
Ferenc Gécseg, György Turán
Kalmár Workshop on Logic and Computer Science - Preface. Acta Cybern. 18 (1) (2007)
Marina Langlois, Robert H. Sloan, György Turán
Horn Upper Bounds of Random 3-CNF: A Computational Study. AI&M (2006)
György Turán
On Learning and Logic. COLT (2006)
Péter Hajnal, Zhihao Liu, György Turán
Nearest Neighbor Representations of Boolean Functions. AI&M (2006)
Dhruv Mubayi, György Turán, Yi Zhao
The DNF exception problem. Theor. Comput. Sci. 352 (1-3) (2006)
Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán
On set systems with a threshold property. Discret. Math. 306 (23) (2006)
Robert H. Sloan, Balázs Szörényi, György Turán
On k-term DNF with largest number of prime implicants Electron. Colloquium Comput. Complex. (023) (2005)
Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
New Revision Algorithms. ALT (2004)
Martin Grohe, György Turán
Learnability and Definability in Trees and Similar Structures. Theory Comput. Syst. 37 (1) (2004)
Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
Theory revision with queries: Horn, read-once, and parity formulas. Artif. Intell. 156 (2) (2004)
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. CPM (2004)
Robert H. Sloan, Balázs Szörényi, György Turán
Projective DNF Formulae and Their Revision. COLT (2003)
Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
Theory Revision with Queries: Horn, Read-once, and Parity Formulas Electron. Colloquium Comput. Complex. (039) (2003)
Martin Grohe, György Turán
Learnability and Definability in Trees and Similar Structures. STACS (2002)
Judy Goldsmith, Robert H. Sloan, György Turán
Theory Revision with Queries: DNF Formulas. Mach. Learn. 47 (2-3) (2002)
Tamás Horváth, György Turán
Learning logic programs with structured background knowledge. Artif. Intell. 128 (1-2) (2001)
Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
Improved Algorithms for Theory Revision with Queries. COLT (2000)
György Turán
Remarks on computational learning theory. Ann. Math. Artif. Intell. 28 (1-4) (2000)
Robert H. Sloan, György Turán
On Theory Revision with Queries. COLT (1999)
Robert H. Sloan, Ken Takata, György Turán
On frequent sets of Boolean matrices Electron. Colloquium Comput. Complex. 5 (61) (1998)
Irene Tsapara, György Turán
Learning Atomic Formulas with Prescribed Properties. COLT (1998)
Robert H. Sloan, Ken Takata, György Turán
On Frequent Sets of Boolean Matrices. Ann. Math. Artif. Intell. 24 (1-4) (1998)
György Turán, Farrokh Vatan
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. J. Comput. Syst. Sci. 54 (1) (1997)
Tamás Horváth, Robert H. Sloan, György Turán
Learning Logic Programs by Using the Product Homomorphism Method. COLT (1997)
Dana Angluin, Martins Krikis, Robert H. Sloan, György Turán
Malicious Omissions and Errors in Answers to Membership Queries. Mach. Learn. 28 (2-3) (1997)
Robert H. Sloan, György Turán
Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs. EuroCOLT (1997)
György Turán, Farrokh Vatan
A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. Inf. Process. Lett. 59 (5) (1996)
Tamás Horváth, Robert H. Sloan, György Turán
Learning Logic Programs with Random Classification Noise. Inductive Logic Programming Workshop (1996)
György Turán
On the Complexity of Planar Boolean Circuits. Comput. Complex. 5 (1) (1995)
György Turán, Farrokh Vatan
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract) FOCS (1994)
Robert H. Sloan, György Turán
Learning with Queries but Incomplete Information (Extended Abstract). COLT (1994)
Wolfgang Maass, György Turán
Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts. Mach. Learn. 14 (1) (1994)
Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán
Two Tapes Versus One for Off-Line Turing Machines. Comput. Complex. 3 (1993)
Hans Dietmar Gröger, György Turán
A Liniear lower bound for the size of threshold circuits. Bull. EATCS 50 (1993)
András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
Threshold Circuits of Bounded Depth. J. Comput. Syst. Sci. 46 (2) (1993)
György Turán
Lower Bounds for PAC Learning with Queries. COLT (1993)
Ulrich Faigle, Rainer Schrader, György Turán
The Communication Complexity of Interval Orders. Discret. Appl. Math. 40 (1) (1992)
Wolfgang Maass, György Turán
Lower Bound Methods and Separation Results for On-Line Learning Models. Mach. Learn. 9 (1992)
Hans Dietmar Gröger, György Turán
On Linear Decision Trees Computing Boolean Functions. ICALP (1991)
György Turán
A Survey of Some Aspects of Computational Learning Theory (Extended Abstract). FCT (1991)
Wolfgang Maass, György Turán
On the Complexity of Learning from Counterexamples and Membership Queries (abstract). COLT (1990)
Wolfgang Maass, György Turán
On the Complexity of Learning from Counterexamples and Membership Queries FOCS (1990)
Wolfgang Maass, György Turán
On the Complexity of Learning From Counterexamples (Extended Abstract) FOCS (1989)
György Turán
Lower Bounds for Synchronous Circuits and Planar Circuits. Inf. Process. Lett. 30 (1) (1989)

György Turán.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

György Turán