×
Author ID: turan.gyorgy Recent zbMATH articles by "Turán, Gyorgy"
Published as: Turán, György; Turán, Gy.; Turan, Gy.; Turan, Gyorgy; Turan, György; Turán, Gyorgy; Turán, G.

Publications by Year

Citations contained in zbMATH Open

55 Publications have been cited 443 times in 400 Documents Cited by Year
On the preformance of on-line algorithms for partition problems. Zbl 0689.68051
Faigle, Ulrich; Kern, Walter; Turán, György
77
1989
Threshold circuits of bounded depth. Zbl 0801.68052
Hajnal, András; Maass, Wolfgang; Pudlák, Pavel; Szegedy, Márió; Turán, György
62
1993
On the complexity of cutting-plane proofs. Zbl 0625.90056
Cook, W.; Coullard, C. R.; Turan, Gy.
57
1987
On the succinct representation of graphs. Zbl 0551.68059
Turán, György
25
1984
Lower bound methods and separation results for on-line learning models. Zbl 0766.68113
Maass, Wolfgang; Turán, György
21
1992
Resolution proofs of generalized pigeonhole principles. Zbl 0709.03006
Buss, Samuel R.; Turán, György
18
1988
The critical complexity of graph properties. Zbl 0542.68026
Turán, György
12
1984
Searching in trees, series-parallel and interval orders. Zbl 0619.68057
Faigle, U.; Lovász, László; Schrader, R.; Turán, Gy.
11
1986
A lower bound for read-once-only branching programs. Zbl 0652.68062
Babai, László; Hajnal, Péter; Szemerédi, Endre; Turán, György
10
1987
Malicious omissions and errors in answers to membership queries. Zbl 0881.68094
Angluin, Dana; Kriķis, Mārtiņš; Sloan, Robert H.; Turán, György
10
1997
Algorithms and lower bounds for on-line learning of geometrical concepts. Zbl 0808.68064
Maass, Wolfgang; Turán, György
9
1994
On approximate Horn formula minimization. Zbl 1288.68086
Bhattacharya, Amitava; DasGupta, Bhaskar; Mubayi, Dhruv; Turán, György
7
2010
Lower bounds for synchronous circuits and planar circuits. Zbl 0662.94021
Turán, György
6
1989
On the definability of properties of finite graphs. Zbl 0536.05060
Turán, György
6
1984
On the complexity of graph grammars. Zbl 0555.68042
Turán, G.
6
1983
Learnability and definability in trees and similar structures. Zbl 1062.03031
Grohe, Martin; Turán, Gy.
6
2004
On the computation of Boolean functions by analog circuits of bounded fan-in. Zbl 0869.68050
Turán, György; Vatan, Farrokh
6
1997
On the complexity of planar Boolean circuits. Zbl 0816.68069
Turán, György
5
1995
Learning logic programs with structured background knowledge. Zbl 0971.68131
Horváth, T.; Turán, G.
5
2001
On linear decision trees computing Boolean functions. Zbl 0769.68044
Gröger, Hans Dietmar; Turán, György
5
1991
Linear decision lists and partitioning algorithms for the construction of neural networks. Zbl 0867.68090
Turán, György; Vatan, Farrokh
4
1997
Stack of pancakes. Zbl 0467.05003
Györi, Ervin; Turan, György
4
1978
Hydras: directed hypergraphs and Horn formulas. Zbl 1357.68151
Sloan, Robert H.; Stasi, Despina; Turán, György
4
2017
Sorting and recognition problems for ordered sets. Zbl 0637.68064
Faigle, U.; Turán, Gy.
3
1988
On the complexity of graph grammars. Zbl 0547.68077
Turán, György
3
1983
Learning Boolean functions with queries. Zbl 1213.68507
Sloan, Robert H.; Szörényi, Balázs; Turán, György
3
2010
Projective DNF formulae and their revision. Zbl 1274.68350
Sloan, Robert H.; Szörényi, Balázs; Turán, György
3
2003
The DNF exception problem. Zbl 1086.68113
Mubayi, Dhruv; Turán, György; Zhao, Yi
3
2006
On frequent sets of Boolean matrices. Zbl 0930.68128
Sloan, Robert H.; Takata, Ken; Turán, György
3
1998
Theory revision with queries: DNF formulas. Zbl 1012.68094
Goldsmith, Judy; Sloan, Robert H.; Turán, György
3
2002
On \(k\)-term DNF with the largest number of prime implicants. Zbl 1158.94008
Sloan, Robert H.; Szörényi, Balázs; Turán, György
3
2007
Theory revision with queries: Horn, read-once, and parity formulas. Zbl 1085.68071
Goldsmith, Judy; Sloan, Robert H.; Szörényi, Balázs; Turán, György
3
2004
On the complexity of learning from counterexamples. Zbl 0747.68055
Maass, Wolfgang; Turán, György
3
1989
A linear lower bound for the size of threshold circuits. Zbl 1023.68512
Gröger, Hans Dietmar; Turán, Gy.
3
1993
Finding bipartite subgraphs efficiently. Zbl 1197.05150
Mubayi, Dhruv; Turán, György
3
2010
Hydras: directed hypergraphs and Horn formulas. Zbl 1341.05181
Sloan, Robert H.; Stasi, Despina; Turán, György
3
2012
On the computational complexity of MapReduce. Zbl 1394.68176
Fish, Benjamin; Kun, Jeremy; Lelkes, Ádám D.; Reyzin, Lev; Turán, György
3
2015
The complexity of defining a relation on a finite graph. Zbl 0638.03043
Babai, L.; Turán, Gy.
2
1987
On multiple-instance learning of halfspaces. Zbl 1248.68402
Diochnos, D. I.; Sloan, R. H.; Turán, Gy.
2
2012
Horn upper bounds and renaming. Zbl 1221.68103
Langlois, Marina; Sloan, Robert H.; Turán, György
2
2010
Combinatorial problems for Horn clauses. Zbl 1194.68213
Langlois, Marina; Mubayi, Dhruv; Sloan, Robert H.; Turán, György
2
2009
On evolvability: the swapping algorithm, product distributions, and covariance. Zbl 1260.92092
Diochnos, Dimitrios I.; Turán, György
2
2009
Learnability and definability in trees and similar structures. Zbl 1054.68074
Grohe, Martin; Turán, Gyorgy
2
2002
Horn upper bounds and renaming. Zbl 1214.68385
Langlois, Marina; Sloan, Robert H.; Turán, György
2
2007
Sorting and recognition problems for ordered sets. Zbl 0569.68052
Faigle, U.; Turán, Gy.
2
1984
On the complexity of interval orders and semiorders. Zbl 0612.68041
Faigle, U.; Turán, Gy.
2
1987
On restricted Boolean circuits. Zbl 0728.94009
Turán, György
2
1989
The communication complexity of interval orders. Zbl 0757.94002
Faigle, Ulrich; Schrader, Rainer; Turán, György
2
1992
Two tapes versus one for off-line Turing machines. Zbl 0802.68048
Maass, Wolfgang; Schnitger, Georg; Szemerédi, Endre; Turán, György
2
1993
On cellular graph-automata and second-order definable graph-properties. Zbl 0479.68059
Turan, Gy.
1
1981
New revision algorithms. Zbl 1110.68394
Goldsmith, Judy; Sloan, Robert H.; Szörényi, Balázs; Turán, György
1
2004
A size-depth trade-off for the analog computation of Boolean functions. Zbl 1023.68588
Turán, György; Vatan, Farrokh
1
1996
Resolution proofs of generalized pigeonhole principles. Zbl 0797.03007
Buss, Samuel R.; Turán, György
1
1988
Characterizability in Horn belief revision. Zbl 1483.03014
Yaggie, Jon; Turán, György
1
2016
Betweenness centrality profiles in trees. Zbl 1462.05060
Fish, Benjamin; Kushwaha, Rahul; Turán, György
1
2017
Hydras: directed hypergraphs and Horn formulas. Zbl 1357.68151
Sloan, Robert H.; Stasi, Despina; Turán, György
4
2017
Betweenness centrality profiles in trees. Zbl 1462.05060
Fish, Benjamin; Kushwaha, Rahul; Turán, György
1
2017
Characterizability in Horn belief revision. Zbl 1483.03014
Yaggie, Jon; Turán, György
1
2016
On the computational complexity of MapReduce. Zbl 1394.68176
Fish, Benjamin; Kun, Jeremy; Lelkes, Ádám D.; Reyzin, Lev; Turán, György
3
2015
Hydras: directed hypergraphs and Horn formulas. Zbl 1341.05181
Sloan, Robert H.; Stasi, Despina; Turán, György
3
2012
On multiple-instance learning of halfspaces. Zbl 1248.68402
Diochnos, D. I.; Sloan, R. H.; Turán, Gy.
2
2012
On approximate Horn formula minimization. Zbl 1288.68086
Bhattacharya, Amitava; DasGupta, Bhaskar; Mubayi, Dhruv; Turán, György
7
2010
Learning Boolean functions with queries. Zbl 1213.68507
Sloan, Robert H.; Szörényi, Balázs; Turán, György
3
2010
Finding bipartite subgraphs efficiently. Zbl 1197.05150
Mubayi, Dhruv; Turán, György
3
2010
Horn upper bounds and renaming. Zbl 1221.68103
Langlois, Marina; Sloan, Robert H.; Turán, György
2
2010
Combinatorial problems for Horn clauses. Zbl 1194.68213
Langlois, Marina; Mubayi, Dhruv; Sloan, Robert H.; Turán, György
2
2009
On evolvability: the swapping algorithm, product distributions, and covariance. Zbl 1260.92092
Diochnos, Dimitrios I.; Turán, György
2
2009
On \(k\)-term DNF with the largest number of prime implicants. Zbl 1158.94008
Sloan, Robert H.; Szörényi, Balázs; Turán, György
3
2007
Horn upper bounds and renaming. Zbl 1214.68385
Langlois, Marina; Sloan, Robert H.; Turán, György
2
2007
The DNF exception problem. Zbl 1086.68113
Mubayi, Dhruv; Turán, György; Zhao, Yi
3
2006
Learnability and definability in trees and similar structures. Zbl 1062.03031
Grohe, Martin; Turán, Gy.
6
2004
Theory revision with queries: Horn, read-once, and parity formulas. Zbl 1085.68071
Goldsmith, Judy; Sloan, Robert H.; Szörényi, Balázs; Turán, György
3
2004
New revision algorithms. Zbl 1110.68394
Goldsmith, Judy; Sloan, Robert H.; Szörényi, Balázs; Turán, György
1
2004
Projective DNF formulae and their revision. Zbl 1274.68350
Sloan, Robert H.; Szörényi, Balázs; Turán, György
3
2003
Theory revision with queries: DNF formulas. Zbl 1012.68094
Goldsmith, Judy; Sloan, Robert H.; Turán, György
3
2002
Learnability and definability in trees and similar structures. Zbl 1054.68074
Grohe, Martin; Turán, Gyorgy
2
2002
Learning logic programs with structured background knowledge. Zbl 0971.68131
Horváth, T.; Turán, G.
5
2001
On frequent sets of Boolean matrices. Zbl 0930.68128
Sloan, Robert H.; Takata, Ken; Turán, György
3
1998
Malicious omissions and errors in answers to membership queries. Zbl 0881.68094
Angluin, Dana; Kriķis, Mārtiņš; Sloan, Robert H.; Turán, György
10
1997
On the computation of Boolean functions by analog circuits of bounded fan-in. Zbl 0869.68050
Turán, György; Vatan, Farrokh
6
1997
Linear decision lists and partitioning algorithms for the construction of neural networks. Zbl 0867.68090
Turán, György; Vatan, Farrokh
4
1997
A size-depth trade-off for the analog computation of Boolean functions. Zbl 1023.68588
Turán, György; Vatan, Farrokh
1
1996
On the complexity of planar Boolean circuits. Zbl 0816.68069
Turán, György
5
1995
Algorithms and lower bounds for on-line learning of geometrical concepts. Zbl 0808.68064
Maass, Wolfgang; Turán, György
9
1994
Threshold circuits of bounded depth. Zbl 0801.68052
Hajnal, András; Maass, Wolfgang; Pudlák, Pavel; Szegedy, Márió; Turán, György
62
1993
A linear lower bound for the size of threshold circuits. Zbl 1023.68512
Gröger, Hans Dietmar; Turán, Gy.
3
1993
Two tapes versus one for off-line Turing machines. Zbl 0802.68048
Maass, Wolfgang; Schnitger, Georg; Szemerédi, Endre; Turán, György
2
1993
Lower bound methods and separation results for on-line learning models. Zbl 0766.68113
Maass, Wolfgang; Turán, György
21
1992
The communication complexity of interval orders. Zbl 0757.94002
Faigle, Ulrich; Schrader, Rainer; Turán, György
2
1992
On linear decision trees computing Boolean functions. Zbl 0769.68044
Gröger, Hans Dietmar; Turán, György
5
1991
On the preformance of on-line algorithms for partition problems. Zbl 0689.68051
Faigle, Ulrich; Kern, Walter; Turán, György
77
1989
Lower bounds for synchronous circuits and planar circuits. Zbl 0662.94021
Turán, György
6
1989
On the complexity of learning from counterexamples. Zbl 0747.68055
Maass, Wolfgang; Turán, György
3
1989
On restricted Boolean circuits. Zbl 0728.94009
Turán, György
2
1989
Resolution proofs of generalized pigeonhole principles. Zbl 0709.03006
Buss, Samuel R.; Turán, György
18
1988
Sorting and recognition problems for ordered sets. Zbl 0637.68064
Faigle, U.; Turán, Gy.
3
1988
Resolution proofs of generalized pigeonhole principles. Zbl 0797.03007
Buss, Samuel R.; Turán, György
1
1988
On the complexity of cutting-plane proofs. Zbl 0625.90056
Cook, W.; Coullard, C. R.; Turan, Gy.
57
1987
A lower bound for read-once-only branching programs. Zbl 0652.68062
Babai, László; Hajnal, Péter; Szemerédi, Endre; Turán, György
10
1987
The complexity of defining a relation on a finite graph. Zbl 0638.03043
Babai, L.; Turán, Gy.
2
1987
On the complexity of interval orders and semiorders. Zbl 0612.68041
Faigle, U.; Turán, Gy.
2
1987
Searching in trees, series-parallel and interval orders. Zbl 0619.68057
Faigle, U.; Lovász, László; Schrader, R.; Turán, Gy.
11
1986
On the succinct representation of graphs. Zbl 0551.68059
Turán, György
25
1984
The critical complexity of graph properties. Zbl 0542.68026
Turán, György
12
1984
On the definability of properties of finite graphs. Zbl 0536.05060
Turán, György
6
1984
Sorting and recognition problems for ordered sets. Zbl 0569.68052
Faigle, U.; Turán, Gy.
2
1984
On the complexity of graph grammars. Zbl 0555.68042
Turán, G.
6
1983
On the complexity of graph grammars. Zbl 0547.68077
Turán, György
3
1983
On cellular graph-automata and second-order definable graph-properties. Zbl 0479.68059
Turan, Gy.
1
1981
Stack of pancakes. Zbl 0467.05003
Györi, Ervin; Turan, György
4
1978
all top 5

Cited by 580 Authors

16 Turán, Gyorgy
9 Epstein, Leah
7 Albers, Susanne
7 Podol’skiĭ, Vladimir Vladimirovich
6 Kellerer, Johann
6 Pitassi, Toniann
6 Sloan, Robert H.
5 Boros, Endre
5 Bshouty, Nader H.
5 Dósa, György
5 He, Yong
5 Hromkovič, Juraj
5 Jeřábek, Emil
5 Kotov, Vladimir M.
5 Maass, Wolfgang
5 Servedio, Rocco A.
5 Sun, Xiaoming
4 Cao, Qian
4 Chen, Zhixiang
4 Cheng, Tai-Chiu Edwin
4 Dantchev, Stefan Stoyanov
4 De Oliveira Oliveira, Mateus
4 Faigle, Ulrich
4 Fuentes-Sepúlveda, José
4 Gashkov, Sergey B.
4 Kučera, Petr
4 Maciel, Alexis
4 Makowsky, Johann-Andreas
4 Martin, Barnaby D.
4 Nordström, Jakob
4 Razborov, Aleksandr Aleksandrovich
4 Simon, Hans-Ulrich
4 Tuza, Zsolt
4 Welzl, Emo
4 Zhang, Guochuan
3 Arimura, Hiroki
3 Atserias, Albert
3 Basu, Amitabh
3 Bérczi, Kristóf
3 Čepek, Ondřej
3 Conforti, Michele
3 Cook, William John
3 Crespelle, Christophe
3 Di Summa, Marco
3 Fagin, Ronald
3 Farzan, Arash
3 Fleming, Noah
3 Havill, Jessen T.
3 Hellwig, Matthias
3 Janke, Maximilian
3 Krajíček, Jan
3 Lauria, Massimo
3 Long, Philip M.
3 Mahajan, Meena
3 Makino, Kazuhisa
3 Maksimov, Yu. V.
3 Mubayi, Dhruv
3 Munro, J. Ian
3 Navarro, Gonzalo
3 O’Donnell, Ryan
3 Rozenberg, Grzegorz
3 Schrader, Rainer
3 Seco, Diego
3 Seiden, Steve S.
3 Sgall, Jiří
3 Sherstov, Alexander A.
3 Silva, Janio Carlos Nascimento
3 Szörényi, Balázs
3 Tan, Zhiyi
3 Uchizawa, Kei
3 Wan, Guohua
3 Williams, Richard Ryan
3 Woeginger, Gerhard
3 Xu, Yinfeng
3 Ye, Deshi
2 Adler, Isolde
2 Ajtai, Miklós
2 Alves, Mateus Rodrigues
2 Azar, Yossi
2 Beame, Paul W.
2 Beyersdorff, Olaf
2 Bogaerts, Bart
2 Bonet, Maria Luisa
2 Bun, Mark
2 Buss, Samuel R.
2 Chen, Lijie
2 Chew, Leroy
2 Chistopolskaya, Anastasiya
2 Cibulka, Josef
2 Cicalese, Ferdinando
2 Cook, Stephen Arthur
2 Dahiya, Yogesh
2 De Wulf, Wolf
2 Diochnos, Dimitrios I.
2 dos Santos Souza, Uéverton
2 Englert, Matthias
2 Feldman, Vitaly
2 Flasiński, Mariusz
2 Furedi, Zoltan
2 Gál, Anna
...and 480 more Authors
all top 5

Cited in 89 Serials

66 Theoretical Computer Science
25 Discrete Applied Mathematics
19 Journal of Computer and System Sciences
18 Information Processing Letters
18 Information and Computation
12 Algorithmica
10 Journal of Combinatorial Optimization
8 Discrete Mathematics
8 SIAM Journal on Computing
8 Operations Research Letters
8 Journal of Scheduling
7 Annals of Pure and Applied Logic
7 Annals of Mathematics and Artificial Intelligence
7 Theory of Computing Systems
6 The Journal of Symbolic Logic
6 Mathematical Programming. Series A. Series B
6 Computational Complexity
5 Machine Learning
5 Archive for Mathematical Logic
4 Constraints
3 Mathematical Notes
3 Combinatorica
3 Computational Geometry
3 Discrete Optimization
3 Logical Methods in Computer Science
3 Computer Science Review
2 Artificial Intelligence
2 Computers & Mathematics with Applications
2 Moscow University Mathematics Bulletin
2 Journal of Combinatorial Theory. Series A
2 European Journal of Combinatorics
2 Advances in Applied Mathematics
2 Asia-Pacific Journal of Operational Research
2 SIAM Journal on Discrete Mathematics
2 Neural Computation
1 Acta Informatica
1 Israel Journal of Mathematics
1 Journal of Statistical Physics
1 Zhurnal Vychislitel’noĭ Matematiki i Matematicheskoĭ Fiziki
1 Theory of Probability and its Applications
1 Algebra Universalis
1 Journal of Mathematical Psychology
1 Journal of Number Theory
1 Journal of Statistical Planning and Inference
1 Kybernetika
1 Mathematical Programming
1 SIAM Journal on Numerical Analysis
1 Statistica Neerlandica
1 Studia Logica
1 OR Spektrum
1 Order
1 Acta Mathematicae Applicatae Sinica. English Series
1 Optimization
1 Graphs and Combinatorics
1 Discrete & Computational Geometry
1 Computers & Operations Research
1 Journal of Automated Reasoning
1 Journal of the American Mathematical Society
1 Annals of Operations Research
1 International Journal of Foundations of Computer Science
1 Computational Mathematics and Mathematical Physics
1 European Journal of Operational Research
1 Linear Algebra and its Applications
1 SIAM Review
1 Distributed Computing
1 Mathematical Logic Quarterly (MLQ)
1 The Electronic Journal of Combinatorics
1 Izvestiya: Mathematics
1 Doklady Mathematics
1 Optimization Methods & Software
1 Journal of the ACM
1 PAA. Pattern Analysis and Applications
1 Proceedings of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
1 Interdisciplinary Information Sciences (IIS)
1 RAIRO. Theoretical Informatics and Applications
1 CEJOR. Central European Journal of Operations Research
1 Journal of Systems Science and Complexity
1 Journal of Applied Mathematics
1 Comptes Rendus. Mathématique. Académie des Sciences, Paris
1 ACM Transactions on Computational Logic
1 Journal of Discrete Algorithms
1 Proceedings of the Steklov Institute of Mathematics
1 Logica Universalis
1 Optimization Letters
1 Foundations and Trends in Theoretical Computer Science
1 Algorithms
1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
1 Theory of Computing
1 Prikladnaya Diskretnaya Matematika

Citations by Year