Подписаться
Gabor Tardos
Gabor Tardos
Rényi Institute of Mathematics, Hungarian Academy of Scieces
Нет подтвержденного адреса электронной почты - Главная страница
Название
Процитировано
Процитировано
Год
On the power of randomization in on-line algorithms
S Ben-David, A Borodin, R Karp, G Tardos, A Wigderson
Algorithmica 11 (1), 2-14, 1994
5581994
Optimal probabilistic fingerprint codes
G Tardos
Journal of the ACM (JACM) 55 (2), 1-24, 2008
5382008
A constructive proof of the general Lovász local lemma
RA Moser, G Tardos
Journal of the ACM (JACM) 57 (2), 1-15, 2010
5022010
Excluded permutation matrices and the Stanley–Wilf conjecture
A Marcus, G Tardos
Journal of Combinatorial Theory, Series A 107 (1), 153-160, 2004
4652004
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
1832011
Improving the crossing lemma by finding more crossings in sparse graphs
J Pach, R Radoicic, G Tardos, G Tóth
Discrete & Computational Geometry 36 (4), 527-552, 2006
1482006
A new entropy inequality for the Erdos distance problem
NH Katz, G Tardos
Contemporary Mathematics 342, 119-126, 2004
1142004
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
1082007
Query complexity, or why is it difficult to separateNP A∩ coNP A fromP A by random oraclesA?
G Tardos
Combinatorica 9 (4), 385-392, 1989
1001989
High rate fingerprinting codes and the fingerprinting capacity
E Amiri, G Tardos
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
992009
Local chromatic number, Ky Fan's theorem, and circular colorings
G Simonyi*, G Tardos
Combinatorica 26 (5), 587-626, 2006
992006
Polynomial bound for a chip firing game on graphs
G Tardos
SIAM journal on discrete mathematics 1 (3), 397-398, 1988
991988
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
922000
Tight lower bounds for the size of epsilon-nets
J Pach, G Tardos
Journal of the American Mathematical Society 26 (3), 645-658, 2013
892013
Conflict-free colourings of graphs and hypergraphs
J Pach, G Tardos
Combinatorics, Probability and Computing 18 (5), 819-834, 2009
882009
Forbidden paths and cycles in ordered graphs and matrices
J Pach, G Tardos
Israel Journal of Mathematics 155 (1), 359-380, 2006
842006
The local lemma is asymptotically tight for SAT
H Gebauer, T Szabó, G Tardos
Journal of the ACM (JACM) 63 (5), 1-32, 2016
732016
On 0–1 matrices and small excluded submatrices
G Tardos
Journal of Combinatorial Theory, Series A 111 (2), 266-288, 2005
722005
Linear hash functions
N Alon, M Dietzfelbinger, PB Miltersen, E Petrank, G Tardos
Journal of the ACM (JACM) 46 (5), 667-683, 1999
631999
Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
X Chen, J Pach, M Szegedy, G Tardos
Random Structures & Algorithms 34 (1), 11-23, 2009
622009
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20