Gyorgy Turan
Gyorgy Turan
University of Illinois at Chicago, and Hungarian Academy of Sciences
Verified email at uic.edu
Title
Cited by
Cited by
Year
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
4301993
On the complexity of cutting-plane proofs
W Cook, CR Coullard, G Turán
Discrete Applied Mathematics 18 (1), 25-38, 1987
2501987
On the succinct representation of graphs
G Turán
Discrete Applied Mathematics 8 (3), 289-294, 1984
2201984
On the performance of on-line algorithms for partition problems
U Faigle, W Kern, G Turán
Acta cybernetica 9 (2), 107-119, 1989
2011989
Resolution proofs of generalized pigeonhole principles
SR Buss, G Turan
Theoretical Computer Science 62 (3), 311-317, 1988
1131988
Lower bound methods and separation results for on-line learning models
W Maass, G Turán
Machine Learning 9 (2-3), 107-145, 1992
931992
On the complexity of learning from counterexamples
W Maass, G Turán
FOCS, 262-267, 1989
841989
How fast can a threshold gate learn?
W Maass, G Turán
Proceedings of a workshop on Computational learning theory and natural …, 1994
791994
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
731988
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
501990
Malicious omissions and errors in answers to membership queries
D Angluin, M Kriķis, RH Sloan, G Turán
Machine Learning 28 (2-3), 211-255, 1997
491997
The critical complexity of graph properties
G Turán
Information Processing Letters 18 (3), 151-153, 1984
431984
Horn Complements: Towards Horn-to-Horn Belief Revision.
M Langlois, RH Sloan, B Szörényi, G Turán
AAAI, 466-471, 2008
422008
Algorithms and lower bounds for on-line learning of geometrical concepts
W Maass, G Turán
Machine Learning 14 (3), 251-269, 1994
421994
Sorting and recognition problems for ordered sets
U Faigle, G Turán
SIAM Journal on Computing 17 (1), 100-113, 1988
411988
On the definability of properties of finite graphs
G Turán
Discrete Mathematics 49 (3), 291-302, 1984
371984
Learning logic programs with structured background knowledge
T Horváth, G Turán
Artificial Intelligence 128 (1-2), 31-97, 2001
35*2001
A lower bound for read-once-only branching programs
L Babai, P Hajnal, E Szemerédi, G Turán
Journal of Computer and System Sciences 35 (2), 153-162, 1987
321987
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
311997
Learning with queries but incomplete information
RH Sloan, G Turán
Proceedings of the seventh annual conference on Computational learning …, 1994
311994
The system can't perform the operation now. Try again later.
Articles 1–20