Gábor P. Nagy

634 total citations
54 papers, 322 citations indexed

About

Gábor P. Nagy is a scholar working on Electrical and Electronic Engineering, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Gábor P. Nagy has authored 54 papers receiving a total of 322 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Electrical and Electronic Engineering, 28 papers in Geometry and Topology and 21 papers in Artificial Intelligence. Recurrent topics in Gábor P. Nagy's work include graph theory and CDMA systems (32 papers), Mathematics and Applications (24 papers) and Coding theory and cryptography (18 papers). Gábor P. Nagy is often cited by papers focused on graph theory and CDMA systems (32 papers), Mathematics and Applications (24 papers) and Coding theory and cryptography (18 papers). Gábor P. Nagy collaborates with scholars based in Hungary, Italy and United States. Gábor P. Nagy's co-authors include Imre Kondor, Gábor Korchmáros, Petr Vojtěchovský, Αλέξανδρος Νανόπουλος, Krisztián Búza, Jonathan I. Hall, Robert M. Guralnick, Tamás Szőnyi, Thomas Breuer and Andrea Lucchini and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and Journal of Banking & Finance.

In The Last Decade

Gábor P. Nagy

46 papers receiving 297 citations

Peers

Gábor P. Nagy
John H. Lindsey United States
Radoš Radoičić United States
K. B. Reid United States
Charles Ryavec United States
Mao-cheng Cai China
Antoine Deza Canada
Massimiliano Sala Italy
Garth Isaak United States
Eberhard Becker Germany
John H. Lindsey United States
Gábor P. Nagy
Citations per year, relative to Gábor P. Nagy Gábor P. Nagy (= 1×) peers John H. Lindsey

Countries citing papers authored by Gábor P. Nagy

Since Specialization
Citations

This map shows the geographic impact of Gábor P. Nagy'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 Gábor P. Nagy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gábor P. Nagy more than expected).

Fields of papers citing papers by Gábor P. Nagy

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gábor P. Nagy. 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 Gábor P. Nagy. The network helps show where Gábor P. Nagy may publish in the future.

Co-authorship network of co-authors of Gábor P. Nagy

This figure shows the co-authorship network connecting the top 25 collaborators of Gábor P. Nagy. A scholar is included among the top collaborators of Gábor P. Nagy 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 Gábor P. Nagy. Gábor P. Nagy is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Nagy, Gábor P., et al.. (2025). The random generation of Latin rectangles based on the assignment problem. Discrete Applied Mathematics. 378. 329–336.
2.
Nagy, Gábor P.. (2024). Sidon sets, thin sets, and the nonlinearity of vectorial Boolean functions. Journal of Combinatorial Theory Series A. 212. 106001–106001.
3.
Nagy, Gábor P., et al.. (2024). An extension formula for right Bol loops arising from Bol reflections. Communications in Algebra. 1–15.
4.
Carlet, Claude, et al.. (2023). Simplicity conditions for binary orthogonal arrays. SZTE Publicatio Repozitórium (University of Szeged). 1 indexed citations
5.
Korchmáros, Gábor & Gábor P. Nagy. (2021). Graphical Frobenius representations of non-abelian groups. SZTE Publicatio Repozitórium (University of Szeged). 2 indexed citations
6.
Nagy, Gábor P., et al.. (2020). Multimodal Approach for Kayaking Performance Analysis and Improvement. SHILAP Revista de lepidopterología. 19(2). 51–76. 2 indexed citations
7.
Korchmáros, Gábor, et al.. (2018). Hemisystems of the Hermitian surface. Journal of Combinatorial Theory Series A. 165. 408–439. 7 indexed citations
8.
Korchmáros, Gábor & Gábor P. Nagy. (2018). Group-labeled light dual multinets in the projective plane. Discrete Mathematics. 341(8). 2121–2130.
9.
Kinyon, Michael, Gábor P. Nagy, & Petr Vojtěchovský. (2016). Bol loops and Bruck loops of order pq. Journal of Algebra. 473. 481–512. 1 indexed citations
10.
Korchmáros, Gábor, et al.. (2015). Classification of k-nets. European Journal of Combinatorics. 48. 177–185. 1 indexed citations
11.
Grishkov, A., Michael Kinyon, & Gábor P. Nagy. (2014). Solvability of commutative automorphic loops. Proceedings of the American Mathematical Society. 142(9). 3029–3037. 4 indexed citations
12.
Korchmáros, Gábor, et al.. (2014). k-nets embedded in a projective plane over a field. COMBINATORICA. 35(1). 63–74. 4 indexed citations
13.
Nagy, Gábor P., et al.. (2013). On small 3-nets embedded in a projective plane over a field. Journal of Combinatorial Theory Series A. 120(7). 1632–1641. 4 indexed citations
14.
Nagy, Gábor P. & Petr Vojtěchovský. (2012). Automorphism groups of simple Moufang loops over perfect fields. 2 indexed citations
15.
Nagy, Gábor P.. (2009). On the multiplication groups of semifields. European Journal of Combinatorics. 31(1). 18–24. 1 indexed citations
16.
Nagy, Gábor P. & Petr Vojtěchovský. (2009). Moufang loops with commuting inner mappings. Journal of Pure and Applied Algebra. 213(11). 2177–2186. 5 indexed citations
17.
Nagy, Gábor P.. (2008). Some remarks on simple Bol loops. Commentationes Mathematicae Universitatis Carolinae. 49(2). 259–270. 5 indexed citations
18.
Nagy, Gábor P. & Petr Vojtěchovský. (2007). The Moufang loops of order 64 and 81. Journal of Symbolic Computation. 42(9). 871–883. 18 indexed citations
19.
Nagy, Gábor P.. (2007). Direct construction of code loops. Discrete Mathematics. 308(23). 5349–5357. 3 indexed citations
20.
Nagy, Gábor P. & Petr Vojtěchovský. (2003). Octonions, simple Moufang loops and triality. 10(1). 65–94. 6 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

Breakdown of academic impact, for papers by John H. Lindsey Breakdown of academic impact, for papers by Radoš Radoičić Breakdown of academic impact, for papers by K. B. Reid Breakdown of academic impact, for papers by Charles Ryavec Breakdown of academic impact, for papers by Mao-cheng Cai Breakdown of academic impact, for papers by Antoine Deza Breakdown of academic impact, for papers by Massimiliano Sala Breakdown of academic impact, for papers by Garth Isaak Breakdown of academic impact, for papers by Eberhard Becker
Rankless by CCL
2026