Andràs Sárközy
-
- Limits and Structures in Graph Theory 53
- Algebra and Number Theory top 0.5%
- Analytic Number Theory Research 77
- Advanced Mathematical Identities 29
- Computational Theory and Mathematics top 0.5%
- Computability, Logic, AI Algorithms 26
- Geometry and Topology top 2%
- Advanced Topology and Set Theory 13
- Mathematical Physics top 2%
- Advanced Mathematical Theories 19
-
- Coding theory and cryptography 57
-
- graph theory and CDMA systems 33
- Co-authors
- Christian MauduitP. ErdösJoël RivatPaul ErdősC. L. StewartJulien CassaigneKatalin GyarmatiJean-Louis Nicolas
- Cited by
- Discrete Mathematics and CombinatoricsAlgebra and Number TheoryComputational Theory and Mathematics
- Journals
- Mathematics of Computation (2 papers)Journal of Mathematical Analysis and Applications (1 paper)Transactions of the American Mathematical Society (2 papers)
- Partner nations
- HungaryFranceUnited States
In The Last Decade
Andràs Sárközy
163 papers receiving 1.8k citations
Peers
Comparison fields: 5 of 43
- Discrete Mathematics and Combinatorics 861
- Algebra and Number Theory 914
- Computational Theory and Mathematics 713
- Geometry and Topology 381
- Mathematical Physics 338
Countries citing papers authored by Andràs Sárközy
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
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
The 25 scholars most cited alongside Andràs Sárközy, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 3 | |
| 2 | 2015 | 3 | |
| 3 | 2013 | 3 | |
| 4 | 2004 | 69 | |
| 5 | 2004 | 2 | |
| 6 | 1999 | 6 | |
| 7 | 1998 | 23 | |
| 8 | 1998 | 38 | |
| 9 | 1996 | 37 | |
| 10 | 1994 | 18 | |
| 11 | 1994 | 15 | |
| 12 | 1994 | 19 | |
| 13 | 1989 | 0 | |
| 14 | 1989 | 3 | |
| 15 | 1989 | 38 | |
| 16 | 1988 | 11 | |
| 17 | 1987 | 6 | |
| 18 | 1987 | 8 | |
| 19 | 1978 | 7 | |
| 20 | 1966 | 2 |
About Andràs Sárközy
Andràs Sárközy is a scholar working on Discrete Mathematics and Combinatorics, Algebra and Number Theory and Theoretical Computer Science, having authored 174 papers that have together received 2.0k indexed citations. Recurring topics across this work include Analytic Number Theory Research (77 papers), Coding theory and cryptography (57 papers), Limits and Structures in Graph Theory (53 papers), graph theory and CDMA systems (33 papers), Advanced Mathematical Identities (29 papers), Computability, Logic, AI Algorithms (26 papers), Advanced Mathematical Theories (19 papers) and Advanced Topology and Set Theory (13 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (861 citations), Algebra and Number Theory (914 citations) and Computational Theory and Mathematics (713 citations). Andràs Sárközy has collaborated with scholars based in Hungary, France and United States. Frequent 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. Their work appears in journals such as Mathematics of Computation, Journal of Mathematical Analysis and Applications and Transactions of the American Mathematical Society.
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.