This map shows the geographic impact of Kai Salomaa'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 Kai Salomaa with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kai Salomaa more than expected).
This network shows the impact of papers produced by Kai Salomaa. 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 Kai Salomaa. The network helps show where Kai Salomaa may publish in the future.
Co-authorship network of co-authors of Kai Salomaa
This figure shows the co-authorship network connecting the top 25 collaborators of Kai Salomaa.
A scholar is included among the top collaborators of Kai Salomaa 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 Kai Salomaa. Kai Salomaa is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Salomaa, Kai, et al.. (2015). Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form.. International journal of unconventional computing. 11. 395–416.
6.
Choudhury, Salimur, Kai Salomaa, & Selim G. Akl. (2015). Cellular Automaton Based Localized Algorithms for Mobile Sensor Networks.. International journal of unconventional computing. 11. 417–447.2 indexed citations
7.
Choudhury, Salimur, Kai Salomaa, & Selim G. Akl. (2012). A Cellular Automaton Model for Wireless Sensor Networks.. 7. 223–241.12 indexed citations
8.
Salomaa, Kai, et al.. (2010). An improved cellular automata based algorithm for the 45-convex hull problem. 5. 107–120.3 indexed citations
Daley, Mark, Michael Domaratzki, & Kai Salomaa. (2008). State Complexity of Orthogonal Catenation.. 134–144.8 indexed citations
11.
Gao, Yuan, Kai Salomaa, & Sheng Yü. (2008). The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal. Fundamenta Informaticae. 83(1). 75–89.22 indexed citations
12.
Czeizler, Eugen, et al.. (2008). Watson-Crick automata: determinism and state complexity. 121–133.4 indexed citations
13.
Salomaa, Kai, et al.. (2006). State complexity of prefix-free regular languages. 165–176.6 indexed citations
14.
Gao, Yuan, Kai Salomaa, & Sheng Yü. (2006). State Complexity of Catenation and Reversal Combined with Star.. 153–164.2 indexed citations
15.
Han, Yo-Sub, Kai Salomaa, & Derick Wood. (2006). Prime decompositions of regular languages. Lecture notes in computer science. 4036. 145–155.6 indexed citations
16.
Salomaa, Kai & Sheng Yü. (1995). Nondeterminism Degrees for Context-Free Languages.. 16(1). 154–165.1 indexed citations
17.
Salomaa, Kai & Sheng Yü. (1993). Morphisms and rational tranducers.. Bulletin of the European Association for Theoretical Computer Science. 50. 186–193.1 indexed citations
18.
Jürgensen, Helmut, Kai Salomaa, & Sheng Yü. (1993). Decidability of the Intercode Property.. Journal of automata, languages and combinatorics. 29. 375–380.5 indexed citations
19.
Salomaa, Kai. (1992). Confluence, ground confluence, and termination of monadic term rewriting systems. Journal of automata, languages and combinatorics. 28(5). 279–309.1 indexed citations
20.
Salomaa, Arto, Kai Salomaa, & Sheng Yü. (1991). Primary Types of Instances of the Post Correspondence Problem.. Bulletin of the European Association for Theoretical Computer Science. 44. 226–241.1 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.