Takayoshi Shoudai
Impact in
-
- semigroups and automata theory
- Artificial Intelligence top 5%
- Algorithms and Data Compression
- Machine Learning and Algorithms
- Evolutionary Algorithms and Applications
Papers in
-
- Algorithms and Data Compression 47
- Machine Learning and Algorithms 39
-
- semigroups and automata theory 23
- Complexity and Algorithms in Graphs 5
- Co-authors
- Tomoyuki Uchida (39 shared papers)Tetsuhiro Miyahara (31 shared papers)Yusuke Suzuki (27 shared papers)Satoshi Matsumoto (15 shared papers)Keníchi Takahashi (8 shared papers)Hiroaki Ueda (8 shared papers)Satoru Miyano (11 shared papers)Y. Nakamura (5 shared papers)
In The Last Decade
Takayoshi Shoudai
67 papers receiving 465 citations
Peers
Comparison fields: 5 of 24
- Computational Theory and Mathematics 220
- Artificial Intelligence 384
- Information Systems 151
- Computer Networks and Communications 91
- Signal Processing 36
Countries citing papers authored by Takayoshi Shoudai
This map shows the geographic impact of Takayoshi Shoudai'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 Takayoshi Shoudai with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Takayoshi Shoudai more than expected).
Fields of papers citing papers by Takayoshi Shoudai
This network shows the impact of papers produced by Takayoshi Shoudai. 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 Takayoshi Shoudai. The network helps show where Takayoshi Shoudai may publish in the future.
Co-authors
The 25 scholars most cited alongside Takayoshi Shoudai, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 73 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 42 | |
| 2 | 2001 | 38 | |
| 3 | 2002 | 24 | |
| 4 | Parallel Algorithms for Refutation Tree Problem on Formal Graph Systems | 1995 | 20 |
| 5 | 2005 | 20 | |
| 6 | 1997 | 18 | |
| 7 | 2001 | 18 | |
| 8 | 2009 | 17 | |
| 9 | 2000 | 16 | |
| 10 | A List of P-Complete Problems | 1989 | 15 |
| 11 | 2002 | 14 | |
| 12 | 2008 | 12 | |
| 13 | 2009 | 12 | |
| 14 | 2003 | 11 | |
| 15 | 2003 | 11 | |
| 16 | 2004 | 9 | |
| 17 | 1999 | 9 | |
| 18 | 2007 | 9 | |
| 19 | 2004 | 8 | |
| 20 | Inductive Inference of Regular Term Free Languages and Its Application to Knowledge Discovery. | 1999 | 7 |
About Takayoshi Shoudai
Takayoshi Shoudai is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Information Systems, Computer Networks and Communications and Computer Vision and Pattern Recognition, having authored 73 papers that have together received 478 indexed citations. Recurring topics across this work include Algorithms and Data Compression (47 papers), Machine Learning and Algorithms (39 papers), semigroups and automata theory (23 papers), Data Mining Algorithms and Applications (11 papers), Advanced Database Systems and Queries (9 papers), Web Data Mining and Analysis (9 papers), Graph Theory and Algorithms (6 papers) and Complexity and Algorithms in Graphs (5 papers). The work is most often cited by research in Computational Theory and Mathematics (220 citations), Artificial Intelligence (384 citations), Information Systems (151 citations), Computer Networks and Communications (91 citations) and Signal Processing (36 citations). Takayoshi Shoudai has collaborated with scholars based in Japan and Australia. Frequent co-authors include Tomoyuki Uchida, Tetsuhiro Miyahara, Yusuke Suzuki, Satoshi Matsumoto, Keníchi Takahashi, Hiroaki Ueda, Satoru Miyano, Y. Nakamura, Yukiko Hayashi and Tsunenori Mine. Their work appears in journals such as Lecture notes in computer science, Theoretical Computer Science, Proceedings Genome Informatics Workshop/Genome informatics, European Journal of Combinatorics and Machine Learning.
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.