#### Filter Results:

- Full text PDF available (75)

#### Publication Year

1988

2017

- This year (5)
- Last 5 years (27)
- Last 10 years (50)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gábor Tardos
- STOC
- 2003

We construct binary codes for fingerprinting. Our codes for <i>n</i> users that are <i>ε</i>-secure against <i>c</i> pirates have length <i>O(c<sup>2</sup> log(n/ε))</i>. This improves the codes proposed by Boneh and Shaw [3] whose length is approximately the square of this length. Our codes are probabilistic. By proving matching lower bounds we… (More)

- Robin A. Moser, Gábor Tardos
- J. ACM
- 2010

The Lovász Local Lemma discovered by Erdős and Lovász in 1975 is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In 1991, József Beck was the first to demonstrate that a constructive variant can be given under certain more restrictive conditions, starting a… (More)

- Adam Marcus, Gábor Tardos
- J. Comb. Theory, Ser. A
- 2004

This paper examines the extremal problem of how many 1-entries an n × n 0–1 matrix can have that avoids a certain fixed submatrix P . For any permutation matrix P we prove a linear bound, settling a conjecture of Zoltán Füredi and Péter Hajnal [8]. Due to the work of Martin Klazar [12], this also settles the conjecture of Stanley and Wilf on the number of… (More)

- Ehsan Amiri, Gábor Tardos
- SODA
- 2009

Including a unique code in each copy of a distributed document is an effective way of fighting intellectual piracy. Codes designed for this purpose that are secure against collusion attacks are called fingerprinting codes. In this paper we consider fingerprinting with the marking assumption and design codes that achieve much higher rates than previous… (More)

- Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson
- Algorithmica
- 1990

Against in adaptive adversary, we show that the power of randomization in on-line algorithms is severely limited! We prove the existence of an efficient “simulation” of randomized on-line algorithms by deterministic ones, which is best possible in general. The proof of the upper bound is existential. We deal with the issue of computing the efficient… (More)

- Gábor Tardos
- J. Comb. Theory, Ser. A
- 2005

- Hossein Jowhari, Mert Saglam, Gábor Tardos
- PODS
- 2011

In this paper, we present near-optimal space bounds for <i>L<sub>p</sub></i>-samplers. Given a stream of updates (additions and subtraction) to the coordinates of an underlying vector <i>x</i> in <i>R<sup>n</sup></i>, a perfect <i>L<sub>p</sub></i> sampler outputs the <i>i</i>-th coordinate with probability… (More)

Twenty years ago, Ajtai, Chvátal, Newborn, Szemerédi, and, independently, Leighton discovered that the crossing number of any graph with v vertices and e > 4v edges is at least ce/v, where c > 0 is an absolute constant. This result, known as the ‘Crossing Lemma,’ has found many important applications in discrete and computational geometry. It is tight up to… (More)

- Gábor Tardos, David A. Mix Barrington
- computational complexity
- 1995

We examine the computational power of modular counting, where the modulus m is not a prime power, in the setting of polynomials in Boolean variables over Z m . In particular, we say that a polynomial P weakly represents a Boolean function f (both have n variables) if for any inputs x and y in {0,1}n, we have $P(x)\neq P(y)$ whenever $f(x)\neq f(y)$ .… (More)

- Gábor Tardos
- SIAM J. Discrete Math.
- 1988