On the number of partitions of n without a given subsum (I). - Paul Erdös; Jean-Louis Nicolas; András Sárközy (Discret. Math., 1989)

Arithmetic progressions in subset sums. - Paul Erdös; András Sárközy (Discret. Math., 1992)

On additive properties of general sequences. - Paul Erdös; András Sárközy; Vera T. Sós (Discret. Math., 1994)

On product representations of powers, I. - Paul Erdös; András Sárközy; Vera T. Sós (Eur. J. Comb., 1995)

Greedy algorithm, arithmetic progressions, subset sums and divisibility. - Paul Erdös; Vsevolod F. Lev; Gerard Rauzy; Csaba Sándor; András Sárközy (Discret. Math., 1999)

On arithmetic properties of integers with missing digits II: Prime factors. - Paul Erdös; Christian Mauduit; András Sárközy (Discret. Math., 1999)

On the Number of Prime Facttors of Integers Characterized by Digit Properties. - Sergei Konyagin; Christian Mauduit; András Sárközy (Period. Math. Hung., 2000)

On primitive sets of squarefree integers. - Rudolf Ahlswede; Levon H. Khachatrian; András Sárközy (Period. Math. Hung., 2001)

Unsolved problems in number theory. - András Sárközy (Period. Math. Hung., 2001)

On the measures of pseudorandomness of binary sequences. - Christian Mauduit; András Sárközy (Discret. Math., 2003)

A complexity measure for families of binary sequences. - Rudolf Ahlswede; Levon H. Khachatrian; Christian Mauduit; András Sárközy (Period. Math. Hung., 2003)

On p-pseudorandom binary sequences. - Pascal Hubert; András Sárközy (Period. Math. Hung., 2004)

On the size of partial block designs with large blocks. - András Sárközy; Gábor N. Sárközy (Discret. Math., 2005)

Large families of pseudorandom sequences of k symbols and their complexity, Part II. - Rudolf Ahlswede; Christian Mauduit; András Sárközy (Electron. Notes Discret. Math., 2005)

Large families of pseudorandom sequences of k symbols and their complexity, Part I. - Rudolf Ahlswede; Christian Mauduit; András Sárközy (Electron. Notes Discret. Math., 2005)

On pseudorandom sequences and their application. - Joël Rivat; András Sárközy (Electron. Notes Discret. Math., 2005)

Modular constructions of pseudorandom binary sequences with composite moduli. - Joël Rivat; András Sárközy (Period. Math. Hung., 2005)

Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I. - Rudolf Ahlswede; Christian Mauduit; András Sárközy (GTIT-C, 2006)

Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II. - Rudolf Ahlswede; Christian Mauduit; András Sárközy (GTIT-C, 2006)

On Pseudo-Random Subsets of the Set of the Integers Not Exceeding N. - Cécile Dartyge; András Sárközy (Period. Math. Hung., 2007)

On Pseudorandomness in Families of Sequences Derived from the Legendre Symbol. - András Sárközy; C. L. Stewart (Period. Math. Hung., 2007)

On the correlation of binary sequences. - Rudolf Ahlswede; Julien Cassaigne; András Sárközy (Discret. Appl. Math., 2008)

Measures of pseudorandomness for binary sequences constructed using finite fields. - András Sárközy; Arne Winterhof (Discret. Math., 2009)

On the pseudo-randomness of subsets related to primitive roots. - Cécile Dartyge; András Sárközy; Mihály Szalay (Comb., 2010)

On a problem of Erdos on integers, none of which divides the product of k others. - Tsz Ho Chan; Ervin Györi; András Sárközy (Eur. J. Comb., 2010)

An Erdős-Fuchs Type Theorem for Finite Groups. - Vsevolod F. Lev; András Sárközy (Integers, 2011)

Density and ramsey type results on algebraic equations with restricted solution sets. - Péter Csikvári; Katalin Gyarmati; András Sárközy (Comb., 2012)

On Divisibility Properties of Sequences of Integers. - András Sárközy (The Mathematics of Paul Erdős I, 2013)

On Additive Representative Functions. - András Sárközy; Vera T. Sós (The Mathematics of Paul Erdős I, 2013)

Family Complexity and VC-Dimension. - Christian Mauduit; András Sárközy (Information Theory, Combinatorics, and Search Theory, 2013)

On additive representation functions of finite sets, I (Variation). - András Sárközy (Period. Math. Hung., 2013)

The cross-correlation measure for families of binary sequences. - Katalin Gyarmati; Christian Mauduit; András Sárközy (Applied Algebra and Number Theory, 2014)

On Reducible and Primitive Subsets of Fp, I. - Katalin Gyarmati; András Sárközy (Integers, 2015)

The Measures of Pseudorandomness and the NIST Tests. - László Mérai; Joël Rivat; András Sárközy (NuTMiC, 2017)

On finite pseudorandom binary lattices. - Katalin Gyarmati; Christian Mauduit; András Sárközy (Discret. Appl. Math., 2017)

On pseudorandomness of families of binary sequences. - András Sárközy (Discret. Appl. Math., 2017)