Gyorgy Turan

Citado por

	Total	Desde 2019
Citas	3323	648
Índice h	27	12
Índice i10	57	15

140

105

19861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202412 11 21 25 32 29 62 64 112 94 85 105 108 77 68 81 87 82 86 83 101 86 96 90 108 71 88 120 80 91 102 114 103 97 126 131 123 139 32

Acceso público

Ver todo

10 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyDirección de correo verificada de igi.tugraz.at
Balazs SzorenyiSr Research Scientist at Yahoo ResearchDirección de correo verificada de yahooinc.com
Dhruv MubayiProfessor of Mathematics, University of Illinois at ChicagoDirección de correo verificada de uic.edu
Judy GoldsmithUniversity of KentuckyDirección de correo verificada de cs.uky.edu
Dimitris DiochnosUniversity of Oklahoma, School of Computer ScienceDirección de correo verificada de math.uic.edu
William CookUniversity of WaterlooDirección de correo verificada de uwaterloo.ca
Kira AdarichevaProfessor, Hofstra University, NY USADirección de correo verificada de hofstra.edu
Bhaskar DasGuptaProfessor of Computer Science, University of Illinois at ChicagoDirección de correo verificada de uic.edu
Kern, WalterUniversiteit TwenteDirección de correo verificada de utwente.nl
Farrokh VatanDirección de correo verificada de jpl.nasa.gov
Stellan OhlssonProfessor of Psychology and Computer Science, University of Illinois at ChicagoDirección de correo verificada de uic.edu
A/Professor Fatemeh VafaeeDeputy Director of UNSW Data Science Centre; Associate Professor, University of New South WalesDirección de correo verificada de unsw.edu.au
Tanya Berger-WolfProfessor of Computer Science and Engineering, Ohio State UniversityDirección de correo verificada de osu.edu
Sam BussProfessor of Mathematics and Computer ScienceDirección de correo verificada de ucsd.edu
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityDirección de correo verificada de informatik.rwth-aachen.de
Benjamin FishAssistant Professor, University of MichiganDirección de correo verificada de umich.edu
Lev ReyzinProfessor of Mathematics, Statistics, and Computer Science; University of Illinois at ChicagoDirección de correo verificada de uic.edu
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestDirección de correo verificada de cs.elte.hu
Dana AngluinProfessor of Computer Science, Yale UniversityDirección de correo verificada de cs.yale.edu
Jeremy KunGoogle, Inc.Dirección de correo verificada de google.com

Seguir

Gyorgy Turan

University of Illinois at Chicago, and Hungarian Academy of Sciences

Dirección de correo verificada de uic.edu

Computer Science Artificial Intelligence Logic Combinatorics


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
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	508	1993
On the complexity of cutting-plane proofs W Cook, CR Coullard, G Turán Discrete Applied Mathematics 18 (1), 25-38, 1987	341	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	125	1988
How fast can a threshold gate learn? W Maass, G Turán Proceedings of a workshop on Computational learning theory and natural …, 1994	113	1994
Lower bound methods and separation results for on-line learning models W Maass, G Turán Machine Learning 9, 107-145, 1992	109	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	94	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	93	1988
On the complexity of learning from counterexamples W Maass, G Turán FOCS, 262-267, 1989	86	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
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	46	2008
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 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	40	2004
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

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores