Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Handbook of Formal Languages
1997940 citationsGrzegorz Rozenberg, Arto Salomaaprofile →
This map shows the geographic impact of Arto 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 Arto Salomaa with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arto Salomaa more than expected).
This network shows the impact of papers produced by Arto 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 Arto Salomaa. The network helps show where Arto Salomaa may publish in the future.
Co-authorship network of co-authors of Arto Salomaa
This figure shows the co-authorship network connecting the top 25 collaborators of Arto Salomaa.
A scholar is included among the top collaborators of Arto 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 Arto Salomaa. Arto Salomaa is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Salomaa, Arto. (2009). Characteristic Words for Parikh Matrices.. 117–127.3 indexed citations
4.
Pǎun, Gheorghe, Grzegorz Rozenberg, & Arto Salomaa. (2006). DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series). Springer eBooks.50 indexed citations
5.
Ding, Cunsheng & Arto Salomaa. (2006). On Some Problems of Mateescu Concerning Subword Occurrences. Fundamenta Informaticae. 73(1). 65–79.22 indexed citations
6.
Ding, Cunsheng & Arto Salomaa. (2006). Secret Sharing Schemes with Nice Access Structures. Fundamenta Informaticae. 73(1). 51–63.16 indexed citations
7.
Mateescu, Alexandru, Arto Salomaa, & Sheng Yü. (2002). Factorizations of languages and commutativity conditions. Acta Cybernetica. 15(3). 339–351.15 indexed citations
Salomaa, Arto, et al.. (1997). Lindenmayer and DNA: Watson-Crick D0L Systems.. Bulletin of the European Association for Theoretical Computer Science. 62. 740–751.8 indexed citations
10.
Rozenberg, Grzegorz & Arto Salomaa. (1997). Handbook of formal languages, vol. 3: beyond words. Springer eBooks.95 indexed citations
11.
Pǎun, Gheorghe & Arto Salomaa. (1996). DNA COMPUTING BASED ON THE SPLICING OPERATION. Mathematica japonica. 43(3). 607–632.17 indexed citations
12.
Salomaa, Arto. (1995). Return to Patterns.. Bulletin of the European Association for Theoretical Computer Science. 55.13 indexed citations
13.
Pǎun, Gheorghe & Arto Salomaa. (1992). Decision Problems Concerning the Thinness of DOL Languages.. Bulletin of the European Association for Theoretical Computer Science. 46. 171–181.4 indexed citations
14.
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
Salomaa, Arto, et al.. (1990). Secret Selling of Secrets with Several Buyers.. Bulletin of the European Association for Theoretical Computer Science. 42. 178–186.11 indexed citations
17.
Demetrovics, János, et al.. (1986). Algebra, combinatorics, and logic in computer science. North-Holland eBooks.15 indexed citations
18.
Salomaa, Arto, et al.. (1986). Computation and Automata. The Mathematical Gazette. 70(451). 75–75.63 indexed citations
19.
Salomaa, Arto. (1978). Equality sets for homomorphisms of free monoids.. Acta Cybernetica. 4. 127–139.31 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.