


default search action
András Sárközy
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j30]Katalin Gyarmati
, Christian Mauduit
, András Sárközy
:
On finite pseudorandom binary lattices. Discret. Appl. Math. 216: 589-597 (2017) - [j29]András Sárközy
:
On pseudorandomness of families of binary sequences. Discret. Appl. Math. 216: 670-676 (2017) - [c5]László Mérai
, Joël Rivat, András Sárközy:
The Measures of Pseudorandomness and the NIST Tests. NuTMiC 2017: 197-216 - 2015
- [j28]Katalin Gyarmati, András Sárközy:
On Reducible and Primitive Subsets of Fp, I. Integers 15A: A6 (2015) - 2014
- [p3]Katalin Gyarmati, Christian Mauduit, András Sárközy:
The cross-correlation measure for families of binary sequences. Applied Algebra and Number Theory 2014: 126-143 - 2013
- [j27]András Sárközy
:
On additive representation functions of finite sets, I (Variation). Period. Math. Hung. 66(2): 201-210 (2013) - [c4]Christian Mauduit, András Sárközy:
Family Complexity and VC-Dimension. Information Theory, Combinatorics, and Search Theory 2013: 346-363 - [p2]András Sárközy:
On Divisibility Properties of Sequences of Integers. The Mathematics of Paul Erdős I 2013: 221-232 - [p1]András Sárközy, Vera T. Sós:
On Additive Representative Functions. The Mathematics of Paul Erdős I 2013: 233-262 - 2012
- [j26]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): 425-449 (2012) - 2011
- [j25]Vsevolod F. Lev, András Sárközy:
An Erdős-Fuchs Type Theorem for Finite Groups. Integers 11A: Article15 (2011) - 2010
- [j24]Cécile Dartyge, András Sárközy
, Mihály Szalay:
On the pseudo-randomness of subsets related to primitive roots. Comb. 30(2): 139-162 (2010) - [j23]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): 260-269 (2010)
2000 – 2009
- 2009
- [j22]András Sárközy
, Arne Winterhof
:
Measures of pseudorandomness for binary sequences constructed using finite fields. Discret. Math. 309(6): 1327-1333 (2009) - 2008
- [j21]Rudolf Ahlswede, Julien Cassaigne, András Sárközy
:
On the correlation of binary sequences. Discret. Appl. Math. 156(9): 1478-1487 (2008) - 2007
- [j20]András Sárközy, C. L. Stewart:
On Pseudorandomness in Families of Sequences Derived from the Legendre Symbol. Period. Math. Hung. 54(2): 163-173 (2007) - [j19]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): 183-200 (2007) - 2006
- [c3]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 - [c2]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 - [c1]Joël Rivat, András Sárközy:
On Pseudorandom Sequences and Their Application. GTIT-C 2006: 343-361 - 2005
- [j18]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): 264-275 (2005) - [j17]Rudolf Ahlswede, Julien Cassaigne, András Sárközy
:
On the correlation of binary sequences. Electron. Notes Discret. Math. 21: 169-171 (2005) - [j16]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: 199-201 (2005) - [j15]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: 203-204 (2005) - [j14]Joël Rivat, András Sárközy
:
On pseudorandom sequences and their application. Electron. Notes Discret. Math. 21: 369-370 (2005) - [j13]Joël Rivat, András Sárközy
:
Modular constructions of pseudorandom binary sequences with composite moduli. Period. Math. Hung. 51(2): 75-107 (2005) - 2004
- [j12]Pascal Hubert, András Sárközy:
On p-pseudorandom binary sequences. Period. Math. Hung. 49(1): 73-91 (2004) - 2003
- [j11]Christian Mauduit
, András Sárközy
:
On the measures of pseudorandomness of binary sequences. Discret. Math. 271(1-3): 195-207 (2003) - [j10]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): 107-118 (2003) - 2001
- [j9]András Sárközy:
Unsolved problems in number theory. Period. Math. Hung. 42(1-2): 17-35 (2001) - [j8]Rudolf Ahlswede, Levon H. Khachatrian, András Sárközy:
On primitive sets of squarefree integers. Period. Math. Hung. 42(1-2): 99-115 (2001) - 2000
- [j7]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): 37-52 (2000)
1990 – 1999
- 1999
- [j6]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): 119-135 (1999) - [j5]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): 149-164 (1999) - 1995
- [j4]Paul Erdös, András Sárközy
, Vera T. Sós:
On product representations of powers, I. Eur. J. Comb. 16(6): 567-588 (1995) - 1994
- [j3]Paul Erdös, András Sárközy
, Vera T. Sós:
On additive properties of general sequences. Discret. Math. 136(1-3): 75-99 (1994) - 1992
- [j2]Paul Erdös, András Sárközy
:
Arithmetic progressions in subset sums. Discret. Math. 102(3): 249-264 (1992)
1980 – 1989
- 1989
- [j1]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): 155-166 (1989)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint