Faron Moller
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 5%
- Software top 5%
- Computer Science Applications top 5%
- Computer Networks and Communications
- Co-authors
- Yoram HirshfeldMark JerrumAlexander RabinovichTom CrickAnton SetzerPetr JančarHoang Nga NguyenSteve Schneider
- Topics
- Formal Methods in Verification (22 papers)semigroups and automata theory (13 papers)Teaching and Learning Programming (8 papers)
- Partner nations
- United KingdomSwedenIsrael
In The Last Decade
Faron Moller
43 papers receiving 453 citations
Peers
Comparison fields: 5 of 61
- Computational Theory and Mathematics 314
- Artificial Intelligence 231
- Software 89
- Computer Science Applications 58
- Computer Networks and Communications 42
Countries citing papers authored by Faron Moller
This map shows the geographic impact of Faron Moller'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 Faron Moller with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Faron Moller more than expected).
Fields of papers citing papers by Faron Moller
This network shows the impact of papers produced by Faron Moller. 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 Faron Moller. The network helps show where Faron Moller may publish in the future.
Co-authorship network of co-authors of Faron Moller
This figure shows the co-authorship network connecting the top 25 collaborators of Faron Moller. A scholar is included among the top collaborators of Faron Moller 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 Faron Moller. Faron Moller is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 3 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | 10 | |
| 6 | 23 | |
| 7 | Defining and Model Checking Abstractions of Complex Railway Models Using CSP||B | 2 |
| 8 | 3 | |
| 9 | 5 | |
| 10 | 34 | |
| 11 | 3 | |
| 12 | 10 | |
| 13 | 27 | |
| 14 | 26 | |
| 15 | Simulation and Bisimulation over One-Counter Processes | 1 |
| 16 | 14 | |
| 17 | 61 | |
| 18 | 35 | |
| 19 | 2 | |
| 20 | 2 |
About Faron Moller
Faron Moller is a scholar working on Software, Computer Science Applications and Computational Theory and Mathematics, having authored 48 papers that have together received 479 indexed citations. Recurring topics across this work include Formal Methods in Verification (22 papers), semigroups and automata theory (13 papers) and Teaching and Learning Programming (8 papers). The work is most often cited by research in Software (89 citations), Computational Theory and Mathematics (314 citations) and Computer Science Applications (58 citations). Faron Moller has collaborated with scholars based in United Kingdom, Sweden and Israel. Frequent co-authors include Yoram Hirshfeld, Mark Jerrum, Alexander Rabinovich, Tom Crick, Anton Setzer, Petr Jančar, Hoang Nga Nguyen, Steve Schneider, Helen Treharne and Markus Roggenbach. Their work appears in journals such as ACM Computing Surveys, Theoretical Computer Science and Journal of Computer and System Sciences.
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.