Gyorgy Turan

Citeras av

	Alla	Sedan 2020
Citat	3455	652
h-index	28	12
i10-index	58	14

140

105

198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202512 11 21 27 33 25 66 64 110 96 90 101 104 78 69 86 85 84 91 86 100 94 99 96 104 73 88 122 78 91 106 114 106 94 127 128 126 131 125 15

Offentlig åtkomst

Visa alla

12 artiklar

0 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyVerifierad e-postadress på igi.tugraz.at
Balazs SzorenyiSr Research Scientist at Yahoo ResearchVerifierad e-postadress på yahooinc.com
Dhruv MubayiProfessor of Mathematics, University of Illinois at ChicagoVerifierad e-postadress på uic.edu
Judy GoldsmithUniversity of KentuckyVerifierad e-postadress på cs.uky.edu
Dimitris DiochnosUniversity of Oklahoma, School of Computer ScienceVerifierad e-postadress på math.uic.edu
Bhaskar DasGuptaProfessor of Computer Science, University of Illinois at ChicagoVerifierad e-postadress på uic.edu
William CookUniversity of WaterlooVerifierad e-postadress på uwaterloo.ca
Kira AdarichevaProfessor, Hofstra University, NY USAVerifierad e-postadress på hofstra.edu
Kern, WalterUniversiteit TwenteVerifierad e-postadress på utwente.nl
Farrokh VatanVerifierad e-postadress på jpl.nasa.gov
Stellan OhlssonProfessor of Psychology and Computer Science, University of Illinois at ChicagoVerifierad e-postadress på uic.edu
Tanya Berger-WolfProfessor of Computer Science and Engineering, Ohio State UniversityVerifierad e-postadress på osu.edu
A/Professor Fatemeh VafaeeDeputy Director of UNSW Data Science Centre; Associate Professor, University of New South WalesVerifierad e-postadress på unsw.edu.au
Sam BussProfessor of Mathematics and Computer ScienceVerifierad e-postadress på ucsd.edu
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerifierad e-postadress på informatik.rwth-aachen.de
Benjamin FishAssistant Professor, University of MichiganVerifierad e-postadress på umich.edu
Lev ReyzinProfessor of Mathematics, Statistics, and Computer Science; University of Illinois at ChicagoVerifierad e-postadress på uic.edu
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestVerifierad e-postadress på cs.elte.hu
Dana AngluinProfessor of Computer Science, Yale UniversityVerifierad e-postadress på cs.yale.edu
Jeremy KunGoogle, Inc.Verifierad e-postadress på google.com

Följ

Gyorgy Turan

University of Illinois at Chicago, and Hungarian Academy of Sciences

Verifierad e-postadress på uic.edu

Computer Science Artificial Intelligence Logic Combinatorics


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
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	526	1993
On the complexity of cutting-plane proofs W Cook, CR Coullard, G Turán Discrete Applied Mathematics 18 (1), 25-38, 1987	365	1987
On the succinct representation of graphs G Turán Discrete Applied Mathematics 8 (3), 289-294, 1984	261	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	245	1989
Resolution proofs of generalized pigeonhole principles SR Buss, G Turan Theoretical Computer Science 62 (3), 311-317, 1988	127	1988
How fast can a threshold gate learn? W Maass, G Turán Proceedings of a workshop on Computational learning theory and natural …, 1994	121	1994
Lower bound methods and separation results for on-line learning models W Maass, G Turán Machine Learning 9, 107-145, 1992	113	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	101	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	95	1986
On the complexity of learning from counterexamples W Maass, G Turán FOCS, 262-267, 1989	87	1989
The critical complexity of graph properties G TURIN Inform. Process. Lm 18, 151-153, 1984	55	1984
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	53	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
Sorting and recognition problems for ordered sets U Faigle, G Turán SIAM Journal on Computing 17 (1), 100-113, 1988	47	1988
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
Learnability and definability in trees and similar structures M Grohe, G Turán Theory of Computing Systems 37 (1), 193-220, 2004	42	2004
On the definability of properties of finite graphs G Turán Discrete Mathematics 49 (3), 291-302, 1984	42	1984
Learning logic programs with structured background knowledge T Horváth, G Turán Artificial Intelligence 128 (1-2), 31-97, 2001	41	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	38	1997

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare