Gyorgy Turan

Citirano

	Sve	Od 2018.
Citati	3285	705
H-indeks	27	12
i10-indeks	56	15

140

105

1986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202311 11 21 25 32 29 65 62 108 94 85 107 104 77 69 84 87 85 89 84 102 86 101 91 102 66 93 119 81 91 102 112 103 94 123 131 127 127

Javni pristup

Prikaži sve

10 članaka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyPotvrđena adresa e-pošte na igi.tugraz.at
Balazs SzorenyiSr Research Scientist at Yahoo ResearchPotvrđena adresa e-pošte na yahooinc.com
Dhruv MubayiProfessor of Mathematics, University of Illinois at ChicagoPotvrđena adresa e-pošte na uic.edu
Judy GoldsmithUniversity of KentuckyPotvrđena adresa e-pošte na cs.uky.edu
Dimitris DiochnosUniversity of Oklahoma, School of Computer SciencePotvrđena adresa e-pošte na math.uic.edu
Farrokh VatanPotvrđena adresa e-pošte na jpl.nasa.gov
William CookUniversity of WaterlooPotvrđena adresa e-pošte na uwaterloo.ca
Kira AdarichevaProfessor, Hofstra University, NY USAPotvrđena adresa e-pošte na hofstra.edu
Bhaskar DasGuptaProfessor of Computer Science, University of Illinois at ChicagoPotvrđena adresa e-pošte na uic.edu
Kern, WalterUniversiteit TwentePotvrđena adresa e-pošte na utwente.nl
Stellan OhlssonProfessor of Psychology and Computer Science, University of Illinois at ChicagoPotvrđena adresa e-pošte na uic.edu
Fatemeh VafaeeDeputy Director of UNSW Data Science Centre; Associate Professor, University of New South WalesPotvrđena adresa e-pošte na unsw.edu.au
Tanya Berger-WolfProfessor of Computer Science and Engineering, Ohio State UniversityPotvrđena adresa e-pošte na osu.edu
Sam BussProfessor of Mathematics and Computer SciencePotvrđena adresa e-pošte na ucsd.edu
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityPotvrđena adresa e-pošte na informatik.rwth-aachen.de
Benjamin FishAssistant Professor, University of MichiganPotvrđena adresa e-pošte na uic.edu
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestPotvrđena adresa e-pošte na cs.elte.hu
Lev ReyzinProfessor of Mathematics, Statistics, and Computer Science; University of Illinois at ChicagoPotvrđena adresa e-pošte na uic.edu
Dana AngluinProfessor of Computer Science, Yale UniversityPotvrđena adresa e-pošte na cs.yale.edu
Jeremy KunGoogle, Inc.Potvrđena adresa e-pošte na google.com

Prati

Gyorgy Turan

University of Illinois at Chicago, and Hungarian Academy of Sciences

Potvrđena adresa e-pošte na uic.edu

Computer Science Artificial Intelligence Logic Combinatorics


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
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	504	1993
On the complexity of cutting-plane proofs W Cook, CR Coullard, G Turán Discrete Applied Mathematics 18 (1), 25-38, 1987	339	1987
On the succinct representation of graphs G Turán Discrete Applied Mathematics 8 (3), 289-294, 1984	262	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	239	1989
Resolution proofs of generalized pigeonhole principles SR Buss, G Turan Theoretical Computer Science 62 (3), 311-317, 1988	121	1988
How fast can a threshold gate learn? W Maass, G Turán Proceedings of a workshop on Computational learning theory and natural …, 1994	109	1994
Lower bound methods and separation results for on-line learning models W Maass, G Turán Machine Learning 9, 107-145, 1992	108	1992
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	93	1986
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	90	1988
On the complexity of learning from counterexamples W Maass, G Turán FOCS, 262-267, 1989	85	1989
Malicious omissions and errors in answers to membership queries D Angluin, M Kriķis, RH Sloan, G Turán Machine Learning 28, 211-255, 1997	54	1997
Algorithms and lower bounds for on-line learning of geometrical concepts W Maass, G Turán Machine Learning 14, 251-269, 1994	51	1994
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	51	1990
The critical complexity of graph properties G TURIN Inform. Process. Lm 18, 151-153, 1984	51	1984
Horn Complements: Towards Horn-to-Horn Belief Revision. M Langlois, RH Sloan, B Szörényi, G Turán AAAI, 466-471, 2008	46	2008
Sorting and recognition problems for ordered sets U Faigle, G Turán SIAM Journal on Computing 17 (1), 100-113, 1988	46	1988
On the definability of properties of finite graphs G Turán Discrete Mathematics 49 (3), 291-302, 1984	41	1984
Learnability and definability in trees and similar structures M Grohe, G Turán Theory of Computing Systems 37 (1), 193-220, 2004	39	2004
Learning logic programs with structured background knowledge T Horváth, G Turán Artificial Intelligence 128 (1-2), 31-97, 2001	39	2001
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	36	1997

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori