 | 2008 |
| 15 |  | Rudolf Ahlswede,
Julien Cassaigne,
András Sárközy:
On the correlation of binary sequences.
Discrete Applied Mathematics 156(9): 1478-1487 (2008) |
| 2006 |
| 14 |  | Rudolf Ahlswede,
Christian Mauduit,
András Sárközy:
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I.
GTIT-C 2006: 293-307 |
| 13 |  | Rudolf Ahlswede,
Christian Mauduit,
András Sárközy:
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II.
GTIT-C 2006: 308-325 |
| 12 |  | Joël Rivat,
András Sárközy:
On Pseudorandom Sequences and Their Application.
GTIT-C 2006: 343-361 |
| 2005 |
| 11 |  | András Sárközy,
Gábor N. Sárközy:
On the size of partial block designs with large blocks.
Discrete Mathematics 305(1-3): 264-275 (2005) |
| 10 |  | Rudolf Ahlswede,
Julien Cassaigne,
András Sárközy:
On the correlation of binary sequences.
Electronic Notes in Discrete Mathematics 21: 169-171 (2005) |
| 9 |  | Rudolf Ahlswede,
Christian Mauduit,
András Sárközy:
Large families of pseudorandom sequences of k symbols and their complexity, Part II.
Electronic Notes in Discrete Mathematics 21: 199-201 (2005) |
| 8 |  | Rudolf Ahlswede,
Christian Mauduit,
András Sárközy:
Large families of pseudorandom sequences of k symbols and their complexity, Part I.
Electronic Notes in Discrete Mathematics 21: 203-204 (2005) |
| 7 |  | Joël Rivat,
András Sárközy:
On pseudorandom sequences and their application.
Electronic Notes in Discrete Mathematics 21: 369-370 (2005) |
| 2003 |
| 6 |  | Christian Mauduit,
András Sárközy:
On the measures of pseudorandomness of binary sequences.
Discrete Mathematics 271(1-3): 195-207 (2003) |
| 1999 |
| 5 |  | Paul Erdös,
Vsevolod F. Lev,
Gerard Rauzy,
Csaba Sándor,
András Sárközy:
Greedy algorithm, arithmetic progressions, subset sums and divisibility.
Discrete Mathematics 200(1-3): 119-135 (1999) |
| 4 |  | Paul Erdös,
Christian Mauduit,
András Sárközy:
On arithmetic properties of integers with missing digits II: Prime factors.
Discrete Mathematics 200(1-3): 149-164 (1999) |
| 1994 |
| 3 |  | Paul Erdös,
András Sárközy,
Vera T. Sós:
On additive properties of general sequences.
Discrete Mathematics 136(1-3): 75-99 (1994) |
| 1992 |
| 2 |  | Paul Erdös,
András Sárközy:
Arithmetic progressions in subset sums.
Discrete Mathematics 102(3): 249-264 (1992) |
| 1989 |
| 1 |  | Paul Erdös,
Jean-Louis Nicolas,
András Sárközy:
On the number of partitions of n without a given subsum (I).
Discrete Mathematics 75(1-3): 155-166 (1989) |