Nikos Leonardos
- Artificial Intelligence
- Information Systems
- Computer Networks and Communications
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics
- Co-authors
- Aggelos KiayiasJuan A. GarayMichael SaksQiang TangHelger LipmaaDionysis ZindrosTroy LeeSreeram Kannan
- Topics
- Cryptography and Data Security (4 papers)Complexity and Algorithms in Graphs (3 papers)Blockchain Technology Applications and Security (3 papers)
- Journals
- SHILAP Revista de lepidopterologíaJournal of the ACMTheoretical Computer Science
- Partner nations
- GreeceUnited StatesUnited Kingdom
In The Last Decade
Nikos Leonardos
7 papers receiving 40 citations
Peers
Comparison fields: 5 of 10
- Artificial Intelligence 28
- Information Systems 19
- Computer Networks and Communications 15
- Computational Theory and Mathematics 15
- Discrete Mathematics and Combinatorics 1
Countries citing papers authored by Nikos Leonardos
This map shows the geographic impact of Nikos Leonardos'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 Nikos Leonardos with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nikos Leonardos more than expected).
Fields of papers citing papers by Nikos Leonardos
This network shows the impact of papers produced by Nikos Leonardos. 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 Nikos Leonardos. The network helps show where Nikos Leonardos may publish in the future.
Co-authorship network of co-authors of Nikos Leonardos
This figure shows the co-authorship network connecting the top 25 collaborators of Nikos Leonardos. A scholar is included among the top collaborators of Nikos Leonardos 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 Nikos Leonardos. Nikos Leonardos is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 14 | |
| 2 | 0 | |
| 3 | 0 | |
| 4 | 2 | |
| 5 | 4 | |
| 6 | 1 | |
| 7 | 13 | |
| 8 | An improved lower bound for the randomized decision tree complexity of recursive majority. | 1 |
| 9 | 8 |
About Nikos Leonardos
Nikos Leonardos is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications, having authored 9 papers that have together received 43 indexed citations. Recurring topics across this work include Cryptography and Data Security (4 papers), Complexity and Algorithms in Graphs (3 papers) and Blockchain Technology Applications and Security (3 papers). The work is most often cited by research in Computational Theory and Mathematics (15 citations), Artificial Intelligence (28 citations) and Information Systems (19 citations). Nikos Leonardos has collaborated with scholars based in Greece, United States and United Kingdom. Frequent co-authors include Aggelos Kiayias, Juan A. Garay, Michael Saks, Qiang Tang, Helger Lipmaa, Dionysis Zindros, Troy Lee, Sreeram Kannan, Matthias Fitzi and Ioannis Papaioannou. Their work appears in journals such as SHILAP Revista de lepidopterología, Journal of the ACM and Theoretical Computer Science.
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.