András Sárközy

Publication Activity (10 Years)

Years Active: 1989-2017
Publications (10 Years): 4

Top Topics

National Institute Of Standards And Technology

Disjoint Subsets

Top Venues

Discret. Appl. Math.

Publications

László Mérai, Joël Rivat, András Sárközy
The Measures of Pseudorandomness and the NIST Tests. NuTMiC (2017)
Katalin Gyarmati, Christian Mauduit, András Sárközy
On finite pseudorandom binary lattices. Discret. Appl. Math. 216 (2017)
András Sárközy
On pseudorandomness of families of binary sequences. Discret. Appl. Math. 216 (2017)
Katalin Gyarmati, András Sárközy
On Reducible and Primitive Subsets of Fp, I. Integers (2015)
Christian Mauduit, András Sárközy
Family Complexity and VC-Dimension. Information Theory, Combinatorics, and Search Theory (2013)
András Sárközy
On additive representation functions of finite sets, I (Variation). Period. Math. Hung. 66 (2) (2013)
Péter Csikvári, Katalin Gyarmati, András Sárközy
Density and ramsey type results on algebraic equations with restricted solution sets. Comb. 32 (4) (2012)
Vsevolod F. Lev, András Sárközy
An Erdős-Fuchs Type Theorem for Finite Groups. Integers (2011)
Cécile Dartyge, András Sárközy, Mihály Szalay
On the pseudo-randomness of subsets related to primitive roots. Comb. 30 (2) (2010)
Tsz Ho Chan, Ervin Györi, András Sárközy
On a problem of Erdos on integers, none of which divides the product of k others. Eur. J. Comb. 31 (1) (2010)
András Sárközy, Arne Winterhof
Measures of pseudorandomness for binary sequences constructed using finite fields. Discret. Math. 309 (6) (2009)
Rudolf Ahlswede, Julien Cassaigne, András Sárközy
On the correlation of binary sequences. Discret. Appl. Math. 156 (9) (2008)
Cécile Dartyge, András Sárközy
On Pseudo-Random Subsets of the Set of the Integers Not Exceeding N. Period. Math. Hung. 54 (2) (2007)
András Sárközy, C. L. Stewart
On Pseudorandomness in Families of Sequences Derived from the Legendre Symbol. Period. Math. Hung. 54 (2) (2007)
Rudolf Ahlswede, Christian Mauduit, András Sárközy
Symbols and Their Complexity - Part II. GTIT-C (2006)
Joël Rivat, András Sárközy
On Pseudorandom Sequences and Their Application. GTIT-C (2006)
Rudolf Ahlswede, Christian Mauduit, András Sárközy
Symbols and Their Complexity - Part I. GTIT-C (2006)
Rudolf Ahlswede, Christian Mauduit, András Sárközy
Large families of pseudorandom sequences of k symbols and their complexity, Part I. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Julien Cassaigne, András Sárközy
On the correlation of binary sequences. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Christian Mauduit, András Sárközy
Large families of pseudorandom sequences of k symbols and their complexity, Part II. Electron. Notes Discret. Math. 21 (2005)
Joël Rivat, András Sárközy
Modular constructions of pseudorandom binary sequences with composite moduli. Period. Math. Hung. 51 (2) (2005)
András Sárközy, Gábor N. Sárközy
On the size of partial block designs with large blocks. Discret. Math. 305 (1-3) (2005)
Joël Rivat, András Sárközy
On pseudorandom sequences and their application. Electron. Notes Discret. Math. 21 (2005)
Pascal Hubert, András Sárközy
-pseudorandom binary sequences. Period. Math. Hung. 49 (1) (2004)
Christian Mauduit, András Sárközy
On the measures of pseudorandomness of binary sequences. Discret. Math. 271 (1-3) (2003)
Rudolf Ahlswede, Levon H. Khachatrian, Christian Mauduit, András Sárközy
A complexity measure for families of binary sequences. Period. Math. Hung. 46 (2) (2003)
Rudolf Ahlswede, Levon H. Khachatrian, András Sárközy
On primitive sets of squarefree integers. Period. Math. Hung. 42 (1-2) (2001)
András Sárközy
Unsolved problems in number theory. Period. Math. Hung. 42 (1-2) (2001)
Sergei Konyagin, Christian Mauduit, András Sárközy
On the Number of Prime Facttors of Integers Characterized by Digit Properties. Period. Math. Hung. 40 (1) (2000)
Paul Erdös, Vsevolod F. Lev, Gerard Rauzy, Csaba Sándor, András Sárközy
Greedy algorithm, arithmetic progressions, subset sums and divisibility. Discret. Math. 200 (1-3) (1999)
Paul Erdös, Christian Mauduit, András Sárközy
On arithmetic properties of integers with missing digits II: Prime factors. Discret. Math. 200 (1-3) (1999)
Paul Erdös, András Sárközy, Vera T. Sós
On product representations of powers, I. Eur. J. Comb. 16 (6) (1995)
Paul Erdös, András Sárközy, Vera T. Sós
On additive properties of general sequences. Discret. Math. 136 (1-3) (1994)
Paul Erdös, András Sárközy
Arithmetic progressions in subset sums. Discret. Math. 102 (3) (1992)
Paul Erdös, Jean-Louis Nicolas, András Sárközy
On the number of partitions of n without a given subsum (I). Discret. Math. 75 (1-3) (1989)