András Sárközy
Periodica Mathematica Hungarica · 2001–2012
A researcher in the Science corpus: 8 papers; trusts 1 researcher and is trusted by 20 researchers here, as inferred from the citation graph.
Whom András Sárközy trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts András Sárközy overall
- Christian Elsholtz
- Terence Tao
- Romeo Mestrovic
- Brandon Hanson
- Yushuang Fan
- Bruce M. Landman
- Lingjiao Chen
- Pavel Etingof
- Igor E. Shparlinski
- Jeffrey C. Lagarias
Papers from András Sárközy's perspective
Ordered by how strongly the researchers András Sárközy trusts endorse each paper. Same corpus, a different order for every researcher.
- ON THE LEAST PRIMITIVE ROOT OF A PRIME
- On Computable Numbers, with an Application to the Entscheidungsproblem.
- On the complexity of algebraic numbers, II. Continued fractions
- Generalization of the Borel-Cantelli Lemma
- The Mobius function is strongly orthogonal to nilsequences
- Primes with an average sum of digits (Compositio Mathematica)
- Analytic Number Theory (All the Math You Missed)
- Random graphs (Wiley-Interscience series in discrete mathematics and optimization)
- Shadows and intersections: Stability and new proofs
- Combinatorial theorems in sparse random sets
Their papers
- Unsolved problems in number theory (2001) — 1,013 citations
- On additive decompositions of the set of quadratic residues modulo p (2012) — 55 citations
- On pseudorandom binary lattices (2006) — 47 citations
- Construction of pseudorandom binary sequences by using the multiplicative inverse (2005) — 50 citations
- On sums and products of residues modulo p (2005) — 49 citations
- Construction of Pseudorandom Binary Sequences Using Additive Characters (2004) — 77 citations
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness (2002) — 133 citations
- A finite pseudorandom binary sequence (2001) — 86 citations