Gábor Tardos - Selected Publications#

A. Marcus, G. Tardos, Excluded permutation matrices and the Stanley-Wilf conjecture, Journal of Combinatorial Theory Ser. A, 107 (2004) (1), 153–160.

G. Tardos, Optimal probabilistic fingerprint codes, Journal of the ACM 55 (2008) (2), Art. 10, 24pp.

E. Amiri, G. Tardos, High rate fingerprinting codes and the fingerprinting capacity, in: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 336–345.

R. A. Moser, G. Tardos, A constructive proof of the general Lovász local lemma, Journal of the ACM 57 (2010) (2) Art. 11, 15 pp.

H. Gebauer, T. Szabó, G. Tardos, The local lemma is tight for SAT, in: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 664–674.

G. Tardos, Construction of locally plane graphs with many edges, in: Thirty Essays on Geometric Graph Theory, Algorithms and Combinatorics series, 29 (J. Pach, ed.), Springer, 2012, 541–562.

B. Mohar, G. Simonyi, G. Tardos, Local chromatic number of quadrangulations of surfaces, Combinatorica 33 (2013) (4), 467–494.

P. L. Erdős, C. Tardif, G. Tardos, On infinite-finite duality pairs of directed graphs, Order 30 (2013), 807–819.

J. Pach, G. Tardos, Tight lower bounds for the size of epsilon-nets, Journal of the AMS 26 (2013), 645–658.

M. Sağlam, G. Tardos, On the communication complexity of sparse set disjointness and exists-equal problems, in: Proceedings of the 54th Annual Symposium on Foundations of Computer Science (FOCS 2013), 678–687.