I Tomohiro

847 total citations
37 papers, 156 citations indexed

About

I Tomohiro is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, I Tomohiro has authored 37 papers receiving a total of 156 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Artificial Intelligence, 21 papers in Computational Theory and Mathematics and 11 papers in Hardware and Architecture. Recurrent topics in I Tomohiro's work include Algorithms and Data Compression (35 papers), semigroups and automata theory (15 papers) and Natural Language Processing Techniques (15 papers). I Tomohiro is often cited by papers focused on Algorithms and Data Compression (35 papers), semigroups and automata theory (15 papers) and Natural Language Processing Techniques (15 papers). I Tomohiro collaborates with scholars based in Japan, Germany and Finland. I Tomohiro's co-authors include Shunsuke Inenaga, Masayuki Takeda, Hideo Bannai, Yuto Nakashima, Hiroshi Sakamoto, Kunihiko Sadakane, Johannes Fischer, Tsuyoshi Okita, Simon J. Puglisi and Florín Manea and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Electronics.

In The Last Decade

I Tomohiro

33 papers receiving 153 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
I Tomohiro Japan 7 144 75 52 40 21 37 156
Jakub Radoszewski Poland 8 171 1.2× 85 1.1× 85 1.6× 50 1.3× 11 0.5× 46 191
Paweł Gawrychowski Poland 9 134 0.9× 68 0.9× 71 1.4× 35 0.9× 17 0.8× 46 180
Marcin Kubica Poland 7 137 1.0× 57 0.8× 90 1.7× 40 1.0× 11 0.5× 17 176
Tomasz Kociumaka Poland 9 155 1.1× 77 1.0× 113 2.2× 31 0.8× 16 0.8× 54 224
Avivit Levy Israel 7 110 0.8× 60 0.8× 49 0.9× 18 0.5× 12 0.6× 32 125
Edson N. Cáceres Brazil 7 83 0.6× 31 0.4× 32 0.6× 29 0.7× 15 0.7× 32 135
D. Liu United States 2 131 0.9× 55 0.7× 68 1.3× 31 0.8× 12 0.6× 4 153
Sabrina Mantaci Italy 8 183 1.3× 103 1.4× 111 2.1× 20 0.5× 11 0.5× 23 222
Shunsuke Inenaga Japan 9 303 2.1× 173 2.3× 109 2.1× 95 2.4× 31 1.5× 94 330
Dominik Kempa Finland 7 108 0.8× 54 0.7× 19 0.4× 47 1.2× 17 0.8× 24 114

Countries citing papers authored by I Tomohiro

Since Specialization
Citations

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

Fields of papers citing papers by I Tomohiro

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of I Tomohiro

This figure shows the co-authorship network connecting the top 25 collaborators of I Tomohiro. A scholar is included among the top collaborators of I Tomohiro 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 I Tomohiro. I Tomohiro 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
1.
Tomohiro, I, et al.. (2024). On the Hardness of Smallest RLSLPs and Collage Systems. 243–252. 1 indexed citations
2.
Bannai, Hideo, et al.. (2023). Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica. 86(3). 735–756.
3.
Tomohiro, I, et al.. (2022). A Compression-Based Multiple Subword Segmentation for Neural Machine Translation. Electronics. 11(7). 1014–1014. 9 indexed citations
4.
Boucher, Christina, Travis Gagie, I Tomohiro, et al.. (2021). PHONI: Streamed Matching Statistics with Multi-Genome References. CINECA IRIS Institutial research information system (University of Pisa). 6 indexed citations
5.
Ohno, Tatsuya, et al.. (2019). RePair in Compressed Space and Time. 592. 518–527. 3 indexed citations
6.
Tomohiro, I, et al.. (2018). Improved upper bounds on all maximal α-gapped repeats and palindromes. Theoretical Computer Science. 753. 1–15. 1 indexed citations
7.
Ohno, Tatsuya, et al.. (2018). A faster implementation of online RLBWT and its application to LZ77 parsing. Journal of Discrete Algorithms. 52-53. 18–28. 3 indexed citations
8.
Nakashima, Yuto, Takashi Okabe, I Tomohiro, et al.. (2017). Inferring strings from Lyndon factorization. Theoretical Computer Science. 689. 147–156. 2 indexed citations
9.
Gawrychowski, Paweł, et al.. (2017). Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes. Theory of Computing Systems. 62(1). 162–191. 5 indexed citations
10.
Tomohiro, I. (2017). Longest Common Extensions with Recompression. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
11.
Tomohiro, I, et al.. (2016). Online Grammar Compression for Frequent Pattern Discovery. 93–104.
12.
Bannai, Hideo, et al.. (2016). Closed factorization. Discrete Applied Mathematics. 212. 23–29. 3 indexed citations
13.
Tomohiro, I, et al.. (2016). Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
14.
Tomohiro, I, et al.. (2015). Compressed automata for dictionary matching. Theoretical Computer Science. 578. 30–41. 2 indexed citations
15.
Tomohiro, I, et al.. (2014). Detecting regularities on grammar-compressed strings. Information and Computation. 240. 74–89. 4 indexed citations
16.
Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, & Masayuki Takeda. (2013). Inferring strings from suffix trees and links on a binary alphabet. Discrete Applied Mathematics. 163. 316–325. 7 indexed citations
17.
Tomohiro, I, et al.. (2013). Computing reversed Lempel-Ziv factorization online. 107–118. 1 indexed citations
18.
Tomohiro, I, Shunsuke Inenaga, & Masayuki Takeda. (2012). Palindrome pattern matching. Theoretical Computer Science. 483. 162–170. 14 indexed citations
19.
Tomohiro, I, et al.. (2011). Robustness Evaluation of Common Information Exploiting Characteristics of Multipath Fading Channel For Handheld Devices. IEICE technical report. Speech. 111(75). 15–20. 1 indexed citations
20.
Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, & Masayuki Takeda. (2011). Verifying and enumerating parameterized border arrays. Theoretical Computer Science. 412(50). 6959–6981. 8 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

Breakdown of academic impact, for papers by Jakub Radoszewski Breakdown of academic impact, for papers by Paweł Gawrychowski Breakdown of academic impact, for papers by Marcin Kubica Breakdown of academic impact, for papers by Tomasz Kociumaka Breakdown of academic impact, for papers by Avivit Levy Breakdown of academic impact, for papers by Edson N. Cáceres Breakdown of academic impact, for papers by D. Liu Breakdown of academic impact, for papers by Sabrina Mantaci Breakdown of academic impact, for papers by Shunsuke Inenaga Breakdown of academic impact, for papers by Dominik Kempa
Rankless by CCL
2026