Hiroshi Umeo

855 total citations
50 papers, 150 citations indexed

About

Hiroshi Umeo is a scholar working on Computational Theory and Mathematics, Molecular Biology and Computer Networks and Communications. According to data from OpenAlex, Hiroshi Umeo has authored 50 papers receiving a total of 150 indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Computational Theory and Mathematics, 35 papers in Molecular Biology and 18 papers in Computer Networks and Communications. Recurrent topics in Hiroshi Umeo's work include Cellular Automata and Applications (44 papers), DNA and Biological Computing (35 papers) and Modular Robots and Swarm Intelligence (12 papers). Hiroshi Umeo is often cited by papers focused on Cellular Automata and Applications (44 papers), DNA and Biological Computing (35 papers) and Modular Robots and Swarm Intelligence (12 papers). Hiroshi Umeo collaborates with scholars based in Japan, France and Italy. Hiroshi Umeo's co-authors include Kenichi Morita, Tetsuo Asano, Ferdinand Peper, Masato Teraoka, Susumu Adachi, Teijiro Isokawa, Jia Lee, Katsunobu Imai, Luca Manzoni and Nobuyuki Matsui and has published in prestigious journals such as SHILAP Revista de lepidopterología, Physica D Nonlinear Phenomena and Applied Mathematics and Computation.

In The Last Decade

Hiroshi Umeo

41 papers receiving 144 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Hiroshi Umeo Japan 7 132 102 39 36 32 50 150
Shankara Narayanan Krishna India 7 91 0.7× 111 1.1× 51 1.3× 64 1.8× 31 1.0× 45 179
Claudio Ferretti Italy 7 56 0.4× 116 1.1× 37 0.9× 57 1.6× 9 0.3× 36 153
Alexandru Popa Romania 7 65 0.5× 23 0.2× 30 0.8× 6 0.2× 53 1.7× 37 151
S. Yu Canada 6 139 1.1× 58 0.6× 90 2.3× 5 0.1× 12 0.4× 15 183
Markus L. Schmid Germany 6 61 0.5× 25 0.2× 72 1.8× 7 0.2× 10 0.3× 34 98
Jin Sima United States 10 92 0.7× 264 2.6× 148 3.8× 15 0.4× 116 3.6× 27 317
Martin Plátek Czechia 8 86 0.7× 82 0.8× 124 3.2× 6 0.2× 7 0.2× 40 163
Joffroy Beauquier France 11 72 0.5× 15 0.1× 64 1.6× 22 0.6× 179 5.6× 38 225
Toshiki Saitoh Japan 8 80 0.6× 16 0.2× 48 1.2× 2 0.1× 40 1.3× 26 129
Przemysław Uznański Poland 6 29 0.2× 10 0.1× 25 0.6× 17 0.5× 71 2.2× 21 106

Countries citing papers authored by Hiroshi Umeo

Since Specialization
Citations

This map shows the geographic impact of Hiroshi Umeo'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 Hiroshi Umeo with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hiroshi Umeo more than expected).

Fields of papers citing papers by Hiroshi Umeo

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hiroshi Umeo. 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 Hiroshi Umeo. The network helps show where Hiroshi Umeo may publish in the future.

Co-authorship network of co-authors of Hiroshi Umeo

This figure shows the co-authorship network connecting the top 25 collaborators of Hiroshi Umeo. A scholar is included among the top collaborators of Hiroshi Umeo 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 Hiroshi Umeo. Hiroshi Umeo is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
2.
Umeo, Hiroshi, et al.. (2017). A new reconstruction and the first implementation of Goto’s FSSP algorithm. Applied Mathematics and Computation. 318. 92–108.
3.
Manzoni, Luca & Hiroshi Umeo. (2014). The firing squad synchronization problem on CA with multiple updating cycles. Theoretical Computer Science. 559. 108–117. 1 indexed citations
4.
Umeo, Hiroshi, et al.. (2010). A construction of smallest real-time prime generators on cellular automata. 338–342. 3 indexed citations
5.
Umeo, Hiroshi. (2009). Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata. 4(1). 1–20. 2 indexed citations
6.
Umeo, Hiroshi, et al.. (2009). A Simple Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays. 74. 120–125. 1 indexed citations
7.
Umeo, Hiroshi, et al.. (2009). Simulation of generalized synchronization processes on one-dimensional cellular automata. 350–357. 1 indexed citations
8.
Umeo, Hiroshi, et al.. (2009). A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem. Fundamenta Informaticae. 91(1). 161–178. 1 indexed citations
9.
Umeo, Hiroshi, et al.. (2008). A Note on Three-Dimensional Firing Squad Synchronization Algorithm. ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications. 773–776. 1 indexed citations
10.
Umeo, Hiroshi, et al.. (2008). A Note on Sequence Generation Power of Communication-Restricted Cellular Automata with Small Number of States.. Parallel and Distributed Processing Techniques and Applications. 764–770.
11.
Umeo, Hiroshi, et al.. (2008). A New Time-Optimum Synchronization Algorithm for Rectangle Arrays. Fundamenta Informaticae. 87(2). 155–164. 4 indexed citations
12.
Umeo, Hiroshi, et al.. (2006). A State-Efficient Mapping Scheme for Designing Two-Dimensional Firing Squad Synchronization Algorithms. Fundamenta Informaticae. 74(4). 603–623. 7 indexed citations
13.
Umeo, Hiroshi, et al.. (2005). A Survey on Optimum-Time Firing Squad Synchronization Algorithms for One-Dimensional Cellular Automata. International journal of unconventional computing. 1. 403–426. 10 indexed citations
14.
Umeo, Hiroshi, et al.. (2004). An Efficient Protocol for Synchronizing Two-Dimensional Cellular Arrays in Optimum-Time. ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications. 116–119. 2 indexed citations
15.
Umeo, Hiroshi. (2004). A Simple Design of Time-Efficient Firing Squad Synchronization Algorithms with Fault-Tolerance. IEICE Transactions on Information and Systems. 87(3). 733–739. 10 indexed citations
16.
Umeo, Hiroshi, et al.. (2003). Broadcast-bus elimination without any loss of time efficiency in iterative (cellular or systolic) arrays. 18. 4/130–4/135. 1 indexed citations
17.
Bandini, Stefania, Sara Manzoni, & Hiroshi Umeo. (2002). Proceedings of the 5th International Conference on Cellular Automata for Research and Industry. 1 indexed citations
18.
Umeo, Hiroshi. (2001). Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton. Parallel Computing. 27(5). 587–599. 7 indexed citations
19.
Umeo, Hiroshi, et al.. (1989). Broadcast-bus elimination without any loss of time efficiency in iterative (cellular or systolic) arrays. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 72(5). 647–655.
20.
Umeo, Hiroshi & Tetsuo Asano. (1989). Systolic algorithms for computational geometry problems — A survey. Computing. 41(1-2). 19–40. 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026