Giorgio Faina
- Artificial Intelligence top 5%
- Discrete Mathematics and Combinatorics top 2%
- Electrical and Electronic Engineering
- Computational Theory and Mathematics top 10%
- Geometry and Topology top 10%
- Co-authors
- Fernanda PambiancoStefano MarcuginiAlexander A. DavydovDaniele BartoliMassimo GiuliettiJürgen BierbrauerAlfredo MilaniYves Edel
- Topics
- Coding theory and cryptography (34 papers)Finite Group Theory Research (31 papers)graph theory and CDMA systems (28 papers)
- Journals
- SHILAP Revista de lepidopterologíaIEEE Transactions on Information TheoryDiscrete Mathematics
- Partner nations
- ItalyRussiaUnited States
In The Last Decade
Giorgio Faina
44 papers receiving 295 citations
Peers
Comparison fields: 5 of 25
- Artificial Intelligence 260
- Discrete Mathematics and Combinatorics 243
- Electrical and Electronic Engineering 195
- Computational Theory and Mathematics 38
- Geometry and Topology 33
Countries citing papers authored by Giorgio Faina
This map shows the geographic impact of Giorgio Faina'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 Giorgio Faina with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Giorgio Faina more than expected).
Fields of papers citing papers by Giorgio Faina
This network shows the impact of papers produced by Giorgio Faina. 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 Giorgio Faina. The network helps show where Giorgio Faina may publish in the future.
Co-authorship network of co-authors of Giorgio Faina
This figure shows the co-authorship network connecting the top 25 collaborators of Giorgio Faina. A scholar is included among the top collaborators of Giorgio Faina 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 Giorgio Faina. Giorgio Faina is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 3 | |
| 2 | 4 | |
| 3 | 6 | |
| 4 | 2 | |
| 5 | 5 | |
| 6 | New upper bounds on the smallest size of a complete cap in the space PG(3, q) | 5 |
| 7 | 11 | |
| 8 | Small Complete Caps In Galois Spaces. | 6 |
| 9 | 14 | |
| 10 | 17 | |
| 11 | 12 | |
| 12 | 8 | |
| 13 | 6 | |
| 14 | 8 | |
| 15 | The sizes k of the complete k-caps in PG(n, q), for small q and 3 = 5. | 11 |
| 16 | The Spectrum of Values k for which there Exists a Complete k-Arc in PG(2, q) for q<=23. | 10 |
| 17 | 4 | |
| 18 | Il Teorema di Hasse-Weil e la costruzione di archi completi di cardinalità piccola in piani di Galois di ordine dispari | 1 |
| 19 | I PIANI DI MOBIUS, LAGUERRE E MINKOWSKI E LE QUADRICHE NON SINGOLARI DELLO SPAZIO PROIETTIVO FINITO | 0 |
| 20 | 7 |
About Giorgio Faina
Giorgio Faina is a scholar working on Discrete Mathematics and Combinatorics, Artificial Intelligence and Geometry and Topology, having authored 49 papers that have together received 322 indexed citations. Recurring topics across this work include Coding theory and cryptography (34 papers), Finite Group Theory Research (31 papers) and graph theory and CDMA systems (28 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (243 citations), Artificial Intelligence (260 citations) and Geometry and Topology (33 citations). Giorgio Faina has collaborated with scholars based in Italy, Russia and United States. Frequent co-authors include Fernanda Pambianco, Stefano Marcugini, Alexander A. Davydov, Daniele Bartoli, Massimo Giulietti, Jürgen Bierbrauer, Alfredo Milani, Yves Edel and Olof Heden. Their work appears in journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and Discrete Mathematics.
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.