The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

György Turán: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
    New Revision Algorithms. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:395-409 [Conf]
  2. Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
    Improved Algorithms for Theory Revision with Queries. [Citation Graph (0, 0)][DBLP]
    COLT, 2000, pp:236-247 [Conf]
  3. Tamás Horváth, Robert H. Sloan, György Turán
    Learning Logic Programs by Using the Product Homomorphism Method. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:10-20 [Conf]
  4. Wolfgang Maass, György Turán
    On the Complexity of Learning from Counterexamples and Membership Queries (abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:391- [Conf]
  5. Robert H. Sloan, Balázs Szörényi, György Turán
    Projective DNF Formulae and Their Revision. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:625-639 [Conf]
  6. Robert H. Sloan, György Turán
    Learning with Queries but Incomplete Information (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:237-245 [Conf]
  7. Robert H. Sloan, György Turán
    On Theory Revision with Queries. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:41-52 [Conf]
  8. Irene Tsapara, György Turán
    Learning Atomic Formulas with Prescribed Properties. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:166-174 [Conf]
  9. György Turán
    On Learning and Logic. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:2-3 [Conf]
  10. György Turán
    Lower Bounds for PAC Learning with Queries. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:384-391 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:244-253 [Conf]
  12. Robert H. Sloan, György Turán
    Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:38-50 [Conf]
  13. György Turán
    On Cellular Graph-Automata and Second-Order Definable Graph-Properties. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:384-393 [Conf]
  14. György Turán
    On Restricted Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:460-469 [Conf]
  15. György Turán
    A Survey of Some Aspects of Computational Learning Theory (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:89-103 [Conf]
  16. András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
    Threshold circuits of bounded depth [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:99-110 [Conf]
  17. Wolfgang Maass, György Turán
    On the Complexity of Learning From Counterexamples (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:262-267 [Conf]
  18. Wolfgang Maass, György Turán
    On the Complexity of Learning from Counterexamples and Membership Queries [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:203-210 [Conf]
  19. György Turán, Farrokh Vatan
    On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:553-564 [Conf]
  20. Hans Dietmar Gröger, György Turán
    On Linear Decision Trees Computing Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:707-718 [Conf]
  21. Tamás Horváth, Robert H. Sloan, György Turán
    Learning Logic Programs with Random Classification Noise. [Citation Graph (0, 0)][DBLP]
    Inductive Logic Programming Workshop, 1996, pp:315-336 [Conf]
  22. Ulrich Faigle, György Turán
    Sorting and Recognition Problems for Ordered Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:109-118 [Conf]
  23. Martin Grohe, György Turán
    Learnability and Definability in Trees and Similar Structures. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:645-658 [Conf]
  24. 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 [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:30-38 [Conf]
  25. András Hajnal, Wolfgang Maass, György Turán
    On the Communication Complexity of Graph Properties [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:186-191 [Conf]
  26. Ulrich Faigle, Walter Kern, György Turán
    On the performance of on-line algorithms for partition problems. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1989, v:9, n:2, pp:107-119 [Journal]
  27. György Turán
    On the complexity of graph grammars. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1984, v:6, n:, pp:271-280 [Journal]
  28. Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
    Theory revision with queries: Horn, read-once, and parity formulas. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:156, n:2, pp:139-176 [Journal]
  29. Tamás Horváth, György Turán
    Learning logic programs with structured background knowledge. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:128, n:1-2, pp:31-97 [Journal]
  30. Robert H. Sloan, Ken Takata, György Turán
    On Frequent Sets of Boolean Matrices. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:24, n:1-4, pp:193-209 [Journal]
  31. György Turán
    Remarks on computational learning theory. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2000, v:28, n:1-4, pp:43-45 [Journal]
  32. Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán
    Two Tapes Versus One for Off-Line Turing Machines. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:392-401 [Journal]
  33. György Turán
    On the Complexity of Planar Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:1, pp:24-42 [Journal]
  34. Ulrich Faigle, Rainer Schrader, György Turán
    The Communication Complexity of Interval Orders. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:1, pp:19-28 [Journal]
  35. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:719-732 [Journal]
  36. Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán
    On set systems with a threshold property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:3097-3111 [Journal]
  37. Hans Dietmar Gröger, György Turán
    A Liniear lower bound for the size of threshold circuits. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:50, n:, pp:220-221 [Journal]
  38. Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
    Theory Revision with Queries: Horn, Read-once, and Parity Formulas [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:039, pp:- [Journal]
  39. Robert H. Sloan, Balázs Szörényi, György Turán
    On k-term DNF with largest number of prime implicants [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:023, pp:- [Journal]
  40. Robert H. Sloan, Ken Takata, György Turán
    On frequent sets of Boolean matrices [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:61, pp:- [Journal]
  41. György Turán
    The Critical Complexity of Graph Properties. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:3, pp:151-153 [Journal]
  42. György Turán
    Lower Bounds for Synchronous Circuits and Planar Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:1, pp:37-40 [Journal]
  43. György Turán, Farrokh Vatan
    A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:5, pp:251-254 [Journal]
  44. László Babai, Péter Hajnal, Endre Szemerédi, György Turán
    A Lower Bound for Read-Once-Only Branching Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1987, v:35, n:2, pp:153-162 [Journal]
  45. András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
    Threshold Circuits of Bounded Depth. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:46, n:2, pp:129-154 [Journal]
  46. György Turán, Farrokh Vatan
    On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:1, pp:199-212 [Journal]
  47. Dana Angluin, Martins Krikis, Robert H. Sloan, György Turán
    Malicious Omissions and Errors in Answers to Membership Queries. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1997, v:28, n:2-3, pp:211-255 [Journal]
  48. Judy Goldsmith, Robert H. Sloan, György Turán
    Theory Revision with Queries: DNF Formulas. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2002, v:47, n:2-3, pp:257-295 [Journal]
  49. Wolfgang Maass, György Turán
    Lower Bound Methods and Separation Results for On-Line Learning Models. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1992, v:9, n:, pp:107-145 [Journal]
  50. Wolfgang Maass, György Turán
    Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1994, v:14, n:1, pp:251-269 [Journal]
  51. Martin Grohe, György Turán
    Learnability and Definability in Trees and Similar Structures. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:193-220 [Journal]
  52. Ulrich Faigle, László Lovász, Rainer Schrader, György Turán
    Searching in Trees, Series-Parallel and Interval Orders. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:1075-1084 [Journal]
  53. Ulrich Faigle, György Turán
    Sorting and Recognition Problems for Ordered Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:1, pp:100-113 [Journal]
  54. Samuel R. Buss, György Turán
    Resolution Proofs of Generalized Pigeonhole Principles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:62, n:3, pp:311-317 [Journal]
  55. Dhruv Mubayi, György Turán, Yi Zhao
    The DNF exception problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:85-96 [Journal]
  56. Marina Langlois, Robert H. Sloan, György Turán
    Horn Upper Bounds and Renaming. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:80-93 [Conf]
  57. Ulrich Faigle, György Turán
    On the complexity of interval orders and semiorders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:131-141 [Journal]
  58. György Turán
    On the definability of properties of finite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:3, pp:291-302 [Journal]
  59. Robert H. Sloan, Balázs Szörényi, György Turán
    Revising threshold functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:3, pp:198-208 [Journal]

  60. Horn Complements: Towards Horn-to-Horn Belief Revision. [Citation Graph (, )][DBLP]


  61. Combinatorial Problems for Horn Clauses. [Citation Graph (, )][DBLP]


  62. Optimizing genetic operator rates using a markov chain model of genetic algorithms. [Citation Graph (, )][DBLP]


  63. On Approximate Horn Formula Minimization. [Citation Graph (, )][DBLP]


  64. On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance. [Citation Graph (, )][DBLP]


  65. Kalmár Workshop on Logic and Computer Science --- Preface. [Citation Graph (, )][DBLP]


  66. Projective DNF formulae and their revision. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002