András Sárközy

According to our database1, András Sárközy authored at least 34 papers between 1989 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
On pseudorandomness of families of binary sequences.
Discret. Appl. Math., 2017

On finite pseudorandom binary lattices.
Discret. Appl. Math., 2017

The Measures of Pseudorandomness and the NIST Tests.
Proceedings of the Number-Theoretic Methods in Cryptology - First International Conference, 2017

2015
On Reducible and Primitive Subsets of Fp, I.
Integers, 2015

2014
The cross-correlation measure for families of binary sequences.
Proceedings of the Applied Algebra and Number Theory, 2014

2013
On additive representation functions of finite sets, I (Variation).
Period. Math. Hung., 2013

Family Complexity and VC-Dimension.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

On Additive Representative Functions.
Proceedings of the Mathematics of Paul Erdős I, 2013

On Divisibility Properties of Sequences of Integers.
Proceedings of the Mathematics of Paul Erdős I, 2013

2012
Density and ramsey type results on algebraic equations with restricted solution sets.
Comb., 2012

2011
An Erdős-Fuchs Type Theorem for Finite Groups.
Integers, 2011

2010
On a problem of Erdos on integers, none of which divides the product of k others.
Eur. J. Comb., 2010

On the pseudo-randomness of subsets related to primitive roots.
Comb., 2010

2009
Measures of pseudorandomness for binary sequences constructed using finite fields.
Discret. Math., 2009

2006
Large Families of Pseudorandom Sequences of <i>k</i> Symbols and Their Complexity - Part II.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Large Families of Pseudorandom Sequences of <i>k</i> Symbols and Their Complexity - Part I.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005
Modular constructions of pseudorandom binary sequences with composite moduli.
Period. Math. Hung., 2005

On pseudorandom sequences and their application.
Electron. Notes Discret. Math., 2005

Large families of pseudorandom sequences of k symbols and their complexity, Part I.
Electron. Notes Discret. Math., 2005

Large families of pseudorandom sequences of k symbols and their complexity, Part II.
Electron. Notes Discret. Math., 2005

On the correlation of binary sequences.
Electron. Notes Discret. Math., 2005

On the size of partial block designs with large blocks.
Discret. Math., 2005

2004
On <i>p</i>-pseudorandom binary sequences.
Period. Math. Hung., 2004

2003
A complexity measure for families of binary sequences.
Period. Math. Hung., 2003

On the measures of pseudorandomness of binary sequences.
Discret. Math., 2003

2001
Unsolved problems in number theory.
Period. Math. Hung., 2001

On primitive sets of squarefree integers.
Period. Math. Hung., 2001

2000
On the Number of Prime Facttors of Integers Characterized by Digit Properties.
Period. Math. Hung., 2000

1999
On arithmetic properties of integers with missing digits II: Prime factors.
Discret. Math., 1999

Greedy algorithm, arithmetic progressions, subset sums and divisibility.
Discret. Math., 1999

1995
On product representations of powers, I.
Eur. J. Comb., 1995

1994
On additive properties of general sequences.
Discret. Math., 1994

1992
Arithmetic progressions in subset sums.
Discret. Math., 1992

1989
On the number of partitions of n without a given subsum (I).
Discret. Math., 1989


  Loading...