György Turán

Robert H. Sloan, Despina Stasi, György Turán: Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs. Discrete Mathematics & Theoretical Computer Science 14(2): 29-36 (2012)

Dimitrios I. Diochnos, Robert H. Sloan, György Turán: On multiple-instance learning of halfspaces. Inf. Process. Lett. 112(23): 933-936 (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

Despina Stasi, Robert H. Sloan, György Turán: Hydra formulas and directed hypergraphs: A preliminary report. ISAIM 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

Robert H. Sloan, Despina Stasi, György Turán: Hydras: Directed Hypergraphs and Horn Formulas. WG 2012: 237-248

Mária Bieliková, Gerhard Friedrich, Georg Gottlob, Stefan Katzenbeisser, György Turán (Eds.): 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. Lecture Notes in Computer Science 7147, Springer 2012, isbn 978-3-642-27659-0

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

Dhruv Mubayi, György Turán: Finding bipartite subgraphs efficiently. Inf. Process. Lett. 110(5): 174-177 (2010)

Marina Langlois, Robert H. Sloan, György Turán: Horn Upper Bounds and Renaming. JSAT 7(1): 1-15 (2010)

László Györfi, György Turán, Thomas Zeugmann: Guest editors' foreword. Theor. Comput. Sci. 411(29-30): 2629-2631 (2010)

Fatemeh Vafaee, György Turán, Peter C. Nelson: Optimizing genetic operator rates using a markov chain model of genetic algorithms. GECCO 2010: 721-728

Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán: On Approximate Horn Formula Minimization. ICALP (1) 2010: 438-450

Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán: Combinatorial Problems for Horn Clauses. Graph Theory, Computational Intelligence and Thought 2009: 54-65

Dimitrios I. Diochnos, György Turán: On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance. SAGA 2009: 74-88

Robert H. Sloan, Balázs Szörényi, György Turán: Projective DNF formulae and their revision. Discrete Applied Mathematics 156(4): 530-544 (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. Discrete Math. 21(4): 987-998 (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: 466-471

Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán: Combinatorial problems for Horn clauses. ISAIM 2008

Yoav Freund, László Györfi, György Turán, Thomas Zeugmann (Eds.): Algorithmic Learning Theory, 19th International Conference, ALT 2008, Budapest, Hungary, October 13-16, 2008. Proceedings. Lecture Notes in Computer Science 5254, Springer 2008, isbn 978-3-540-87986-2

Ferenc Gécseg, György Turán: Kalmár Workshop on Logic and Computer Science --- Preface. Acta Cybern. 18(1): 3-5 (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. Discrete Applied Mathematics 155(6-7): 719-732 (2007)

Robert H. Sloan, Balázs Szörényi, György Turán: Revising threshold functions. Theor. Comput. Sci. 382(3): 198-208 (2007)

Marina Langlois, Robert H. Sloan, György Turán: Horn Upper Bounds and Renaming. SAT 2007: 80-93

Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán: On set systems with a threshold property. Discrete Mathematics 306(23): 3097-3111 (2006)

Dhruv Mubayi, György Turán, Yi Zhao: The DNF exception problem. Theor. Comput. Sci. 352(1-3): 85-96 (2006)

György Turán: On Learning and Logic. COLT 2006: 2-3

Péter Hajnal, Zhihao Liu, György Turán: Nearest Neighbor Representations of Boolean Functions. ISAIM 2006

Marina Langlois, Robert H. Sloan, György Turán: Horn Upper Bounds of Random 3-CNF: A Computational Study. ISAIM 2006

Robert H. Sloan, Balázs Szörényi, György Turán: On k-term DNF with largest number of prime implicants. Electronic Colloquium on Computational Complexity (ECCC)(023) (2005)

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): 139-176 (2004)

Martin Grohe, György Turán: Learnability and Definability in Trees and Similar Structures. Theory Comput. Syst. 37(1): 193-220 (2004)

Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán: New Revision Algorithms. ALT 2004: 395-409

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: 244-253

Robert H. Sloan, Balázs Szörényi, György Turán: Projective DNF Formulae and Their Revision. COLT 2003: 625-639

Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán: Theory Revision with Queries: Horn, Read-once, and Parity Formulas. Electronic Colloquium on Computational Complexity (ECCC)(039) (2003)

Judy Goldsmith, Robert H. Sloan, György Turán: Theory Revision with Queries: DNF Formulas. Machine Learning 47(2-3): 257-295 (2002)

Martin Grohe, György Turán: Learnability and Definability in Trees and Similar Structures. STACS 2002: 645-658

Tamás Horváth, György Turán: Learning logic programs with structured background knowledge. Artif. Intell. 128(1-2): 31-97 (2001)

György Turán: Remarks on computational learning theory. Ann. Math. Artif. Intell. 28(1-4): 43-45 (2000)

Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán: Improved Algorithms for Theory Revision with Queries. COLT 2000: 236-247

Robert H. Sloan, György Turán: On Theory Revision with Queries. COLT 1999: 41-52

Robert H. Sloan, Ken Takata, György Turán: On Frequent Sets of Boolean Matrices. Ann. Math. Artif. Intell. 24(1-4): 193-209 (1998)

Irene Tsapara, György Turán: Learning Atomic Formulas with Prescribed Properties. COLT 1998: 166-174

Robert H. Sloan, Ken Takata, György Turán: On frequent sets of Boolean matrices. Electronic Colloquium on Computational Complexity (ECCC) 5(61) (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): 199-212 (1997)

Dana Angluin, Martins Krikis, Robert H. Sloan, György Turán: Malicious Omissions and Errors in Answers to Membership Queries. Machine Learning 28(2-3): 211-255 (1997)

Tamás Horváth, Robert H. Sloan, György Turán: Learning Logic Programs by Using the Product Homomorphism Method. COLT 1997: 10-20

Robert H. Sloan, György Turán: Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs. EuroCOLT 1997: 38-50

György Turán, Farrokh Vatan: A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. Inf. Process. Lett. 59(5): 251-254 (1996)

Tamás Horváth, Robert H. Sloan, György Turán: Learning Logic Programs with Random Classification Noise. Inductive Logic Programming Workshop 1996: 315-336

György Turán: On the Complexity of Planar Boolean Circuits. Computational Complexity 5(1): 24-42 (1995)

Wolfgang Maass, György Turán: Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts. Machine Learning 14(1): 251-269 (1994)

Robert H. Sloan, György Turán: Learning with Queries but Incomplete Information (Extended Abstract). COLT 1994: 237-245

György Turán, Farrokh Vatan: On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract). FOCS 1994: 553-564

Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán: Two Tapes Versus One for Off-Line Turing Machines. Computational Complexity 3: 392-401 (1993)

Hans Dietmar Gröger, György Turán: A Liniear lower bound for the size of threshold circuits. Bulletin of the EATCS 50: 220-221 (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): 129-154 (1993)

György Turán: Lower Bounds for PAC Learning with Queries. COLT 1993: 384-391

Ulrich Faigle, Rainer Schrader, György Turán: The Communication Complexity of Interval Orders. Discrete Applied Mathematics 40(1): 19-28 (1992)

Wolfgang Maass, György Turán: Lower Bound Methods and Separation Results for On-Line Learning Models. Machine Learning 9: 107-145 (1992)

György Turán: A Survey of Some Aspects of Computational Learning Theory (Extended Abstract). FCT 1991: 89-103

Hans Dietmar Gröger, György Turán: On Linear Decision Trees Computing Boolean Functions. ICALP 1991: 707-718

Wolfgang Maass, György Turán: On the Complexity of Learning from Counterexamples and Membership Queries (abstract). COLT 1990: 391

Wolfgang Maass, György Turán: On the Complexity of Learning from Counterexamples and Membership Queries. FOCS 1990: 203-210

Ulrich Faigle, Walter Kern, György Turán: On the performance of on-line algorithms for partition problems. Acta Cybern. 9(2): 107-119 (1989)

György Turán: Lower Bounds for Synchronous Circuits and Planar Circuits. Inf. Process. Lett. 30(1): 37-40 (1989)

György Turán: On Restricted Boolean Circuits. FCT 1989: 460-469

Wolfgang Maass, György Turán: On the Complexity of Learning From Counterexamples (Extended Abstract). FOCS 1989: 262-267

Ulrich Faigle, György Turán: Sorting and Recognition Problems for Ordered Sets. SIAM J. Comput. 17(1): 100-113 (1988)

Samuel R. Buss, György Turán: Resolution Proofs of Generalized Pigeonhole Principles. Theor. Comput. Sci. 62(3): 311-317 (1988)

András Hajnal, Wolfgang Maass, György Turán: On the Communication Complexity of Graph Properties. STOC 1988: 186-191

Ulrich Faigle, György Turán: On the complexity of interval orders and semiorders. Discrete Mathematics 63(2-3): 131-141 (1987)

László Babai, Péter Hajnal, Endre Szemerédi, György Turán: A Lower Bound for Read-Once-Only Branching Programs. J. Comput. Syst. Sci. 35(2): 153-162 (1987)

András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán: Threshold circuits of bounded depth. FOCS 1987: 99-110

Ulrich Faigle, László Lovász, Rainer Schrader, György Turán: Searching in Trees, Series-Parallel and Interval Orders. SIAM J. Comput. 15(4): 1075-1084 (1986)

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: Two lower bounds for branching programs. STOC 1986: 30-38

Ulrich Faigle, György Turán: Sorting and Recognition Problems for Ordered Sets. STACS 1985: 109-118

György Turán: On the complexity of graph grammars. Acta Cybern. 6: 271-280 (1984)

György Turán: On the definability of properties of finite graphs. Discrete Mathematics 49(3): 291-302 (1984)

György Turán: The Critical Complexity of Graph Properties. Inf. Process. Lett. 18(3): 151-153 (1984)

György Turán: On Cellular Graph-Automata and Second-Order Definable Graph-Properties. FCT 1981: 384-393