| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Despina Stasi, Robert H. Sloan, György Turán |
Hydra formulas and directed hypergraphs: A preliminary report.  |
ISAIM  |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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 |
SOFSEM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Dhruv Mubayi, György Turán |
Finding bipartite subgraphs efficiently. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | László Györfi, György Turán, Thomas Zeugmann |
Guest editors' foreword. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marina Langlois, Robert H. Sloan, György Turán |
Horn Upper Bounds and Renaming. |
JSAT |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fatemeh Vafaee, György Turán, Peter C. Nelson |
Optimizing genetic operator rates using a markov chain model of genetic algorithms. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
markov chain models of genetic algorithms, operator rate optimization, genetic algorithms |
| 1 | Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán |
On Approximate Horn Formula Minimization. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitrios I. Diochnos, György Turán |
On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance. |
SAGA |
2009 |
DBLP DOI BibTeX RDF |
learning, evolution |
| 1 | Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán |
Combinatorial Problems for Horn Clauses. |
Graph Theory, Computational Intelligence and Thought |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert H. Sloan, Balázs Szörényi, György Turán |
Projective DNF formulae and their revision. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán |
Combinatorial problems for Horn clauses. |
ISAIM |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
ALT |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marina Langlois, Robert H. Sloan, Balázs Szörényi, György Turán |
Horn Complements: Towards Horn-to-Horn Belief Revision. |
AAAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ferenc Gécseg, György Turán |
Kalmár Workshop on Logic and Computer Science --- Preface. |
Acta Cybern. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Robert H. Sloan, Balázs Szörényi, György Turán |
Revising threshold functions. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang 0002 |
The inverse protein folding problem on 2D and 3D lattices. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marina Langlois, Robert H. Sloan, György Turán |
Horn Upper Bounds and Renaming. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dhruv Mubayi, György Turán, Yi Zhao |
The DNF exception problem. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán |
On set systems with a threshold property. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter Hajnal, Zhihao Liu, György Turán |
Nearest Neighbor Representations of Boolean Functions. |
ISAIM |
2006 |
DBLP BibTeX RDF |
|
| 1 | Marina Langlois, Robert H. Sloan, György Turán |
Horn Upper Bounds of Random 3-CNF: A Computational Study. |
ISAIM |
2006 |
DBLP BibTeX RDF |
|
| 1 | György Turán |
On Learning and Logic. |
COLT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, György Turán |
Learnability and Definability in Trees and Similar Structures. |
Theory Comput. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang 0002 |
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán |
New Revision Algorithms. |
ALT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Robert H. Sloan, Balázs Szörényi, György Turán |
Projective DNF Formulae and Their Revision. |
COLT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Judy Goldsmith, Robert H. Sloan, György Turán |
Theory Revision with Queries: DNF Formulas. |
Machine Learning |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, György Turán |
Learnability and Definability in Trees and Similar Structures. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamás Horváth, György Turán |
Learning logic programs with structured background knowledge. |
Artif. Intell. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán |
Remarks on computational learning theory. |
Ann. Math. Artif. Intell. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán |
Improved Algorithms for Theory Revision with Queries. |
COLT |
2000 |
DBLP BibTeX RDF |
|
| 1 | Robert H. Sloan, György Turán |
On Theory Revision with Queries. |
COLT |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert H. Sloan, Ken Takata, György Turán |
On frequent sets of Boolean matrices |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Robert H. Sloan, Ken Takata, György Turán |
On Frequent Sets of Boolean Matrices. |
Ann. Math. Artif. Intell. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Irene Tsapara, György Turán |
Learning Atomic Formulas with Prescribed Properties. |
COLT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Angluin, Martins Krikis, Robert H. Sloan, György Turán |
Malicious Omissions and Errors in Answers to Membership Queries. |
Machine Learning |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán, Farrokh Vatan |
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. |
J. Comput. Syst. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert H. Sloan, György Turán |
Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs. |
EuroCOLT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamás Horváth, Robert H. Sloan, György Turán |
Learning Logic Programs by Using the Product Homomorphism Method. |
COLT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán, Farrokh Vatan |
A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. |
Inf. Process. Lett. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamás Horváth, Robert H. Sloan, György Turán |
Learning Logic Programs with Random Classification Noise. |
Inductive Logic Programming Workshop |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán |
On the Complexity of Planar Boolean Circuits. |
Computational Complexity |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Maass, György Turán |
Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts. |
Machine Learning |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert H. Sloan, György Turán |
Learning with Queries but Incomplete Information (Extended Abstract). |
COLT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán, Farrokh Vatan |
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract) |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
explicit nonlinear lower bounds, computation of Boolean functions, bounded fan-in, real-valued functions, sign-representation, n-variable function, piecewise linear circuits, complexity, upper bounds, nondeterminism, analog circuits |
| 1 | Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán |
Two Tapes Versus One for Off-Line Turing Machines. |
Computational Complexity |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Dietmar Gröger, György Turán |
A Liniear lower bound for the size of threshold circuits. |
Bulletin of the EATCS |
1993 |
DBLP BibTeX RDF |
|
| 1 | András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán |
Threshold Circuits of Bounded Depth. |
J. Comput. Syst. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán |
Lower Bounds for PAC Learning with Queries. |
COLT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Maass, György Turán |
Lower Bound Methods and Separation Results for On-Line Learning Models. |
Machine Learning |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Faigle, Rainer Schrader, György Turán |
The Communication Complexity of Interval Orders. |
Discrete Applied Mathematics |
1992 |
DBLP BibTeX RDF |
|
| 1 | Hans Dietmar Gröger, György Turán |
On Linear Decision Trees Computing Boolean Functions. |
ICALP |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán |
A Survey of Some Aspects of Computational Learning Theory (Extended Abstract). |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Maass, György Turán |
On the Complexity of Learning from Counterexamples and Membership Queries (abstract). |
COLT |
1990 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Maass, György Turán |
On the Complexity of Learning from Counterexamples and Membership Queries |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
nondecreasing functions, domain subsets, learning from counterexamples, learning complexities, online learning models, combinatorial parameters, monomials, lower bound, membership queries, equivalence queries, threshold gates, concept class |
| 1 | György Turán |
Lower Bounds for Synchronous Circuits and Planar Circuits. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Faigle, Walter Kern, György Turán |
On the performance of on-line algorithms for partition problems. |
Acta Cybern. |
1989 |
DBLP BibTeX RDF |
|
| 1 | György Turán |
On Restricted Boolean Circuits. |
FCT |
1989 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Maass, György Turán |
On the Complexity of Learning From Counterexamples (Extended Abstract) |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
combinatorial invariants, complexity of learning, d-dimensional discrete space, lower bound, upper bound, finite domain |
| 1 | Samuel R. Buss, György Turán |
Resolution Proofs of Generalized Pigeonhole Principles. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Faigle, György Turán |
Sorting and Recognition Problems for Ordered Sets. |
SIAM J. Comput. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | András Hajnal, Wolfgang Maass, György Turán |
On the Communication Complexity of Graph Properties |
STOC |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Faigle, György Turán |
On the complexity of interval orders and semiorders. |
Discrete Mathematics |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán |
Threshold circuits of bounded depth |
FOCS |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Faigle, László Lovász, Rainer Schrader, György Turán |
Searching in Trees, Series-Parallel and Interval Orders. |
SIAM J. Comput. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Faigle, György Turán |
Sorting and Recognition Problems for Ordered Sets. |
STACS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán |
The Critical Complexity of Graph Properties. |
Inf. Process. Lett. |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán |
On the complexity of graph grammars. |
Acta Cybern. |
1984 |
DBLP BibTeX RDF |
|
| 1 | György Turán |
On the definability of properties of finite graphs. |
Discrete Mathematics |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán |
On Cellular Graph-Automata and Second-Order Definable Graph-Properties. |
FCT |
1981 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")