| Threshold circuits of bounded depth A Hajnal, W Maass, P Pudlák, M Szegedy, G Turán Journal of Computer and System Sciences 46 (2), 129-154, 1993 | 533 | 1993 |
| On the complexity of cutting-plane proofs W Cook, CR Coullard, G Turán Discrete Applied Mathematics 18 (1), 25-38, 1987 | 386 | 1987 |
| On the succinct representation of graphs G Turán Discrete Applied Mathematics 8 (3), 289-294, 1984 | 265 | 1984 |
| On the performance of on-line algorithms for partition problems U Faigle, W Kern, G Turán Acta cybernetica 9 (2), 107-119, 1989 | 260 | 1989 |
| Resolution proofs of generalized pigeonhole principles SR Buss, G Turan Theoretical Computer Science 62 (3), 311-317, 1988 | 128 | 1988 |
| How fast can a threshold gate learn? W Maass, G Turán Proceedings of a workshop on Computational learning theory and natural …, 1994 | 125 | 1994 |
| Lower bound methods and separation results for on-line learning models W Maass, G Turán Machine Learning 9 (2), 107-145, 1992 | 112 | 1992 |
| On the communication complexity of graph properties A Hajnal, W Maass, G Turán Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988 | 102 | 1988 |
| Two lower bounds for branching programs M Ajtai, L Babai, P Hajnal, J Komlós, P Pudlák Proceedings of the eighteenth annual ACM symposium on Theory of computing, 30-38, 1986 | 94 | 1986 |
| On the complexity of learning from counterexamples W Maass, G Turán FOCS, 262-267, 1989 | 88 | 1989 |
| Malicious omissions and errors in answers to membership queries D Angluin, M Kriķis, RH Sloan, G Turán Machine Learning 28 (2), 211-255, 1997 | 55 | 1997 |
| On the complexity of learning from counterexamples and membership queries W Maass, G Turán Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990 | 55 | 1990 |
| The critical complexity of graph properties G TURIN Inform. Process. Lm 18, 151-153, 1984 | 55 | 1984 |
| Algorithms and lower bounds for on-line learning of geometrical concepts W Maass, G Turán Machine Learning 14 (3), 251-269, 1994 | 53 | 1994 |
| Learnability and definability in trees and similar structures M Grohe, G Turán Theory of Computing Systems 37 (1), 193-220, 2004 | 48 | 2004 |
| Horn Complements: Towards Horn-to-Horn Belief Revision. M Langlois, RH Sloan, B Szörényi, G Turán AAAI, 466-471, 2008 | 45 | 2008 |
| Sorting and recognition problems for ordered sets U Faigle, G Turán SIAM Journal on Computing 17 (1), 100-113, 1988 | 45 | 1988 |
| Learning logic programs with structured background knowledge T Horváth, G Turán Artificial Intelligence 128 (1-2), 31-97, 2001 | 44 | 2001 |
| On the definability of properties of finite graphs G Turán Discrete Mathematics 49 (3), 291-302, 1984 | 42 | 1984 |
| On the computation of Boolean functions by analog circuits of bounded fan-in G Turán, F Vatan journal of computer and system sciences 54 (1), 199-212, 1997 | 37 | 1997 |
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyVerified email at igi.tugraz.at
