Citations per year, relative to Erkki Mäkinen Erkki Mäkinen (= 1×)
peers
Se June Hong
Countries citing papers authored by Erkki Mäkinen
Since
Specialization
Citations
This map shows the geographic impact of Erkki Mäkinen'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 Erkki Mäkinen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Erkki Mäkinen more than expected).
This network shows the impact of papers produced by Erkki Mäkinen. 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 Erkki Mäkinen. The network helps show where Erkki Mäkinen may publish in the future.
Co-authorship network of co-authors of Erkki Mäkinen
This figure shows the co-authorship network connecting the top 25 collaborators of Erkki Mäkinen.
A scholar is included among the top collaborators of Erkki Mäkinen 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 Erkki Mäkinen. Erkki Mäkinen is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Mäkinen, Erkki. (2012). On context-free derivations. Tampere University Institutional Repository (Tampere University).
3.
Mäkinen, Erkki. (2012). Remarks on the assignment heuristic for drawing bipartite graphs. Tampere University Institutional Repository (Tampere University).
Koskimies, Kai, et al.. (2008). Pattern-based genetic model refinements in MDA. Nordic journal of computing. 14(4). 338–355.14 indexed citations
6.
Mäkinen, Erkki & Harri Siirtola. (2005). The Barycenter Heuristic and the Reorderable Matrix. Informatica (slovenia). 29(3). 357–364.23 indexed citations
Mäkinen, Erkki. (2000). A Conjecture on the Error Bound of the Barycenter Heuristic.. Bulletin of the European Association for Theoretical Computer Science. 70. 156–158.1 indexed citations
9.
Koshiba, Takeshi, et al.. (2000). Inferring pure context-free languages from positive data. Acta Cybernetica. 14(3). 469–477.14 indexed citations
Mäkinen, Erkki. (1992). A note on Graftings, Rotations, and Distances in Binary Trees.. Bulletin of the European Association for Theoretical Computer Science. 46. 146–148.
14.
Katajainen, Jyrki & Erkki Mäkinen. (1990). A note on the complexity of trie compaction.. Bulletin of the European Association for Theoretical Computer Science. 41. 212–216.1 indexed citations
15.
Mäkinen, Erkki. (1990). How to draw a hypergraph. International Journal of Computer Mathematics. 34(3-4). 177–185.26 indexed citations
16.
Mäkinen, Erkki. (1987). Normal forms for pure context-free grammars.. Bulletin of the European Association for Theoretical Computer Science. 31. 35–37.1 indexed citations
17.
Mäkinen, Erkki. (1986). On szilard languages of pure context-free grammars. Journal of automata, languages and combinatorics. 22(10). 527–532.3 indexed citations
18.
Mäkinen, Erkki. (1983). On Certain Properties of Left Szilard Languages.. Journal of automata, languages and combinatorics. 19. 497–501.2 indexed citations
19.
Mäkinen, Erkki. (1970). The adjoint network in sensitivity investigations: The time-domain network sensitivity.. Journal of automata, languages and combinatorics. 6. 351–357.
20.
Mäkinen, Erkki & Antti U. Arstila. (1965). Orientation of tissue blocks for ultrathin sectioning--a one-stage embedding procedure.. PubMed. 40(6). 373–373.2 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.