Marko Moisio
Impact in
-
- Finite Group Theory Research
- Artificial Intelligence top 5%
- Coding theory and cryptography
- Cryptographic Implementations and Security
Papers in
-
- Coding theory and cryptography 17
-
- Analytic Number Theory Research 7
- Co-authors
- Cunsheng Ding (1 shared paper)Jin Yuan (1 shared paper)Keijo Väänänen (1 shared paper)Petr Lisoněk (1 shared paper)Daqing Wan (1 shared paper)
In The Last Decade
Marko Moisio
17 papers receiving 267 citations
Peers
Comparison fields: 5 of 18
- Discrete Mathematics and Combinatorics 75
- Artificial Intelligence 269
- Algebra and Number Theory 36
- Geometry and Topology 35
- Computer Networks and Communications 91
Countries citing papers authored by Marko Moisio
This map shows the geographic impact of Marko Moisio'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 Marko Moisio with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marko Moisio more than expected).
Fields of papers citing papers by Marko Moisio
This network shows the impact of papers produced by Marko Moisio. 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 Marko Moisio. The network helps show where Marko Moisio may publish in the future.
Co-authors
The 5 scholars most cited alongside Marko Moisio, 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 | 2007 | 96 | |
| 2 | 2000 | 27 | |
| 3 | 2006 | 22 | |
| 4 | 2009 | 21 | |
| 5 | 2007 | 18 | |
| 6 | 2005 | 12 | |
| 7 | Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm | 2012 | 11 |
| 8 | 2008 | 11 | |
| 9 | 1999 | 11 | |
| 10 | 2011 | 10 | |
| 11 | Exponential Sums, Gauss Sums and Cyclic Codes | 1997 | 10 |
| 12 | 2008 | 9 | |
| 13 | 2007 | 8 | |
| 14 | 2009 | 8 | |
| 15 | 2004 | 3 | |
| 16 | 2009 | 3 | |
| 17 | 2008 | 2 |
About Marko Moisio
Marko Moisio is a scholar working on Artificial Intelligence, Algebra and Number Theory, Discrete Mathematics and Combinatorics, Geometry and Topology and Electrical and Electronic Engineering, having authored 17 papers that have together received 282 indexed citations. Recurring topics across this work include Coding theory and cryptography (17 papers), Analytic Number Theory Research (7 papers), Finite Group Theory Research (5 papers), graph theory and CDMA systems (5 papers), Algebraic Geometry and Number Theory (5 papers), Advanced Algebra and Geometry (4 papers), Cooperative Communication and Network Coding (3 papers) and DNA and Biological Computing (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (75 citations), Artificial Intelligence (269 citations), Algebra and Number Theory (36 citations), Geometry and Topology (35 citations) and Computer Networks and Communications (91 citations). Marko Moisio has collaborated with scholars based in Finland, Hong Kong and Australia. Frequent co-authors include Cunsheng Ding, Jin Yuan, Keijo Väänänen, Petr Lisoněk and Daqing Wan. Their work appears in journals such as Finite Fields and Their Applications, IEEE Transactions on Information Theory, Acta Arithmetica, Designs Codes and Cryptography and Journal für die reine und angewandte Mathematik (Crelles Journal).
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.