András Sárközy

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