Kenichi Taniguchi

404 total citations
33 papers, 168 citations indexed

About

Kenichi Taniguchi is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Kenichi Taniguchi has authored 33 papers receiving a total of 168 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Artificial Intelligence, 12 papers in Computational Theory and Mathematics and 8 papers in Computer Networks and Communications. Recurrent topics in Kenichi Taniguchi's work include Formal Methods in Verification (9 papers), Logic, programming, and type systems (5 papers) and VLSI and Analog Circuit Testing (4 papers). Kenichi Taniguchi is often cited by papers focused on Formal Methods in Verification (9 papers), Logic, programming, and type systems (5 papers) and VLSI and Analog Circuit Testing (4 papers). Kenichi Taniguchi collaborates with scholars based in Japan and United States. Kenichi Taniguchi's co-authors include Tadao Kasami, Teruo Higashino, Minoru Ito, Keiichi Yasumoto, Kenichi Hagihara, Masaaki Mori, Hiroyuki Seki, Akira Kitajima, Katsuro Inoue and Yoshinobu Takegami and has published in prestigious journals such as IEEE Transactions on Software Engineering, SIAM Journal on Computing and Computer Networks.

In The Last Decade

Kenichi Taniguchi

28 papers receiving 151 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Kenichi Taniguchi Japan 7 102 71 55 32 23 33 168
Axel Poigné Germany 8 87 0.9× 98 1.4× 43 0.8× 11 0.3× 25 1.1× 23 165
Maarten M. Fokkinga Netherlands 8 99 1.0× 54 0.8× 37 0.7× 15 0.5× 20 0.9× 27 136
Walter Dosch Germany 7 152 1.5× 95 1.3× 49 0.9× 8 0.3× 33 1.4× 37 213
Nikos Gorogiannis United Kingdom 8 177 1.7× 53 0.7× 43 0.8× 16 0.5× 30 1.3× 21 229
Andrea Formisano Italy 9 193 1.9× 66 0.9× 67 1.2× 18 0.6× 14 0.6× 55 247
C. Tomlinson United States 9 172 1.7× 66 0.9× 165 3.0× 21 0.7× 74 3.2× 14 271
Tommy Thorn France 6 140 1.4× 36 0.5× 98 1.8× 57 1.8× 29 1.3× 6 209
Jean-Marie Hullot France 5 233 2.3× 134 1.9× 54 1.0× 10 0.3× 38 1.7× 8 278
Albert Rubio Spain 11 205 2.0× 157 2.2× 32 0.6× 14 0.4× 12 0.5× 33 296
Stefan Blom Netherlands 9 121 1.2× 156 2.2× 57 1.0× 7 0.2× 50 2.2× 31 219

Countries citing papers authored by Kenichi Taniguchi

Since Specialization
Citations

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

Fields of papers citing papers by Kenichi Taniguchi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Kenichi Taniguchi

This figure shows the co-authorship network connecting the top 25 collaborators of Kenichi Taniguchi. A scholar is included among the top collaborators of Kenichi Taniguchi 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 Kenichi Taniguchi. Kenichi Taniguchi 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.
Yamaguchi, Hirozumi, et al.. (2003). Reducing the size of routing tables for large-scale network simulation. 115–122. 5 indexed citations
2.
Taniguchi, Kenichi, et al.. (2000). Symbolic Model Checking Algorithm for a System consisting of Extended Finite State Machines with Integer Input Registers. 100(471). 9–16.
3.
Kitajima, Akira, Keiichi Yasumoto, Teruo Higashino, & Kenichi Taniguchi. (1999). Deriving Concurrent Synchronous EFSMs from Protocol Specifications in LOTOS (Special Section on Selected Papers from the 11th Workshop on Circuits and Systems in Karuizawa). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 82(3). 487–494. 2 indexed citations
4.
Kitajima, Akira, Keiichi Yasumoto, Teruo Higashino, & Kenichi Taniguchi. (1998). A Method to Convert Concurrent EFSMs with Multi-Rendezvous into Synchronous Sequential Circuit(Special Section on Concurrent Systems Technology). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(4). 566–575. 1 indexed citations
5.
Yasumoto, Keiichi, Teruo Higashino, & Kenichi Taniguchi. (1994). Software process description using LOTOS and its enaction. International Conference on Software Engineering. 169–178. 8 indexed citations
6.
Yamaguchi, Hirozumi, et al.. (1994). Synthesis of Protocol Specifications from Service Specifications of Distributed Systems in a Marked Graph Model. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 77(10). 1623–1633. 1 indexed citations
7.
Higashino, Teruo, et al.. (1993). LOTOS enhancement to specify time constraint among non-adjacent actions using first order logic. 451–466. 5 indexed citations
8.
Higashino, Teruo, et al.. (1992). VTM: A Graph Editor for Large Trees. 12. 210–216. 3 indexed citations
9.
Taniguchi, Kenichi, et al.. (1992). ASL program written in abstract sequential machine style and its compiler. Systems and Computers in Japan. 23(7). 1–11. 1 indexed citations
10.
Higashino, Teruo, Gregor von Bochmann, Xiangdong Li, Keiichi Yasumoto, & Kenichi Taniguchi. (1992). Test System for a Restricted Class of LOTOS Expressions with Data Parameters. 205–216. 5 indexed citations
11.
Higashino, Teruo, et al.. (1989). Automated Verification of Equivalence of Protocol Machines. 235–246. 2 indexed citations
12.
Ito, Minoru, M. Iwasaki, Kenichi Taniguchi, & Tadao Kasami. (1984). Membership problems for data dependencies in relational expressions. Theoretical Computer Science. 34(3). 315–335. 5 indexed citations
13.
Ito, Minoru, Kenichi Taniguchi, & Tadao Kasami. (1983). Membership problem for embedded multivalued dependencies under some restricted conditions. Theoretical Computer Science. 22(1-2). 175–193. 3 indexed citations
14.
Suzuki, Ichirō, et al.. (1982). EFFICIENT EXECUTION IN A CLASS OF TERM REWRITING SYSTEMS.. 13(4). 22–30. 1 indexed citations
15.
Mori, Masaaki, et al.. (1982). ALGEBRAIC SPECIFICATION OF HDLC PROCEDURES.. 12. 64–74. 2 indexed citations
16.
Watanabe, Yoshihisa, et al.. (1979). The Carbonylation of α-Haloacetophenones and Benzyl Halides by Disodium Tetracarbonylferrate. Bulletin of the Chemical Society of Japan. 52(6). 1869–1870. 8 indexed citations
17.
Taniguchi, Kenichi & Tadao Kasami. (1976). A result on the equivalence problem for deterministicpushdown automata. Journal of Computer and System Sciences. 13(1). 38–50. 24 indexed citations
18.
Taniguchi, Kenichi, et al.. (1975). ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA.. 6(1). 36–44. 1 indexed citations
19.
Taniguchi, Kenichi & Tadao Kasami. (1970). Reduction of context-free grammars. Information and Control. 17(1). 92–108. 2 indexed citations
20.
Taniguchi, Kenichi & Tadao Kasami. (1969). A note on computing time for the recognition of context-free languages by a single-tape Turing machine. Information and Control. 14(3). 278–284. 5 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 Axel Poigné Breakdown of academic impact, for papers by Maarten M. Fokkinga Breakdown of academic impact, for papers by Walter Dosch Breakdown of academic impact, for papers by Nikos Gorogiannis Breakdown of academic impact, for papers by Andrea Formisano Breakdown of academic impact, for papers by C. Tomlinson Breakdown of academic impact, for papers by Tommy Thorn Breakdown of academic impact, for papers by Jean-Marie Hullot Breakdown of academic impact, for papers by Albert Rubio Breakdown of academic impact, for papers by Stefan Blom
Rankless by CCL
2026