Andràs Sárközy

3.6k total citations
174 papers, 2.0k citations indexed

About

Andràs Sárközy is a scholar working on Algebra and Number Theory, Discrete Mathematics and Combinatorics and Artificial Intelligence. According to data from OpenAlex, Andràs Sárközy has authored 174 papers receiving a total of 2.0k indexed citations (citations by other indexed papers that have themselves been cited), including 79 papers in Algebra and Number Theory, 65 papers in Discrete Mathematics and Combinatorics and 57 papers in Artificial Intelligence. Recurrent topics in Andràs Sárközy's work include Analytic Number Theory Research (77 papers), Coding theory and cryptography (57 papers) and Limits and Structures in Graph Theory (53 papers). Andràs Sárközy is often cited by papers focused on Analytic Number Theory Research (77 papers), Coding theory and cryptography (57 papers) and Limits and Structures in Graph Theory (53 papers). Andràs Sárközy collaborates with scholars based in Hungary, France and United States. Andràs Sárközy's co-authors include Christian Mauduit, P. Erdös, Joël Rivat, Paul Erdős, C. L. Stewart, Julien Cassaigne, Katalin Gyarmati, Jean-Louis Nicolas, Carl Pomerance and Endre Szemerédi and has published in prestigious journals such as Mathematics of Computation, Journal of Mathematical Analysis and Applications and Transactions of the American Mathematical Society.

In The Last Decade

Andràs Sárközy

163 papers receiving 1.8k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Andràs Sárközy Hungary	23	914	866	861	713	496	174	2.0k
Christian Mauduit France	22	553 0.6×	922 1.1×	250 0.3×	809 1.1×	375 0.8×	90	1.5k
Imre Z. Ruzsa Hungary	22	548 0.6×	163 0.2×	1.1k 1.3×	641 0.9×	298 0.6×	140	1.7k
Melvyn B. Nathanson United States	16	539 0.6×	164 0.2×	707 0.8×	533 0.7×	219 0.4×	139	1.4k
Henning Stichtenoth Germany	26	193 0.2×	1.8k 2.1×	597 0.7×	578 0.8×	557 1.1×	72	2.3k
J. Pintz Hungary	19	776 0.8×	170 0.2×	620 0.7×	223 0.3×	111 0.2×	88	1.2k
Florian Luca Mexico	21	1.8k 2.0×	407 0.5×	853 1.0×	323 0.5×	110 0.2×	541	2.6k
Lowell Schoenfeld United States	13	976 1.1×	349 0.4×	407 0.5×	261 0.4×	111 0.2×	22	1.5k
R. Tijdeman Netherlands	19	499 0.5×	215 0.2×	167 0.2×	386 0.5×	56 0.1×	99	1.2k
R. Rado United Kingdom	15	219 0.2×	173 0.2×	1.4k 1.7×	1.5k 2.1×	331 0.7×	47	2.2k
M. A. Tsfasman Russia	14	122 0.1×	969 1.1×	245 0.3×	344 0.5×	458 0.9×	33	1.3k

Countries citing papers authored by Andràs Sárközy

Since Specialization

Citations

This map shows the geographic impact of Andràs Sárközy's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andràs Sárközy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andràs Sárközy more than expected).

Fields of papers citing papers by Andràs Sárközy

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andràs Sárközy. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andràs Sárközy. The network helps show where Andràs Sárközy may publish in the future.

Co-authorship network of co-authors of Andràs Sárközy

This figure shows the co-authorship network connecting the top 25 collaborators of Andràs Sárközy. A scholar is included among the top collaborators of Andràs Sárközy based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Andràs Sárközy. Andràs Sárközy is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Mauduit, Christian, Joël Rivat, & Andràs Sárközy. (2016). On the Digits of Sumsets. Canadian Journal of Mathematics. 69(3). 595–612. 3 indexed citations

Sárközy, Andràs. (2015). On pseudorandomness of families of binary sequences. Discrete Applied Mathematics. 216. 670–676. 3 indexed citations

Gyarmati, Katalin, Sergeĭ Konyagin, & Andràs Sárközy. (2013). On the reducibility of large sets of residues modulo p. Journal of Number Theory. 133(7). 2374–2397. 3 indexed citations

Goubin, Louis, Christian Mauduit, & Andràs Sárközy. (2004). Construction of large families of pseudorandom binary sequences. Journal of Number Theory. 106(1). 56–69. 69 indexed citations

Ahlswede, Rudolf, et al.. (2004). On the density of primitive sets. Journal of Number Theory. 109(2). 319–361. 2 indexed citations

Erdős, Paul, et al.. (1999). Greedy algorithm, arithmetic progressions, subset sums and divisibility. Discrete Mathematics. 200(1-3). 119–135. 6 indexed citations

Erdős, Paul, Christian Mauduit, & Andràs Sárközy. (1998). On Arithmetic Properties of Integers with Missing Digits I: Distribution in Residue Classes. Journal of Number Theory. 70(2). 99–120. 23 indexed citations

Nicolas, Jean-Louis, Imre Z. Ruzsa, & Andràs Sárközy. (1998). On the Parity of Additive Representation Functions. Journal of Number Theory. 73(2). 292–317. 38 indexed citations

Mauduit, Christian & Andràs Sárközy. (1996). On the Arithmetic Structure of Sets Characterized by Sum of Digits Properties. Journal of Number Theory. 61(1). 25–38. 37 indexed citations

10.

Erdös, P., Andràs Sárközy, & Vera T. Sós. (1994). On additive properties of general sequences. Discrete Mathematics. 136(1-3). 75–99. 18 indexed citations

11.

Erdős, Paul, et al.. (1994). On Sum Sets of Sidon Sets, 1.. Journal of Number Theory. 47(3). 329–347. 15 indexed citations

12.

Sárközy, Andràs. (1994). Fine Addition Theorems, II. Journal of Number Theory. 48(2). 197–218. 19 indexed citations

13.

Nathanson, Melvyn B. & Andràs Sárközy. (1989). On the Maximum Density of Minimal Asymptotic Bases. Proceedings of the American Mathematical Society. 105(1). 31–31.

14.

Nathanson, Melvyn B. & Andràs Sárközy. (1989). On the maximum density of minimal asymptotic bases. Proceedings of the American Mathematical Society. 105(1). 31–31. 3 indexed citations

15.

Sárközy, Andràs. (1989). Finite addition theorems, I. Journal of Number Theory. 32(1). 114–130. 38 indexed citations

16.

Elliott, P. D. T. A. & Andràs Sárközy. (1988). The distribution of the number of prime divisors of sums a + b. Journal of Number Theory. 29(1). 94–99. 11 indexed citations

17.

Erdös, P., Carl Pomerance, & Andràs Sárközy. (1987). On locally repeated values of certain arithmetic functions. III. Proceedings of the American Mathematical Society. 101(1). 1–7. 6 indexed citations

18.

Iwaniec, Henryk & Andràs Sárközy. (1987). On a multiplicative hybrid problem. Journal of Number Theory. 26(1). 89–95. 8 indexed citations

19.

Erdős, Paul & Andràs Sárközy. (1978). On differences and sums of integers, I. Journal of Number Theory. 10(4). 430–450. 7 indexed citations

20.

Erdős, Péter L., Andràs Sárközy, & Endre Szemerédi. (1966). On the solvability of the equations [ai, aj] = ar and (a′i, a′j) = a′r in sequences of positive density. Journal of Mathematical Analysis and Applications. 15(1). 60–64. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact