Követés
Gabor Tardos
Gabor Tardos
Rényi Institute of Mathematics, Hungarian Academy of Scieces
Nincs ellenőrzött e-mail-cím - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
On the power of randomization in on-line algorithms
S Ben-David, A Borodin, R Karp, G Tardos, A Wigderson
Algorithmica 11, 2-14, 1994
5691994
Optimal probabilistic fingerprint codes
G Tardos
Journal of the ACM (JACM) 55 (2), 1-24, 2008
5412008
A constructive proof of the general Lovász local lemma
RA Moser, G Tardos
Journal of the ACM (JACM) 57 (2), 1-15, 2010
5292010
Excluded permutation matrices and the Stanley–Wilf conjecture
A Marcus, G Tardos
Journal of Combinatorial Theory, Series A 107 (1), 153-160, 2004
4892004
Tight bounds for lp samplers, finding duplicates in streams, and related problems
H Jowhari, M Sağlam, G Tardos
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on …, 2011
2032011
Improving the crossing lemma by finding more crossings in sparse graphs
J Pach, R Radoicić, G Tardos, G Tóth
Proceedings of the twentieth annual symposium on Computational geometry, 68-75, 2004
1492004
A new entropy inequality for the Erdos distance problem
NH Katz, G Tardos
Contemporary Mathematics 342, 119-126, 2004
1152004
On the maximum number of edges in quasi-planar graphs
E Ackerman, G Tardos
Journal of Combinatorial Theory, Series A 114 (3), 563-571, 2007
1092007
Query complexity, or why is it difficult to separateNP A ∩coNP A fromP A by random oraclesA?
G Tardos
Combinatorica 9, 385-392, 1989
1071989
Polynomial bound for a chip firing game on graphs
G Tardos
SIAM journal on discrete mathematics 1 (3), 397-398, 1988
1011988
High rate fingerprinting codes and the fingerprinting capacity
E Amiri, G Tardos
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
992009
An improved bound for k-sets in three dimensions
M Sharir, S Smorodinsky, G Tardos
Proceedings of the sixteenth annual symposium on Computational geometry, 43-49, 2000
992000
Local chromatic number, Ky Fan's theorem, and circular colorings
G Simonyi*, G Tardos
Combinatorica 26 (5), 587-626, 2006
972006
Conflict-free colourings of graphs and hypergraphs
J Pach, G Tardos
Combinatorics, Probability and Computing 18 (5), 819-834, 2009
932009
Tight lower bounds for the size of epsilon-nets
J Pach, G Tardos
Proceedings of the twenty-seventh annual symposium on Computational geometry …, 2011
922011
Forbidden paths and cycles in ordered graphs and matrices
J Pach, G Tardos
Israel Journal of Mathematics 155 (1), 359-380, 2006
922006
The local lemma is asymptotically tight for SAT
H Gebauer, T Szabó, G Tardos
Journal of the ACM (JACM) 63 (5), 1-32, 2016
742016
On 0–1 matrices and small excluded submatrices
G Tardos
Journal of Combinatorial Theory, Series A 111 (2), 266-288, 2005
722005
Intersection reverse sequences and geometric applications
A Marcus, G Tardos
Journal of Combinatorial Theory, Series A 113 (4), 675-691, 2006
652006
Bounded size components—partitions and transversals
P Haxell, T Szabó, G Tardos
Journal of Combinatorial Theory, Series B 88 (2), 281-297, 2003
642003
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20